Anne-Marie Kermarrec
Skip Abstract Section
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.
- 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. Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- B. Bollobas. Random Graphs. Cambridge University Press, Cambridge, UK, 2nd edition, 2001.Google Scholar
- S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. "Randomized Gossip Algorithms." IEEE Transactions on Information Theory, 52(6):2508--2530, June 2006. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- P. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié. "Epidemic Information Dissemination in Distributed Systems." IEEE Computer, 37(5):60--67, May 2004.Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- M. Jelasity, W. Kowalczyk, and M. van Steen. "Newscast Computing." Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, 2003.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- M. Jelasity, A. Montresor, and O. Babaoglu. "Gossip-based Aggregation in Large Dynamic Networks." ACM Trans. Comp. Syst., 23(3):219--252, Aug. 2005. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Z. Toroczkai and K. Bassler. "Network dynamics: Jamming is limited in scale-free systems." Nature, 428:716, Apr. 2004.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- R. van Renesse, Y. Minsky, and M. Hayden. "A Gossip-Style Failure Detection Service." In Proc. Middleware '98, pp. 55--70, Sept. 1998. IFIP.Google ScholarCross Ref
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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.Google Scholar
Index Terms
- Gossiping in distributed systems
Recommendations
Exploiting the synergy between gossiping and structured overlays
Gossip-based computer networkingIn this position paper we argue for exploiting the synergy between gossip-based algorithms and structured overlay networks (SON). These two strands of research have both aimed at building fault-tolerant, dynamic, self-managing, and large-scale ...
Gossiping for resource discovering: An analysis based on complex network theory
This paper analyzes the adoption of unstructured P2P overlay networks to build resource discovery services. We consider a simple distributed communication protocol, which is based on gossip and on the local knowledge each node has about resources hold ...
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systemsDistributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale ...
Comments