The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - Dec. (2013 vol.24)
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
ABSTRACT
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.
INDEX TERMS
Subscriptions, Scalability, Clustering methods,link sharing, Publish and subscribe, scalability, topic-based, interest correlation, subscription clustering
CITATION
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. 12, pp. 2462-2471, Dec. 2013, doi:10.1109/TPDS.2013.6
REFERENCES
[1] P. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec, "The Many Faces of Publish/Subscribe," ACM Computing Survey, vol. 35, no. 2, pp. 114-131, 2003.
[2] A. Nunes, J. Marques, and J. Pereira, "Seeds: The Social Internet Feed Caching and Dissemination Architecture," Proc. INForum Simpósio de Informática, 2009.
[3] S. Jun and M. Ahamad, "Feedex: Collaborative Exchange of News Feeds," Proc. Int'l Conf. World Wide Web, 2006.
[4] J. Patel, E. Rivière, I. Gupta, and A.-M. Kermarrec, "Rappel: Exploiting Interest and Network Locality to Improve Fairness in Publish-Subscribe Systems," Computer Networks, vol. 53, no. 13, pp. 2304-2320, Aug. 2009.
[5] G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, "Spidercast: A Scalable Interest-Aware Overlay for Topic-Based Pub/Sub Communication," Proc. Int'l Conf. Distributed Event-Based Systems, 2007.
[6] S. Voulgaris, E. Rivière, A.-M. Kermarrec, and M. van Steen, "Sub-2-Sub: Self-Organizing Content-Based Publish Subscribe for Dynamic Large Scale Collaborative Networks," Proc. Int'l Workshop Peer-to-Peer Systems, 2006.
[7] G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, "Constructing Scalable Overlays for Pub-Sub with Many Topics," Proc. 26th Ann. ACM Symp. Principles of Distributed Computing, 2007.
[8] R. Baldoni, R. Beraldi, V. Quema, L. Querzoni, and S. Tucci-Piergiovanni, "TERA: Topic-Based Event Routing for Peer-to-Peer Architectures," Proc. Int'l Conf. Distributed Event-Based Systems, 2007.
[9] K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, M. Mihai, and Y. Minsky, "Bimodal Multicast," ACM Trans. Computer Systems, vol. 17, no. 2, pp. 41-88, 1999.
[10] P. Eugster, R. Guerraoui, S. Handurukande, P. Kouznetsov, and A.-M. Kermarrec, "Lightweight Probabilistic Broadcast," ACM Trans. Computer Systems, vol. 21, no. 4, pp. 341-374, 2003.
[11] M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen, "Gossip-Based Peer Sampling," ACM Trans. Computer Systems, vol. 25, no. 3,article 8, Aug. 2007.
[12] R. Chand and P. Felber, "Semantic Peer-to-Peer Overlays for Publish/Subscribe Networks," Proc. Int'l Conf. Parallel and Distributed Computing, 2005.
[13] M. Jelasity, A. Montresor, and O. Babaoglu, "T-Man: Gossip-Based Fast Overlay Topology Construction," Int'l J. Computer and Telecomm. Networking , vol. 53, no. 13, pp. 2321-2339, Aug. 2009.
[14] L. Massoulié, A.-M. Kermarrec, and A. Ganesh, "Network Awareness and Failure Resilience in Self-Organising Overlay Networks," Proc. Symp. Reliable Distributed Systems, 2003.
[15] "Planetlab," http:/www.planet-lab.org, 2013.
[16] http://www.livejournal.comstats.bml, 2013.
[17] "Wikipedia Database Dumps," http:/dumps.wikimedia.org/, 2013.
[18] M. Matos, A. Nunes, R. Oliveira, and J. Pereira, "Stan: Exploiting Shared Interests without Disclosing Them in Gossip-Based Publish/Subscribe," Proc. Ninth Int'l Workshop Peer-to-Peer Systems (IPTPS '10), 2010.
[19] M. Matos, P. Felber, R. Oliveira, J. Pereira, and E. Rivière, "Scaling Up Publish/Subscribe Overlays Using Interest Correlation for Link Sharing (Supplemental Document)," (TO BE COMPLETED FOR THE CAMERA READY).
[20] H. Liu, V. Ramasubramanian, and E. Sirer, "Client Behavior and Feed Characteristics of RSS, a Publish-Subscribe System for Web Micronews," Proc. Internet Measurement Conf., 2005.
[21] P. Fraigniaud, P. Gauron, and M. Latapy, "Combining the Use of Clustering and Scale-Free Nature of Exchanges into a Simple and Efficient P2P System," Proc. Int'l Conf. Parallel and Distributed Computing, 2005.
[22] S. Saroiu, P.K. Gummadi, and S.D. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," Proc. ACM/SPIE Multimedia Computing and Networking, 2002.
[23] S. Handurukande, A.-M. Kermarrec, F. Le Fessant, L. Massoulié, and S. Patarin, "Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-Less File Sharing Systems," Proc. First ACM SIGOPS/EuroSys European Conf. Computer Systems, 2006.
[24] A.J. Ganesh, A.-M. Kermarrec, and L. Massoulié, "SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication," Proc. Third Int'l COST264 Workshop Networked Group Comm. (NGC '01), pp. 44-55, 2001.
[25] P. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié, "From Epidemics to Distributed Computing," Computer, vol. 37, no. 5, pp. 60-67, May 2004.
[26] J. Pereira, L. Rodrigues, R. Oliveira, and A.-M. Kermarrec, "NeEM: Network-Friendly Epidemic Multicast," Proc. Symp. Reliable Distributed Systems, 2003.
[27] S. Baehni, P. Eugster, and R. Guerraoui, "Data-Aware Multicast," Proc. Int'l Conf. Dependable Systems and Networks, 2004.
[28] M. Luby, Pseudorandomness and Cryptographic Applications. Princeton Univ. Press, 1994.
[29] C. Gkantsidis, M. Mihail, and A. Saberi, "Random Walks in Peer-to-Peer Networks: Algorithms and Evaluation," Performance Evaluation - P2P Computing Systems, vol. 63, no. 3, pp. 241-263, 2006.
[30] D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin, "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web," Proc. 29th Ann. ACM Symp. Theory Computing (STOC '97), 1997.
[31] L. Adamic and B. Huberman, "Zipf's Law and the Internet," Glottometrics, vol. 3, no. 1, pp. 143-150, 2002.
[32] L. Leonini, E. Rivière, and P. Felber, "SPLAY: Distributed Systems Evaluation Made Simple (or How to Turn Ideas into Live Systems in a Breeze)," Proc. Symp. Networked Systems Design and Implementation, 2009.
[33] A.-M. Kermarrec, L. Massoulié, and A. Ganesh, "Probabilistic Reliable Dissemination in Large-Scale Systems," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 3, pp. 248-258, Mar. 2003.
[34] M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, "SCRIBE: A Large-Scale and Decentralized Application-Level Multicast Infrastructure," IEEE J. Selected Areas Comm., vol. 20, no. 8, pp. 1489-1499, Oct. 2002.
[35] S. Ratnasamy, M. Handley, R.M. Karp, and S. Shenker, "Application-Level Multicast Using Content-Addressable Networks," Proc. Workshop Networked Group Comm., 2001.
[36] S. Girdzijauskas, G. Chockler, Y. Vigfusson, Y. Tock, and R. Melamed, "Magnet: Practical Subscription Clustering for Internet-Scale Publish/Subscribe," Proc. Int'l Conf. Distributed Event-Based Systems, 2010.
[37] M. Onus and A.W. Richa, "Parameterized Maximum and Average Degree Approximation in Topic-Based Publish-Subscribe Overlay Network Design," Proc. IEEE Int'l Conf. Distributed Computing Systems, 2010.
[38] C. Chen, H.-A. Jacobsen, and R. Vitenberg, "Divide and Conquer Algorithms for Publish/Subscribe Overlay Design," Proc. IEEE Int'l Conf. Distributed Computing Systems, 2010.
[39] C. Chen, R. Vitenberg, and H.-A. Jacobsen, "Scaling Construction of Low Fan-out Overlays for Topic-Based Publish/Subscribe Systems," Proc. IEEE Int'l Conf. Distributed Computing Systems, 2011.
[40] L. Querzoni, "Interest Clustering Techniques for Efficient Event Routing in Large-Scale Settings," Proc. Int'l Conf. Distributed Event-Based Systems, 2008.
7 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool