# Correctness of a gossip based membership protocol

@inproceedings{Allavena2005CorrectnessOA,
title={Correctness of a gossip based membership protocol},
author={Andrea Allavena and Alan J. Demers and John E. Hopcroft},
booktitle={PODC '05},
year={2005}
}
• Published in PODC '05 17 July 2005
• Computer Science
The importance of scalability and fault-tolerance in modern distributed systems has led to considerable research in multicast protocols using gossip. In a gossip protocol, each node forwards messages to a small set of “gossip partners” chosen at random from the entire group membership. By discarding the strong reliability guarantees of traditional protocols in favour of probabilistic guarantees, gossip protocols can deliver greater scalability and fault tolerance. In early gossip algorithms…
136 Citations

## Figures from this paper

On Modeling Fault Tolerance of Gossip-Based Reliable Multicast Protocols
• Computer Science
2008 37th International Conference on Parallel Processing
• 2008
A general gossiping algorithm is proposed and a mathematical model based on generalized random graphs for evaluating the reliability of gossiping is developed, i.e., to what extent gossip-based protocols can tolerate node failures, yet guarantee the specified message delivery.
Correctness of gossip-based membership under message loss
• Computer Science
PODC '09
• 2009
A simple Send & Forget protocol is proposed, and it is shown that even in the presence of message loss, it achieves the desirable properties of a gossip-based membership protocol.
Correctness of Gossip-Based Membership under Message Loss
This paper first enumerate the desirable properties of a gossip-based membership protocol, such as view uniformity, independence, and load balance, and proposes a simple Send & Forget protocol, which is shown to achieve these properties even in the presence of message loss.
A probabilistic characterization of a fault-tolerant gossiping algorithm
• Computer Science
J. Syst. Sci. Complex.
• 2009
The authors present a characterization of a popular class of fault-tolerant gossip schemes (known as “push-based gossiping”) based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.
Gossip-based peer sampling
• Computer Science
TOCS
• 2007
This paper presents a generic framework to implement a peer-sampling service in a decentralized manner by constructing and maintaining dynamic unstructured overlays through gossiping membership information itself, which generalizes existing approaches and makes it easy to discover new ones.
DIMPLE: DynamIc Membership ProtocoL for epidemic protocols
• Computer Science
2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)
• 2007
An additional action of reinforcement and a new join procedure are proposed and evaluated and shown to enhance the shuffling mechanism such that the system processes network churn much faster and the quality of the node degrees is significantly enhanced.
Byzantine-resilient dual gossip membership management in clouds
• Computer Science
Soft Comput.
• 2018
An effective and efficient Byzantine-resilient dual membership management technique in cloud environments, in which nodes are prone to churn and the network topology is not fully connected, using a gossip protocol based on unstructured message communication model.
A Stochastic Characterization of a Fault-Tolerant Gossip Algorithm
• Computer Science
10th IEEE High Assurance Systems Engineering Symposium (HASE'07)
• 2007
This work intends to understand the behavior of a simple abstraction and algorithm for a popular class of fault-tolerant gossip schemes.
A Stochastic Characterization of a Fault-Tolerant Gossip Algorithm
• Computer Science
• 2007
This work intends to understand the behavior of a simple abstraction and algorithm for a popular class of fault-tolerant gossip schemes.
Churn Resilience of Peer-to-Peer Group Membership: A Performance Analysis
• Computer Science
IWDC
• 2005
A performance evaluation of SCAMP, one of the most interesting GGM protocol, points out that the probability of partitioning of the overlay topology created by SCAMP increases with the churn rate, and compares SCAMP with DET – another membership protocol that deterministically avoids partitions ofThe overlay.

## References

SHOWING 1-10 OF 15 REFERENCES
Peer-to-Peer Membership Management for Gossip-Based Protocols
• Computer Science
IEEE Trans. Computers
• 2003
This paper presents SCAMP (Scalable Membership protocol), a novel peer-to-peer membership protocol which operates in a fully decentralized manner and provides each member with a partial view of the group membership and proposes additional mechanisms to achieve balanced view sizes even with highly unbalanced subscription patterns.
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
• Computer Science
Middleware
• 2004
This paper presents a generic framework to implement reliable and efficient peer sampling services, which generalizes existing approaches and makes it easy to introduce new ones, and shows that all of them lead to differentpeer sampling services none of which is uniformly random.
Protocols and impossibility results for gossip-based communication mechanisms
• Mathematics
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
• 2002
Gossip-based packet routing is investigated as a primitive that underpins the communication patterns in many protocols, and as a way to understand the capabilities of different gossip mechanisms at a general level.
Directional Gossip: Gossip in a Wide Area Network
• Computer Science
EDCC
• 1999
A new gossip protocol is presented, called {\em directional gossip}, that uses flooding when necessary to attain good reliability and that uses gossip when flooding (and hence its inherent high overhead) is not needed.
CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays
• Computer Science
Journal of Network and Systems Management
• 2005
The protocol is shown to construct graphs that have low diameter, low clustering, highly symmetric node degrees, and that are highly resilient to massive node failures, and it is shown that the protocol is highly reactive to restoring randomness when a large number of nodes fail.
Spatial gossip and resource location protocols
• Computer Science
STOC '01
• 2001
This work proposes distance-based propagation bounds as a performance measure for gossip algorithms, and presents natural gossip algorithms that satisfy such a guarantee: new information is spread to nodes at distance DIST, with high probability, in O(\log^{1 + \ve} \DIST) time steps.
• Computer Science
TOCS
• 2003
This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm, which complements the inherent throughput scalability of traditional probabilism broadcast algorithms with a scalable memory management technique.