skip to main content
article

Gossiping in distributed systems

Published: 01 October 2007 Publication History

Abstract

Gossip-based algorithms were first introduced for reliably disseminating data in large-scale distributed systems. However, their simplicity, robustness, and flexibility make them attractive for more than just pure data dissemination alone. In particular, gossiping has been applied to data aggregation, overlay maintenance, and resource allocation. Gossiping applications more or less fit the same framework, with often subtle differences in algorithmic details determining divergent emergent behavior. This divergence is often difficult to understand, as formal models have yet to be developed that can capture the full design space of gossiping solutions. In this paper, we present a brief introduction to the field of gossiping in distributed systems, by providing a simple framework and using that framework to describe solutions for various application domains.

References

[1]
Z. Bar-Yossef, R. Friedman, and G. Kliot. "RaWMS - Random Walk based Lightweight Membership Service for Wireless Ad Hoc Networks." In Proc. Seventh Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 238 -- 249, May 2006. ACM Press, New York, NY.
[2]
K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. "Bimodal Multicast." ACM Trans. Comp. Syst., 17(2):41--88, May 1999.
[3]
B. Bollobas. Random Graphs. Cambridge University Press, Cambridge, UK, 2nd edition, 2001.
[4]
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. "Randomized Gossip Algorithms." IEEE Transactions on Information Theory, 52(6):2508--2530, June 2006.
[5]
A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. "Epidemic Algorithms for Replicated Database Maintenance." In Proc. Sixth Symp. on Principles of Distributed Computing, pp. 1--12, Aug. 1987. ACM.
[6]
M. Deshpande, B. Xing, I. Lazaridis, B. Hore, N. Venkatasubramanian, and S. Mehrotra. "CREW: A Gossip-based Flash-Dissemination System." In Proc. 26th Int'l Conf. on Distributed Computing Systems, July 2006. IEEE Computer Society Press, Los Alamitos, CA.
[7]
N. Drost, E. Ogston, R. V. van Nieuwpoort, and H. E. Bal. "ARRG: Real-World Gossiping." In Proc. 16th Int'l Symp. on High Performance Distributed Computing, July 2007. IEEE Computer Society Press, Los Alamitos, CA.
[8]
P. Eugster, R. Guerraoui, S. Handurukande, A.-M. Kermarrec, and P. Kouznetsov. "Lightweight Probabilistic Broadcast." ACM Trans. Comp. Syst., 21(4):341--374, Dec. 2003.
[9]
P. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié. "Epidemic Information Dissemination in Distributed Systems." IEEE Computer, 37(5):60--67, May 2004.
[10]
A. Ganesh, A.-M. Kermarrec, and L. Massoulié. "Peer-to-Peer Membership Management for Gossip-based Protocols." IEEE Trans. Comp., 52(2):139--149, Feb. 2003.
[11]
D. Gavidia, S. Voulgaris, and M. van Steen. "A Gossip-based Distributed News Service for Wireless Mesh Networks." In Proc. Third Int'l Conf. Wireless On-demand Network Systems & Services (WONS), Jan. 2006. IEEE Computer Society Press, Los Alamitos, CA.
[12]
M. Jelasity, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. "The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations." In Proc. Middleware 2004, volume 3231 of Lect. Notes Comp. Sc., pp. 79--98, Oct. 2004. Springer-Verlag, Berlin.
[13]
M. Jelasity, W. Kowalczyk, and M. van Steen. "Newscast Computing." Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, 2003.
[14]
M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. "Gossip-based Peer Sampling." ACM Trans. Comp. Syst., 25(3), Aug. 2007.
[15]
M. Jelasity and O. Babaoglu. "T-Man: Gossip-based Overlay Topology Management." In Proc. Third Int'l Workshop Eng. Self-Organising App., volume 3910 of Lect. Notes Comp. Sc., pp. 1--15, June 2006. Springer-Verlag, Berlin.
[16]
M. Jelasity and A.-M. Kermarrec. "Ordered Slicing of Very Large-Scale Overlay Networks." In Proc. Sixth Int'l Conf. Peer-to-Peer Comput., pp. 117--124, Sept. 2006. IEEE Computer Society Press, Los Alamitos, CA.
[17]
M. Jelasity, A. Montresor, and O. Babaoglu. "Gossip-based Aggregation in Large Dynamic Networks." ACM Trans. Comp. Syst., 23(3):219--252, Aug. 2005.
[18]
G.-P. Jesi, D. Gavidia, C. Gamage, and M. van Steen. "A Secure Peer Sampling Service." In Proc. Fourth Int'l Conf. Autonomic Comput., 2007.
[19]
S. Kashyap, S. Deb, K. V. M. Naidu, R. Rastogi, and A. Srinivasan. "Efficient gossip-based aggregate computation." In Proc. 25th Symp. on Principles of Database Systems, pp. 308--317, 2006. ACM Press, New York, NY.
[20]
D. Kempe, A. Dobra, and J. Gehrke. "Gossip-Based Computation of Aggregate Information." In Proc. 44th Symp. Foundations Computer Science, pp. 482--491, Oct. 2003. IEEE Computer Society Press, Los Alamitos, CA.
[21]
A.-M. Kermarrec, L. Massoulié, and A. Ganesh. "Probabilistic Reliable Dissemination in Large-Scale Systems." IEEE Trans. Par. Distr. Syst., 14(3):248--258, Mar. 2003.
[22]
M.-J. Lin and K. Marzullo. "Directional Gossip: Gossip in a Wide-Area Network." In Proc. Third European Dependable Computing Conf., volume 1667 of Lect. Notes Comp. Sc., pp. 364--379. Springer-Verlag, Berlin, Sept. 1999.
[23]
R. Melamed and I. Keidar. "Araneola: A Scalable Reliable Multicast System for Dynamic Environments." In Proc. Third Int'l Symp. Network Computing and Applications, pp. 5--14, 2004. IEEE Computer Society Press, Los Alamitos, CA.
[24]
J. Patel, I. Gupta, and N. Contractorn. "JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles." In Proc. Fifth Int'l Symp. Network Computing and Applications, pp. 32--39, July 2006. IEEE Computer Society Press, Los Alamitos, CA.
[25]
J. Sacha, J. Dowling, R. Cunningham, and R. Meier. "Discovery of Stable Peers in a Self-Organising Peer-to-Peer Gradient Topology." In Proc. Sixth Int'l Conf. Distributed Applications and Interoperable Systems, volume 4025 of Lect. Notes Comp. Sc., pp. 70--83, June 2006. Springer-Verlag, Berlin.
[26]
R. Subramaniyan, P. Raman, A. D. George, and M. Radlinski. "GEMS: Gossip-Enabled Monitoring Service for Scalable Heterogeneous Distributed Systems." Cluster Comput., 9(1):101--120, 2006.
[27]
Z. Toroczkai and K. Bassler. "Network dynamics: Jamming is limited in scale-free systems." Nature, 428:716, Apr. 2004.
[28]
R. van Renesse, K. Birman, and W. Vogels. "Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining." ACM Trans. Comp. Syst., 21(2):164--206, May 2003.
[29]
R. van Renesse, Y. Minsky, and M. Hayden. "A Gossip-Style Failure Detection Service." In Proc. Middleware '98, pp. 55--70, Sept. 1998. IFIP.
[30]
S. Voulgaris, D. Gavidia, and M. van Steen. "CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays." J. Netw. & Syst. Mgt., 13(2):197--217, June 2005.
[31]
S. Voulgaris and M. van Steen. "Epidemic-style Management of Semantic Overlays for Content-Based Searching." In Proc. 11th Int'l Conf. Parallel and Distributed Computing (Euro-Par), volume 3648 of Lect. Notes Comp. Sc., pp. 1143--1152, Sept. 2005. Springer-Verlag, Berlin.
[32]
S. Q. Zhuang, D. Geels, I. Stoica, and R. H. Katz. "On Failure Detection Algorithms in Overlay Networks." In Proc. 24th INFOCOM Conf., Mar. 2005. IEEE Computer Society Press, Los Alamitos, CA.

Cited By

View all

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)87
  • Downloads (Last 6 weeks)11
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)P2P Network in BlockchainPrinciples and Applications of Blockchain Systems10.1002/9781394237258.ch3(59-86)Online publication date: 3-Jan-2025
  • (2024)Swarm intelligence for hole detection and healing in wireless sensor networksComputer Networks10.1016/j.comnet.2024.110538250(110538)Online publication date: Aug-2024
  • (2024)Give Probabilities a Fair Chance!Principles of Verification: Cycling the Probabilistic Landscape10.1007/978-3-031-75778-5_22(469-486)Online publication date: 18-Nov-2024
  • (2023)A Hybrid Communication Approach for Metadata Exchange in Geo-Distributed Fog EnvironmentsProceedings of the IEEE/ACM 16th International Conference on Utility and Cloud Computing10.1145/3603166.3632550(1-7)Online publication date: 4-Dec-2023
  • (2023)An Introduction to Gossip Protocol Based Learning in Peer-to-Peer Federated Learning2023 IEEE International Conference on ICT in Business Industry & Government (ICTBIG)10.1109/ICTBIG59752.2023.10456324(1-8)Online publication date: 8-Dec-2023
  • (2023)RNBFT: Leveraging Randomness to Achieve Scalable Byzantine Consensus2023 IEEE International Conference on Big Data (BigData)10.1109/BigData59044.2023.10386576(2346-2355)Online publication date: 15-Dec-2023
  • (2023)Vicious Cycles in Distributed Software SystemsProceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering10.1109/ASE56229.2023.00032(91-103)Online publication date: 11-Nov-2023
  • (2023)Efficient IoT resource discovery approach based on P2P networks and Fog ComputingInternet of Things10.1016/j.iot.2023.10095424(100954)Online publication date: Dec-2023
  • (2023)Everyone Knows That Everyone Knows: Gossip Protocols for Super ExpertsStudia Logica10.1007/s11225-022-10032-3111:3(453-499)Online publication date: 30-Jan-2023
  • (2023)Communication Pattern Logic: Epistemic and Topological ViewsJournal of Philosophical Logic10.1007/s10992-023-09713-8Online publication date: 28-Jul-2023
  • 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

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media