Correctness of Gossip-Based Membership under Message Loss
@inproceedings{Jacobs2009CorrectnessOG, title={Correctness of Gossip-Based Membership under Message Loss}, author={James Jacobs}, year={2009} }
- Published 2009
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
From This Paper
Figures, tables, and topics from this paper.
Citations
Publications citing this paper.
Showing 1-10 of 28 extracted citations
Expander Graph Quality Optimisation in Randomised Communication
View 5 Excerpts
Highly Influenced
Distributed Computing
View 10 Excerpts
Highly Influenced
Converging Quickly to Independent Uniform Random Topologies
View 9 Excerpts
Highly Influenced
Correctness of gossip-based membership under message loss
View 5 Excerpts
Highly Influenced
Vers une architecture pair-à-pair pour l'informatique dans le nuage. (Toward a peer-to-peer architecture for cloud computing)
View 4 Excerpts
Method Support
Highly Influenced
Breaking the $$\log n$$ log n barrier on rumor spreading
View 1 Excerpt
Node sampling using Random Centrifugal Walks
View 1 Excerpt
DEX: self-healing expanders
View 1 Excerpt
Citation Statistics
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.
References
Publications referenced by this paper.
Showing 1-10 of 23 references
Distributed random digraph transformations for peer-to-peer networks
View 8 Excerpts
Highly Influenced
Peer-to-peer networks based on random transformations of connected regular undirected graphs
View 6 Excerpts
Highly Influenced
Lightweight Probabilistic Broadcast
View 9 Excerpts
Highly Influenced
Brahms: Byzantine resilient random membership sampling
View 3 Excerpts
Highly Influenced
Correctness of a gossip based membership protocol
View 10 Excerpts
Highly Influenced
Correctness of gossip-based membership under message loss
View 1 Excerpt
Gossip-based peer sampling
View 3 Excerpts