Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Using Gossip for Dynamic Resource Discovery
ICPP '06 Proceedings of the 2006 International Conference on Parallel Processing
Ordered Slicing of Very Large-Scale Overlay Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
ACM Transactions on Computer Systems (TOCS)
Journal of Systems and Software
GCP: gossip-based code propagation for large-scale mobile wireless sensor networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
On the complexity of asynchronous gossip
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
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
Characterizing the adversarial power in uniform and ergodic node sampling
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Hi-index | 0.00 |
Gossip protocols are simple, robust and scalable and have been consistently applied to many (mostly wired) distributed systems. Nevertheless, most validation in this area has been empirical so far and there is a lack of a theoretical counterpart to characterize what can and cannot be computed with gossip protocols. Population protocols, on the other hand, benefit from a sound theoretical framework but little empirical evaluation. In this paper, we establish a correlation between population and gossip-based protocols. We propose a classification of gossip-based protocols, based on the nature of the underlying peer sampling service. First, we show that the class of gossip protocols, where each node relies on an arbitrary sample, is equivalent to population protocols. Second, we show that gossip-based protocols, relying on a more powerful peer sampling service providing peers using a clearly identified set of other peers, are equivalent to community protocols, a modern variant of population protocols. Leveraging the resemblances between population and gossip protocols enables to provide a theoretical framework for distributed systems where global behaviors emerge from a set of local interactions, both in wired and wireless settings. The practical validations of gossip-protocols provide empirical evidence of quick convergence times of such algorithms and demonstrate their practical relevance. While existing results in each area can be immediately applied, this also leaves the space to transfer any new results, practical or theoretical, from one domain to the other.