Protocols and impossibility results for gossip-based communication mechanisms
- 26 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Universal stability results for greedy contention-resolution protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Randomized rumor spreadingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Spatial gossip and resource location protocolsPublished by Association for Computing Machinery (ACM) ,2001
- Connectivity and inference problems for temporal networksPublished by Association for Computing Machinery (ACM) ,2000
- The small-world phenomenonPublished by Association for Computing Machinery (ACM) ,2000
- Resource discovery in distributed networksPublished by Association for Computing Machinery (ACM) ,1999
- An O (log N ) deterministic packet-routing schemeJournal of the ACM, 1992
- Label-connected graphs and the gossip problemDiscrete Mathematics, 1991
- A survey of gossiping and broadcasting in communication networksNetworks, 1988
- On Spreading a RumorSIAM Journal on Applied Mathematics, 1987