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)
Journal of Network and Systems Management
Journal of Network and Systems Management
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
RaWMS -: random walk based lightweight membership service for wireless ad hoc network
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
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
ACM Transactions on Computer Systems (TOCS)
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
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
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Research note: On the uniformity of peer sampling based on view shuffling
Journal of Parallel and Distributed Computing
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Dynamic computations in ever-changing networks
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Correctness of Gossip-Based Membership under Message Loss
SIAM Journal on Computing
Markovian agent modeling swarm intelligence algorithms in wireless sensor networks
Performance Evaluation
A gossip-based mutual exclusion algorithm for cloud environments
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
An unstructured termination detection algorithm using gossip in cloud computing environments
ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems
Scalable and leaderless Byzantine consensus in cloud computing environments
Information Systems Frontiers
Hi-index | 0.00 |
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 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.