Spatial gossip and resource location protocols

Journal of the ACM

Volumn 51, Issue 6, 2004, Pages 943-967

  Kempe, David ^a,c   Kleinberg, Jon ^b,d   Demers, Alan ^b,d  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c University of Southern California ^*  (United States)

^d Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Decentralized algorithm; Gossip; Resource location

Indexed keywords

DECENTRALIZED ALGORITHMS; GOSSIP; PROBLEM COMPLEXITY; RESOURCE LOCATION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS; PROBLEM SOLVING; SENSORS;

NETWORK PROTOCOLS;

EID: 20444492752     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1039488.1039491     Document Type: Article

References (16)

1. AGRAWAL, D., ABBADI, A. E., AND STEINKE, R. 1997. Epidemic algorithms in replicated databases. In Proceedings of the 16th ACM Symposium on Principles of Database Systems. ACM, New York, pp. 161-172.
2. BIRMAN, K., HAYDEN, M., OZKASAP, O., XIAO, Z., BUDIU, M., AND MINSKY, Y. 1999. Bimodal multicast. ACM Trans. Comput. Syst. 17, 41-88.
3. DEMERS, A., GREENE, D., HAUSER, C., IRISH, W., LARSON, J., SHENKER, S., STURGIS, H., SWINEHART, D., AND TERRY, D. 1987. Epidemic algorithms for replicated database maintenance. In Proceedings of the 7th ACM Symposium on Operating Systems Principles. ACM, New York, 1-12.
4. ESTRIN, D., GOVINDAN, R., HEIDEMANN, J., AND KUMAR, S. 1999. Next century challenges: Scalable coordination in sensor networks. In Proceedings of the 5th International Conference on Mobile Computing and Networking. 263-270.
5. GOBEL, F., ORESTES CERDEIRA, J., AND VELDMAN, H. 1991. Label-connected graphs and the gossip problem. Disc. Math. 87, 29-40.
6. GUPTA, I., VAN RENESSE, R., AND BIRMAN, K. 2001. Scalable fault-tolerant aggregation in large process groups. In Proceedings of the Conference on Dependable Systems and Networks. 433-442.
7. HEDETNIEMI, S., HEDETNIEMI, S., AND LIESTMAN, A. 1988. A survey of gossiping and broadcasting in communication networks. Networks 18, 319-349.
8. HEINZELMAN, W., KULIK, J., AND BALAKRISHNAN, H. 1999. Adaptive protocols for information dissemination in wireless sensor networks. In Proceedings of the 5th International Conference on Mobile Computing and Networking.
9. KAHN, J., KATZ, R., AND PISTER, K. 1999. Next century challenges: Mobile networking for 'smart dust'. In Proceedings of the 5th International Conference on Mobile Computing and Networking. 271-278.
10. KARP, R., SCHINDELHAUER, C., SHENKER, S., AND VOCKING, B. 2000. Randomized rumor spreading. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, Calif., 565-574.
11. KEMPE, D., AND KLEINBERG, J. 2002. Protocols and impossibility results for gossip-based communication mechanisms. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science. IEEE Computer Science Press, Los Alamitos, Calif., 471-480.
12. KEMPE, D., KLEINBERG, J., AND KUMAR, A. 2002. Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64, 820-842.
13. LIN, M., MARZULLO, K., AND MASINI, S. 1999. Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small networks. Tech. Rep. CS99-0637, UC San Diego.
14. PITTEL, B. 1987. On spreading a rumor. SIAM J. Applied Math. 47, 213-223.
15. VAN RENESSE, R. 2000. Scalable and secure resource location. In Proceedings of the 33rd Hawaii International Conference on System Sciences.
16. VAN RENESSE, R., MINSKY, Y., AND HAYDEN, M. 1998. A gossip-style failure-detection service. In Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing. 55-70.