TY - GEN
T1 - Opportunistic multipath forwarding in content-based publish/subscribe overlays
AU - Sherafat Kazemzadeh, Reza
AU - Jacobsen, Hans Arno
PY - 2012
Y1 - 2012
N2 - Fine-grained filtering capabilities prevalent in content-based Publish/Subscribe (pub/sub) overlays lead to scenarios in which publications pass through brokers with no matching local subscribers. Processing of publications at these pure forwarding brokers amounts to inefficient use of resources and should ideally be avoided. This paper develops an approach that largely mitigates this problem by building and adaptively maintaining a highly connected overlay mesh superimposed atop a low connectivity primary overlay network. While the primary network provides basic end-to-end forwarding routes, the mesh structure provides a rich set of alternative forwarding choices which can be used to bypass pure forwarding brokers. This provides unique opportunities for load balancing and congestion avoidance. Through extensive experimental evaluation on the SciNet cluster and PlanetLab, we compare the performance of our approach with that of conventional pub/sub algorithms as baseline. Our results indicate that our approach improves publication delivery delay and lowers network traffic while incurring negligible computational and bandwidth overhead. Furthermore, compared to the baseline, we observed significant gains of up to 115% in terms of system throughput.
AB - Fine-grained filtering capabilities prevalent in content-based Publish/Subscribe (pub/sub) overlays lead to scenarios in which publications pass through brokers with no matching local subscribers. Processing of publications at these pure forwarding brokers amounts to inefficient use of resources and should ideally be avoided. This paper develops an approach that largely mitigates this problem by building and adaptively maintaining a highly connected overlay mesh superimposed atop a low connectivity primary overlay network. While the primary network provides basic end-to-end forwarding routes, the mesh structure provides a rich set of alternative forwarding choices which can be used to bypass pure forwarding brokers. This provides unique opportunities for load balancing and congestion avoidance. Through extensive experimental evaluation on the SciNet cluster and PlanetLab, we compare the performance of our approach with that of conventional pub/sub algorithms as baseline. Our results indicate that our approach improves publication delivery delay and lowers network traffic while incurring negligible computational and bandwidth overhead. Furthermore, compared to the baseline, we observed significant gains of up to 115% in terms of system throughput.
UR - http://www.scopus.com/inward/record.url?scp=84869763620&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-35170-9_13
DO - 10.1007/978-3-642-35170-9_13
M3 - Conference contribution
AN - SCOPUS:84869763620
SN - 9783642351693
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 249
EP - 270
BT - Middleware 2012 - ACM/IFIP/USENIX 13th International Middleware Conference, Proceedings
PB - Springer Verlag
T2 - 13th ACM/IFIP/USENIX International Middleware Conference, Middleware 2012
Y2 - 3 December 2012 through 7 December 2012
ER -