The Community for Technology Leaders
Green Image
Issue No. 12 - Dec. (2013 vol. 24)
ISSN: 1045-9219
pp: 2462-2471
Miguel Matos , INESC TEC and the University of Minho, Braga
Pascal Felber , University of Neuchâtel, Neuchâtel
Rui Oliveira , INESC TEC and the University of Minho, Braga
Jose O. Pereira , INESC TEC and the University of Minho, Braga
Etienne Riviere , University of Neuchâtel, Neuchâtel
Topic-based publish/subscribe is at the core of many distributed systems, ranging from application integration middleware to news dissemination. Therefore, much research was dedicated to publish/subscribe architectures and protocols, and in particular to the design of overlay networks for decentralized topic-based routing and efficient message dissemination. Nonetheless, existing systems fail to take full advantage of shared interests when disseminating information, hence suffering from high maintenance and traffic costs, or construct overlays that cope poorly with the scale and dynamism of large networks. In this paper, we present StaN, a decentralized protocol that optimizes the properties of gossip-based overlay networks for topic-based publish/subscribe by sharing a large number of physical connections without disrupting its logical properties. StaN relies only on local knowledge and operates by leveraging common interests among participants to improve global resource usage and promote topic and event scalability. The experimental evaluation under two real workloads, both via a real deployment and through simulation, shows that StaN provides an attractive infrastructure for scalable topic-based publish/subscribe.
Subscriptions, Scalability, Clustering methods,link sharing, Publish and subscribe, scalability, topic-based, interest correlation, subscription clustering
Miguel Matos, Pascal Felber, Rui Oliveira, Jose O. Pereira, Etienne Riviere, "Scaling Up Publish/Subscribe Overlays Using Interest Correlation for Link Sharing", IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 2462-2471, Dec. 2013, doi:10.1109/TPDS.2013.6
195 ms
(Ver 3.1 (10032016))