On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Evaluating the running time of a communication round over the internet
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Peer-to-peer networks based on random transformations of connected regular undirected graphs
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On the correctness of gossip-based membership protocols
On the correctness of gossip-based membership protocols
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed random digraph transformations for peer-to-peer networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Brief paper: Stability robustness of networked control systems with respect to packet loss
Automatica (Journal of IFAC)
Sampling Regular Graphs and a Peer-to-Peer Network
Combinatorics, Probability and Computing
ACM Transactions on Computer Systems (TOCS)
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
ACM Transactions on Computer Systems (TOCS)
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
The flip markov chain and a randomising P2P protocol
Proceedings of the 28th ACM symposium on Principles of distributed computing
Correctness of gossip-based membership under message loss
Proceedings of the 28th ACM symposium on Principles of distributed computing
Adaptive Peer Sampling with Newscast
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Full length article: On coding for reliable communication over packet networks
Physical Communication
Dynamic networks: models and algorithms
ACM SIGACT News
Sybil defenses via social networks: a tutorial and survey
ACM SIGACT News
Brief announcement: a stable and robust membership protocol
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.01 |
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large peer-to-peer 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 delayless network. It is not clear whether the analysis results hold in dynamic networks, where both nodes and network links can fail. In this paper we try to bridge this gap. We first enumerate the desirable properties of a gossip-based membership protocol, such as view uniformity, independence, and load balance. We then propose a simple send & forget protocol, and show that even in the presence of message loss, it achieves the desirable properties.