On the performance improvement of gossip protocols for content-based publish-subscribe through caching

Gossip protocols are a common solution for content-based publish-subscribe. However, in spite of the advantages that these protocols present in comparison to other approaches, such as distributed hash tables, they also have inherent scalability issues. In this paper, CCPS (Caching Content-based Publish-Subscribe) is presented as a publish-subscribe protocol designed to address these scalability issues. Through caching, CCPS exploits search query repetition to address load balancing problems. It has been designed having in mind its use in combination with existing publish-subscribe solutions so as to improve their performance. In the paper, the protocol description together with the implementation details of its fundamental operations are provided, while CCPS performance is evaluated against standard gossip protocols.

[1]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[2]  Jun Wang,et al.  Foreseer: A Novel, Locality-Aware Peer-to-Peer System Architecture for Keyword Searches , 2004, Middleware.

[3]  Stefano Ferretti,et al.  Publish-subscribe systems via gossip: a study based on complex networks , 2011, SIMPLEX '12.

[4]  Piet Van Mieghem,et al.  Modeling gossip-based content dissemination and search in distributed networking , 2011, Comput. Commun..

[5]  Edith Cohen,et al.  Associative search in peer to peer networks: Harnessing latent semantics , 2007, Comput. Networks.

[6]  Yoav Tock,et al.  SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication , 2007, DEBS '07.

[7]  Emiliano Casalicchio,et al.  Distributed subscriptions clustering with limited knowledge sharing for content-based publish/subscribe systems , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[8]  Carey L. Williamson,et al.  A tale of the tails: Power-laws in internet measurements , 2013, IEEE Network.

[9]  Amir H. Payberah,et al.  Vitis: A Gossip-based Hybrid Overlay for Internet-scale Publish/Subscribe Enabling Rendezvous Routing in Unstructured Overlay Networks , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[10]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[12]  Siavash Khorsandi,et al.  A popularity-based query scheme in P2P networks using adaptive gossip sampling , 2013, Peer Peer Netw. Appl..

[13]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[14]  Antonio Fernández,et al.  A generic theoretical framework for modeling gossip-based algorithms , 2007, OPSR.

[15]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[16]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[17]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[18]  Kevin Lü,et al.  Organisation and management of shared documents in super-peer networks based semantic hierarchical cluster trees , 2012, Peer Peer Netw. Appl..

[19]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[20]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[21]  José Pereira,et al.  StAN: exploiting shared interests without disclosing them in gossip-based publish/subscribe , 2010, IPTPS.

[22]  Raouf Boutaba,et al.  A Survey of Distributed Search Techniques in Large Scale Distributed Systems , 2011, IEEE Communications Surveys & Tutorials.

[23]  Márk Jelasity,et al.  T-Man: Gossip-based fast overlay topology construction , 2009, Comput. Networks.

[24]  Barry Smyth,et al.  Exploiting Query Repetition and Regularity in an Adaptive Community-Based Web Search Engine , 2004, User Modeling and User-Adapted Interaction.

[25]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[26]  Patrick Th. Eugster,et al.  The "art" of programming gossip-based systems , 2007, OPSR.

[27]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[28]  Christian Bauckhage,et al.  Insights into Internet Memes , 2011, ICWSM.

[29]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.