Correctness of Gossip-Based Membership under Message Loss

  title={Correctness of Gossip-Based Membership under Message Loss},
  author={James Jacobs},
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of gossip-based membership protocols were proposed. Some were shown to be effective empirically, lacking analytic understanding of their properties. Others were analyzed under simplifying assumptions, such as lossless and delay-less network. It is not clear whether the analysis results hold in dynamic networks where both… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 28 extracted citations

Expander Graph Quality Optimisation in Randomised Communication

2014 IEEE International Conference on Data Mining Workshop • 2014
View 5 Excerpts
Highly Influenced

Distributed Computing

Lecture Notes in Computer Science • 2013
View 10 Excerpts
Highly Influenced

Converging Quickly to Independent Uniform Random Topologies

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing • 2011
View 9 Excerpts
Highly Influenced

DEX: self-healing expanders

Distributed Computing • 2014
View 1 Excerpt

63 Citations

Citations per Year
Semantic Scholar estimates that this publication has 63 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 23 references

Correctness of gossip-based membership under message loss

M. Gurevich, I. Keidar
Technical Report CCIT Report #732, • 2009
View 1 Excerpt