Protocols and impossibility results for gossip-based communication mechanisms

Annual Symposium on Foundations of Computer Science-Proceedings

Volumn , Issue , 2002, Pages 471-480

  Kempe, David ^a   Kleinberg, Jon ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; INFORMATION DISSEMINATION; PACKET SWITCHING; RANDOM PROCESSES; SECURITY OF DATA;

GOSSIP BASED ALGORITHMS; GOSSIP BASED COMMUNICATION; GOSSIP BASED PROTOCOLS; MINIMUM SPANNING TREE;

NETWORK PROTOCOLS;

EID: 0036953622     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2002.1181971     Document Type: Article

References (24)

1. D. Agrawal, A. E. Abbadi, and R. Steinke. Epidemic algorithms in replicated databases. In Proc. 16th ACM Symp. on Principles of Database Systems, 1997.
2. D. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, F. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996.
3. O. Boruvka. O jistém problému minimálním. Práca Moravské ??, 3, 1926.
4. A. Broder, A. Frieze, and E. Upfal. Existence and construction of edge low congestion paths on expander graphs. In Proc. 29th ACM Symp. on Theory of Computing, 1997.
5. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Stuygis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. 7th ACM Symp. on Operating Systems Principles, 1987.
6. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1, 1990.
7. F. Göbel, J. O. Cerdeira, and H. Veldman. Label-connected graphs and the gossip problem. Discrete Mathematics, 87:29-40, 1991.
8. I. Gupta, R. van Renesse, and K. Birman. Scalable fault-tolerant aggregation in large process groups. In Proc. Conf. on Dependable Systems and Networks, 2001.
9. B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Prob., 14, 1982.
10. M. Harchol-Balter, F. Leighton, and D. Lewin. Resource discovery in distributed networks. In Proc. 18th ACM Symp. on Principles of Distributed Computing, 1999.
11. S. Hedetniemi, S. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319-349, 1988.
12. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.
13. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. In Proc. 33rd ACM Symp. on Theory of Computing, 2001.
14. D. Kempe, J. Kleinberg, and A. Kumar. Connectivity and inference problems for temporal networks. In Proc. 32nd ACM Symp. on Theory of Computing, 2000.
15. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. 32nd ACM Symp. on Theory of Computing, 2000.
16. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
17. M. Lin, K. Marzullo, and S. Masini. Gossip versus deterministic ??: Low message overhead and high reliability for broadcasting on small networks. Technical Report CS99-0637, University of California at San Diego, 1999.
18. L. Lovász. Communication complexity: A survey. In B. Korte, L. Lovász, H. Prömel, and A. Schrijver, editors, Paths, Flows, and VLSI-Layout. Springer, 1990.
19. B. Maggs and B. Vöcking. Improved routing and sorting on ??. In Proc. 29th ACM Symp. on Theory of Computing, 1997.
20. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1990.
21. B. Pittel. On spreading a rumor. SIAM J. Applied Math., 47, 1987.
22. E. Upfal. An O(log N) deterministic packet routing scheme. J. of the ACM, 39, 1992.
23. R. van Renesse. Scalable and secure resource location. In 33rd Hawaii Intl. Conf. on System Sciences, 2000.
24. R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure-detection service. In Proc. IFIP Intl. Conference on Distributed Systems Platforms and Open Distributed Processing, 1998.