How robust are gossip-based communication protocols?

Authors:
Lorenzo Alvisi;Jeroen Doumen;Rachid Guerraoui;Boris Koldehofe;Harry Li;Robbert van Renesse;Gilles Tredan
Affiliations:
The University of Texas at Austin;University of Twente;Swiss Federal Institute of Technology in Lausanne (EPFL);University of Stuttgart;The University of Texas at Austin;Cornell University;IRISA/INRIA-Rennes
Venue:
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Year:
2007

Citing 21
Cited 4

On spreading a rumor

SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Optimal Unconditional Information Diffusion

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
Probabilistic Reliable Dissemination in Large-Scale Systems

IEEE Transactions on Parallel and Distributed Systems
Randomized rumor spreading

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On Diffusing Updates in a Byzantine Environment

SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Lightweight probabilistic broadcast

ACM Transactions on Computer Systems (TOCS)
"-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
The peer sampling service: experimental evaluation of unstructured gossip-based implementations

Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Tolerating malicious gossip

Distributed Computing
Correctness of a gossip based membership protocol

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Dynamic and Fault-tolerant Cluster Management

P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Exposing and Eliminating Vulnerabilities to Denial of Service Attacks in Secure Gossip-Based Multicast

IEEE Transactions on Dependable and Secure Computing
Defense against Intrusion in a Live Streaming Multicast System

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Fireflies: scalable support for intrusion-tolerant network overlays

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
BAR Gossip

OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Epidemic Information Dissemination in Distributed Systems

Computer
A gossip-style failure detection service

Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing

Epidemic protocols for pervasive computing systems: moving focus from architecture to protocol

M-PAC '09 Proceedings of the International Workshop on Middleware for Pervasive Mobile and Embedded Computing
Optimizing information flow in the gossip objects platform

ACM SIGOPS Operating Systems Review
Exploring link correlation for efficient flooding in wireless sensor networks

NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Achieving efficient flooding by utilizing link correlation in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.