How robust are gossip-based communication protocols?

Gossip-based communication protocols are often touted as being robust. Not surprisingly, such a claim relies on assumptions under which gossip protocols are supposed to operate. In this paper, we discuss and in some cases expose some of these assumptions and discuss how sensitive the robustness of gossip is to these assumptions. This analysis gives rise to a collection of new research challenges.

[1]  John E. Hopcroft,et al.  Correctness of a gossip based membership protocol , 2005, PODC '05.

[2]  Alexander Grey,et al.  The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .

[3]  Boris Koldehofe,et al.  Buffer management in probabilistic peer-to-peer communication protocols , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[4]  Anne-Marie Kermarrec,et al.  Adaptive gossip-based broadcast , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[5]  Dahlia Malkhi,et al.  Optimal Unconditional Information Diffusion , 2001, DISC.

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

[7]  N. Ling.  The Mathematical Theory of Infectious Diseases and its applications , 1978 .

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

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

[10]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[13]  Fred B. Schneider,et al.  Tolerating malicious gossip , 2003, Distributed Computing.

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

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

[16]  B. Pittel.  On spreading a rumor , 1987 .

[17]  Rachid Guerraoui,et al.  -Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability , 2004, ICDCS 2004.

[18]  Yishay Mansour,et al.  On diffusing updates in a Byzantine environment , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.

[19]  Robbert van Renesse,et al.  Fireflies: scalable support for intrusion-tolerant network overlays , 2006, EuroSys.

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

[21]  Robbert van Renesse,et al.  Defense against Intrusion in a Live Streaming Multicast System , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

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

[23]  Idit Keidar,et al.  Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast , 2004, IEEE Transactions on Dependable and Secure Computing.

[24]  Anne-Marie Kermarrec,et al.  Reducing noise in gossip-based reliable broadcast , 2001, Proceedings 20th IEEE Symposium on Reliable Distributed Systems.

[25]  Michael Dahlin,et al.  BAR gossip , 2006, OSDI '06.

[26]  Marina Papatriantafilou,et al.  Dynamic and fault-tolerant cluster management , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[27]  Boris Koldehofe,et al.  Simple gossiping with balls and bins , 2004, Stud. Inform. Univ..

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