skip to main content
article

Spatial gossip and resource location protocols

Published: 01 November 2004 Publication History

Abstract

The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. Gossip protocols are mechanisms for this task in which nodes communicate with one another according to some underlying deterministic or randomized algorithm, exchanging information in each communication step. In a variety of contexts, the use of randomization to propagate information has been found to provide better reliability and scalability than more regimented deterministic approaches.In many settings, such as a cluster of distributed computing hosts, new information is generated at individual nodes, and is most "interesting" to nodes that are nearby. Thus, we propose distance-based propagation bounds as a performance measure for gossip mechanisms: a node at distance d from the origin of a new piece of information should be able to learn about this information with a delay that grows slowly with d, and is independent of the size of the network.For nodes arranged with uniform density in Euclidean space, we present natural gossip mechanisms, called spatial gossip, that satisfy such a guarantee: new information is spread to nodes at distance d, with high probability, in O(log1 + ε d) time steps. Such a bound combines the desirable qualitative features of uniform gossip, in which information is spread with a delay that is logarithmic in the full network size, and deterministic flooding, in which information is spread with a delay that is linear in the distance and independent of the network size. Our mechanisms and their analysis resolve a conjecture of Demers et al. [1987].We further show an application of our gossip mechanisms to a basic resource location problem, in which nodes seek to rapidly learn the location of the nearest copy of a resource in a network. This problem, which is of considerable practical importance, can be solved by a very simple protocol using Spatial Gossip, whereas we can show that no protocol built on top of uniform gossip can inform nodes of their approximately nearest resource within poly-logarithmic time. The analysis relies on an additional useful property of spatial gossip, namely that information travels from its source to sinks along short paths not visiting points of the network far from the two nodes.

References

[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]
Göbel, 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 Vöcking, 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.

Cited By

View all
  • (2024)Randomized protocols for resilient peer-to-peer networksProcedia Computer Science10.1016/j.procs.2024.08.004241(8-15)Online publication date: 2024
  • (2022)Exchange on dynamic encounter networks allows plant mitochondria to collect complete sets of mitochondrial DNA products despite their incomplete genomesQuantitative Plant Biology10.1017/qpb.2022.153Online publication date: 9-Sep-2022
  • (2021)Why are song lyrics becoming simpler? a time series analysis of lyrical complexity in six decades of American popular musicPLOS ONE10.1371/journal.pone.024457616:1(e0244576)Online publication date: 13-Jan-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 51, Issue 6
November 2004
191 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/1039488
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2004
Published in JACM Volume 51, Issue 6

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Gossip
  2. decentralized algorithm
  3. resource location

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)23
  • Downloads (Last 6 weeks)3
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Randomized protocols for resilient peer-to-peer networksProcedia Computer Science10.1016/j.procs.2024.08.004241(8-15)Online publication date: 2024
  • (2022)Exchange on dynamic encounter networks allows plant mitochondria to collect complete sets of mitochondrial DNA products despite their incomplete genomesQuantitative Plant Biology10.1017/qpb.2022.153Online publication date: 9-Sep-2022
  • (2021)Why are song lyrics becoming simpler? a time series analysis of lyrical complexity in six decades of American popular musicPLOS ONE10.1371/journal.pone.024457616:1(e0244576)Online publication date: 13-Jan-2021
  • (2021)Gossip consensusProceedings of the 22nd International Middleware Conference10.1145/3464298.3493395(198-209)Online publication date: 6-Dec-2021
  • (2019)Clique GossipingIEEE/ACM Transactions on Networking10.1109/TNET.2019.295208227:6(2418-2431)Online publication date: Dec-2019
  • (2019)Confidential gossipDistributed Computing10.1007/s00446-019-00367-xOnline publication date: 3-Dec-2019
  • (2018)Random Walks with Multiple Step LengthsLATIN 2018: Theoretical Informatics10.1007/978-3-319-77404-6_14(174-186)Online publication date: 13-Mar-2018
  • (2017)Accessibility and delay in random temporal networksPhysical Review E10.1103/PhysRevE.96.03230996:3Online publication date: 12-Sep-2017
  • (2017)Highly intensive data dissemination in complex networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2016.08.00499(28-50)Online publication date: Jan-2017
  • (2017)Pandemics, Detection and ManagementEncyclopedia of GIS10.1007/978-3-319-17885-1_949(1547-1553)Online publication date: 12-May-2017
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media