Gossiping in distributed systems
Open Access
- 1 October 2007
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 41 (5) , 2-7
Abstract
Gossip-based algorithms were first introduced for reliably disseminating data in large-scale distributed systems. However, their simplicity, robustness, and flexibility make them attractive for more than just pure data dissemination alone. In particular, gossiping has been applied to data aggregation, overlay maintenance, and resource allocation. Gossiping applications more or less fit the same framework, with often subtle differences in algorithmic details determining divergent emergent behavior. This divergence is often difficult to understand, as formal models have yet to be developed that can capture the full design space of gossiping solutions. In this paper, we present a brief introduction to the field of gossiping in distributed systems, by providing a simple framework and using that framework to describe solutions for various application domains.Keywords
This publication has 25 references indexed in Scilit:
- ARRG2007
- CREW: A Gossip-based Flash-Dissemination System2006
- Randomized gossip algorithmsIEEE Transactions on Information Theory, 2006
- RaWMS -2006
- Epidemic information dissemination in distributed systemsComputer, 2004
- Lightweight probabilistic broadcastACM Transactions on Computer Systems, 2003
- Peer-to-peer membership management for gossip-based protocolsIEEE Transactions on Computers, 2003
- Random Graphs2001
- Bimodal multicastACM Transactions on Computer Systems, 1999
- Epidemic algorithms for replicated database maintenance1987