Epidemic information dissemination in distributed systems
Top Cited Papers
- 2 August 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 37 (5), 60-67
- https://doi.org/10.1109/mc.2004.1297243
Abstract
Easy to deploy, robust, and highly resilient to failures, epidemic algorithms are a potentially effective mechanism for propagating information in large peer-to-peer systems deployed on Internet or ad hoc networks. It is possible to adjust the parameters of epidemic algorithm to achieve high reliability despite process crashes and disconnections, packet losses, and a dynamic network topology. Although researchers have used epidemic algorithms in applications such as failure detection, data aggregation, resource discovery and monitoring, and database replication, their general applicability to practical, Internet-wide systems remains open to question. We describe four key problems: membership maintenance, network awareness, buffer management, and message filtering, and suggest some preliminary approaches to address them.Keywords
This publication has 16 references indexed in Scilit:
- Lightweight probabilistic broadcastACM Transactions on Computer Systems, 2003
- AstrolabeACM Transactions on Computer Systems, 2003
- Probabilistic reliable dissemination in large-scale systemsIEEE Transactions on Parallel and Distributed Systems, 2003
- Random GraphsPublished by Cambridge University Press (CUP) ,2001
- Bimodal multicastACM Transactions on Computer Systems, 1999
- Collective dynamics of ‘small-world’ networksNature, 1998
- A Gossip-Style Failure Detection ServicePublished by Springer Science and Business Media LLC ,1998
- On Spreading a RumorSIAM Journal on Applied Mathematics, 1987
- Epidemic algorithms for replicated database maintenancePublished by Association for Computing Machinery (ACM) ,1987
- Branching ProcessesPublished by Springer Science and Business Media LLC ,1972