skip to main content
article

The promise, and limitations, of gossip protocols

Published: 01 October 2007 Publication History

Abstract

Recent years have seen a surge of interest in gossip protocols, with proposals to apply them for purposes ranging from autonomic self-management, repair of inconsistencies, reliable multicast and distributed search. Yet the field of distributed computing is littered with technologies that had initial promise, but were ultimately rejected by the industry. Researchers who measure their work through its impact need to ask some tough, basic questions. What are the uses to which gossip is particularly well-matched, and what are its limitations? What alternatives are there to gossip-based solutions, and when would we be better-off using a non-gossip protocol? When, in effect, is gossip the technology of choice?

References

[1]
Correctness of a Gossip-based Membership Protocol. André Allavena, Alan Demers and John Hopcroft. Proc. 24th ACM Symposium on the Principle of Distributed Computing (PODC 2005).
[2]
Bimodal Multicast. Kenneth P. Birman, Mark Hayden, Oznur Ozkasap, Zhen Xiao, Mihai Budiu and Yaron Minsky. ACM Transactions on Computer Systems, Vol. 17, No. 2, pp 41--88, May, 1999.
[3]
Epidemic algorithms for replicated database management. Alan Demers, et. al. Proc. 6th ACM PODC, Vancouver BC, 1987.
[4]
Lightweight probabilistic broadcast. Patrick Eugster, Rashid Guerraoui, S. B. Handurukande, Petr Kouznetsov, Anne-Marie Kermarrec. ACM Transactions on Computer Systems (TOCS) 21:4, Nov 2003.
[5]
Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead. Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse. Proc. 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03)
[6]
Systematic Design of P2P Technologies for Distributed Systems. Indranil Gupta, Global Data Management, eds: R. Baldoni, G. Cortese, F. Davide and A. Melpignano, 2006.
[7]
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast. Indranil Gupta, Ayalvadi J. Ganesh, Anne-Marie Kermarrec. IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 593--605, July, 2006.
[8]
T-Man: Gossip-based overlay topology management. Márk Jelasity and Ozalp Babaoglu. Engineering Self-Organising Systems: Third International Workshop (ESOA 2005), Springer-Verlag LNCS 3910 (2006).
[9]
Gossip-based aggregation in large dynamic networks. Márk Jelasity, Alberto Montresor, and Ozalp Babaoglu. ACM Transactions on Computer Systems, 23(3):219--252, August 2005.
[10]
Ordered slicing of very large overlay networks. Márk Jelasity and Anne-Marie Kermarrec. IEEE P2P, 2006.
[11]
Proximity-aware superpeer overlay topologies. Gian Paolo Jesi, Alberto Montresor, and Ozalp Babaoglu. Proc SelfMan 06. Spinger-Verlag LNCS 399, Dublin, Ireland, June 2006.
[12]
Spatial gossip and resource location protocols. David Kempe, Jon Kleinberg, Alan Demers. Journal of the ACM (JACM) 51: 6 (Nov 2004).
[13]
Gossip-Based Computation of Aggregate Information. David Kempe, Alin Dobra, Johannes Gehrke. Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS). 2003.
[14]
Active and Passive Techniques for Group Size Estimation in Large-Scale and Dynamic Distributed Systems. Dionysios Kostoulas, Dimitrios Psaltoulis, Indranil Gupta, Ken Birman, Al Demers. Elsevier Journal of Systems and Software, 2007.
[15]
Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks. Balasubramaneyam Maniymaran, Marin Bertier and Anne-Marie Kermarrec. Proc. ICDCS, June 2007.
[16]
Peer counting and sampling in overlay networks: random walk methods. Laurent Massoulié, Erwan Le Merrer, nne-Marie Kermarrec, Ayalvadi Ganesh. Proc. 25th ACM PODC. Denver, 2006.
[17]
Chord on Demand. Alberto Montresor, Márk Jelasity, and Ozalp Babaoglu. Proc. 5th Conference on Peer-to-Peer Computing (P2P), Konstanz, Germany, August 2005.
[18]
Introduction to Expander Graphs. Michael Nielsen. http://www.qinfo.org/people/nielsen/blog/archive/notes/expa nder_graphs.pdf. Technical report, June 2005.
[19]
Building low-diameter P2P networks. G. Pandurangan, P. Raghavan, Eli Upfal. In Proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS), 2001.
[20]
Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining. Robbert van Renesse, Kenneth Birman and Werner Vogels. ACM Transactions on Computer Systems (TOCS) 21:2, May 2003.
[21]
Exploiting Semantic Proximity in Peer-to-peer Content Searching. S. Voulgaris, A.-M. Kermarrec, L. Massoulie, M. van Steen. Proc. 10th Int'l Workshop on Future Trends in Distributed Computing Systems (FTDCS 2004), Suzhou, China, May 2004.

Cited By

View all
  • (2025)IronForge: An Open, Secure, Fair, Decentralized Federated LearningIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2023.332924936:1(354-368)Online publication date: Jan-2025
  • (2025)Moment Analysis of Age-Dependent Gossip NetworksIEEE Transactions on Information Theory10.1109/TIT.2024.348886071:1(1-22)Online publication date: 1-Jan-2025
  • (2024)Data-Tracking in Blockchain Utilizing Hash Chain: A Study of Structured and Adaptive ProcessSymmetry10.3390/sym1601006216:1(62)Online publication date: 3-Jan-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGOPS Operating Systems Review
ACM SIGOPS Operating Systems Review  Volume 41, Issue 5
Gossip-based computer networking
October 2007
87 pages
ISSN:0163-5980
DOI:10.1145/1317379
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 2007
Published in SIGOPS Volume 41, Issue 5

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)110
  • Downloads (Last 6 weeks)8
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2025)IronForge: An Open, Secure, Fair, Decentralized Federated LearningIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2023.332924936:1(354-368)Online publication date: Jan-2025
  • (2025)Moment Analysis of Age-Dependent Gossip NetworksIEEE Transactions on Information Theory10.1109/TIT.2024.348886071:1(1-22)Online publication date: 1-Jan-2025
  • (2024)Data-Tracking in Blockchain Utilizing Hash Chain: A Study of Structured and Adaptive ProcessSymmetry10.3390/sym1601006216:1(62)Online publication date: 3-Jan-2024
  • (2024)LavaStore: ByteDance's Purpose-Built, High-Performance, Cost-Effective Local Storage Engine for Cloud ServicesProceedings of the VLDB Endowment10.14778/3685800.368580717:12(3799-3812)Online publication date: 8-Nov-2024
  • (2024)eGossip: Optimizing Resource Utilization in Gossip-Based Clusters through eBPFProceedings of the Seventh International Workshop on Systems and Network Telemetry and Analytics10.1145/3660320.3660336(32-38)Online publication date: 3-Jun-2024
  • (2024)A Survey on Content Retrieval on the Decentralised WebACM Computing Surveys10.1145/364913256:8(1-39)Online publication date: 26-Apr-2024
  • (2024)Timely Gossip with Age-Dependent Networks2024 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT57864.2024.10619588(1167-1172)Online publication date: 7-Jul-2024
  • (2024)Enabling Large-scale Heterogeneous Collaboration with Opportunistic Communications2024 IEEE International Conference on Robotics and Automation (ICRA)10.1109/ICRA57147.2024.10611469(2610-2616)Online publication date: 13-May-2024
  • (2024)GeoBlocks: Trustless Geospatial Data Sharing with Accountability and Decentralized Access Control2024 6th Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS)10.1109/BRAINS63024.2024.10732576(1-9)Online publication date: 9-Oct-2024
  • (2024)Trustworthy V2G scheduling and energy trading: A blockchain-based frameworkeTransportation10.1016/j.etran.2024.10037622(100376)Online publication date: Dec-2024
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media