Gossiping in distributed systems

Gossip-based algorithms were first introduced for reliably disseminating data in large-scale distributed systems. However, their simplicity, robustness, and flexibility make them attractive for more than just pure data dissemination alone. In particular, gossiping has been applied to data aggregation, overlay maintenance, and resource allocation. Gossiping applications more or less fit the same framework, with often subtle differences in algorithmic details determining divergent emergent behavior. This divergence is often difficult to understand, as formal models have yet to be developed that can capture the full design space of gossiping solutions. In this paper, we present a brief introduction to the field of gossiping in distributed systems, by providing a simple framework and using that framework to describe solutions for various application domains.

[1]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[2]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[3]  M. V. Steen,et al.  Newscast Computing , 2003 .

[4]  Márk Jelasity,et al.  T-Man: Gossip-Based Overlay Topology Management , 2005, Engineering Self-Organising Systems.

[5]  Henri E. Bal,et al.  ARRG: real-world gossiping , 2007, HPDC '07.

[6]  Idit Keidar,et al.  Araneola: a scalable reliable multicast system for dynamic environments , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

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

[8]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[9]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[10]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[11]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[12]  Anne-Marie Kermarrec,et al.  Ordered Slicing of Very Large-Scale Overlay Networks , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[13]  Kevin E. Bassler,et al.  Network dynamics: Jamming is limited in scale-free systems , 2004, Nature.

[14]  Keith Marzullo,et al.  Directional Gossip: Gossip in a Wide Area Network , 1999, EDCC.

[15]  Alan D. George,et al.  GEMS: Gossip-Enabled Monitoring Service for Scalable Heterogeneous Distributed Systems , 2006, Cluster Computing.

[16]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[17]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

[18]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[19]  Roy Friedman,et al.  RaWMS -: random walk based lightweight membership service for wireless ad hoc network , 2006, MobiHoc '06.

[20]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[21]  Jim Dowling,et al.  Discovery of Stable Peers in a Self-organising Peer-to-Peer Gradient Topology , 2006, DAIS.

[22]  Márk Jelasity,et al.  Gossip-based aggregation in large dynamic networks , 2005, TOCS.

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

[24]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[25]  Maarten van Steen,et al.  Epidemic-Style Management of Semantic Overlays for Content-Based Searching , 2005, Euro-Par.

[26]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[27]  Rajeev Rastogi,et al.  Efficient gossip-based aggregate computation , 2006, PODS.

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

[29]  G. P. Jesi,et al.  A Secure Peer Sampling Service , 2007 .

[30]  Indranil Gupta,et al.  JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).

[31]  M. van Steen,et al.  A Gossip-based Distributed News Service for Wireless Mesh Networks , 2006 .

[32]  Roy Friedman,et al.  RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks , 2008, TOCS.

[33]  Randy H. Katz,et al.  On failure detection algorithms in overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[34]  Nalini Venkatasubramanian,et al.  CREW: A Gossip-based Flash-Dissemination System , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).