This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Probabilistic Reliable Dissemination in Large-Scale Systems
March 2003 (vol. 14 no. 3)
pp. 248-258

Abstract—The growth of the Internet raises new challenges for the design of distributed systems and applications. In the context of group communication protocols, gossip-based schemes have attracted interest as they are scalable, easy to deploy, and resilient to network and process failures. However, traditional gossip-based protocols have two major drawbacks: 1) They rely on each peer having knowledge of the global membership and 2) being oblivious to the network topology, they can impose a high load on network links when applied to wide-area settings. In this paper, we provide a theoretical analysis of gossip-based protocols which relates their reliability to key system parameters (system size, failure rates, and number of gossip targets). The results provide guidelines for the design of practical protocols. In particular, they show how reliability can be maintained while alleviating drawback 1) by providing each peer with only a small subset of the total membership information and drawback 2) by organizing members into a hierarchical structure that reflects their proximity according to some network-related metric. We validate the analytical results by simulations and verify that the hierarchical gossip protocol considerably reduces the load on the network compared to the original, nonhierarchical protocol.

[1] F. Ball and A. Barbour, “Poisson Approximation for Some Epidemic Models,” J. Applied Probability, vol. 27, pp. 479-490, 1990.
[2] K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky, “Bimodal Multicast,” ACM Trans. Computer Systems, vol. 17, no. 2, pp. 41-88, May 1999.
[3] K. Birman and T. Joseph., “Exploiting Virtual Synchrony in Distributed Systems,” Proc. ACM Symp. Operating Systems Principles, ACM Press, New York, 1987, pp. 123‐138.
[4] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, “SCRIBE: A Large-Scale and Decentralized Application-Level Multicast Infrastructure,” IEEE J. Selected Areas in Comm., to appear, 2002.
[5] S.E. Deering and D.R. Cheriton, “Multicast Routing in Datagram Internetworks and Extended LANs,” ACM Trans. Computer Systems, vol. 8, pp. 85-110, May 1990.
[6] 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 Proc. Sixth ACM Symp. Principles of Distributed Computing, 1987.
[7] P. Erdös and A. Renyi, “On the Evolution of Random Graphs,” Mat Kutato Int. Közl, vol. 5, no. 17, pp. 17-60, 1960.
[8] P.T. Eugster, R. Guerraoui, S.B. Handurukande, A.-M. Kermarrec, and P. Kouznetsov, “Lightweight Probabilistic Broadcast,” Proc. IEEE Int'l Conf. Dependable Systems and Networks (DSN2001), 2001.
[9] S. Floyd et al., "A Reliable Multicast Framework for Lightweight Sessions and Application Level Framing," ACM/IEEE Trans. Networking, Dec. 1997, pp. 784-803.
[10] A. Ganesh, A.-M. Kermarrec, and L. Massoulié, “Scamp: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication,” Proc. Third Int'l Workshop Networked Group Comm., Nov. 2001.
[11] A.J. Ganesh, A.-M. Kermarrec, and L. Massoulié, “Peer-to-Peer Membership Management for Gossip-Based Protocols,” IEEE Trans. Computers, To appear. Feb. 2003.
[12] A.J. Ganesh, L. Massoulié, and A.-M. Kermarrec, “Hi-Scamp: Self-Organizing Hierarchical Membership Protocol,” Proc. SIGOPS European Workshop, Sept. 2002.
[13] R. Golding and K. Taylor, “Group Membership in the Epidemic Style,” Technical Report UCSC-CRL-92-13, Dept. of Computer Science, Univ. of California, Santa Cruz, 1992.
[14] K. Guo, M. Hayden, R. van Renesse, W. Vogels, and K. Birman, “GSGC: An Efficient Gossip-Based Garbage Collection Scheme for Scalable Reliable Multicast,” Technical Report TR-97-1656, Dept. of Computer Science, Cornell Univ., 1997.
[15] I. Gupta, A.-M. Kermarrec, and A.J. Ganesh, “Adaptive and Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast,” Proc. 21st Symp. Reliable Distributed Systems (SRDS), Oct. 2002.
[16] H. Holbrook, S. Singhal, and D. Cheriton, “Log-Based Receiver-Reliable Multicast for Distributed Interactive Simulation,” Proc. SIGCOMM, 1995.
[17] J. Jannotti, D.K. Gifford, K.L. Johnson, F. Kaashoek, and J.W. O'Toole, “Overcast: Reliable Multicasting with an Overlay Network,” Proc. Fourth Symp. Operating Systems Design and Implementation (OSDI), 2000.
[18] M.F. Kaashoek, A.S. Tanenbaum, S. Hummel, and H.E. Bal, “An Efficient Reliable Broadcast Protocol,” Operating Systems Review, vol. 23, no. 4, pp. 5–19, Oct. 1989.
[19] J.C. Lin and S. Paul, “A Reliable Multicast Transport Protocol,” Proc. IEEE INFOCOM '96, pp. 1414-1424, 1996.
[20] M.-J. Lin and K. Marzullo, “Directional Gossip: Gossip in a Wide-Area Network,” Technical Report CS1999-0622, Univ. of California, San Diego, Computer Science and Eng., June 1999.
[21] M.-J. Lin, K. Marzullo, and S. Masini, “Gossip versus Deterministic Flooding: Low Message Overhead and High-Reliability for Broadcasting on Small Networks,” Proc. 14th Int'l Symp. Distributed Computing (DISC 2000), pp. 253-267, Oct. 2000.
[22] S. Shenker, R. Karp, C. Schindelhauer, and B. Vöcking, “Randomized Rumour Spreading,” IEEE Proc. 41st Ann. Symp. Foundations of Computer Science (FOCS) 2000, pp. 565-574, 2000.
[23] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Application-Level Multicast Using Content-Addressable Networks,” Proc. Third Int'l Workshop Networked Group Comm., Nov. 2001.
[24] Q. Sun and D.C. Sturman, “A Gossip-Based Reliable Multicast for Large-Scale High-Throughput Applications,” Proc. Int'l Conf. Dependable Systems and Networks (DSN2000), July 2000.
[25] R. van Renesse and K. Birman, “Scalable Management and Data Mining Using Astrolabe,” Electronic Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), Mar. 2002.
[26] R. van Renesse, Y. Minsky, and M. Hayden, “A Gossip-Style Failure Detection Service,” Middleware, 1998.
[27] E.W. Zegura, K.L. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. IEEE Infocom, Apr. 1996.

Index Terms:
Scalability, reliability, gossip-based probabilistic multicast, membership, group communication, random graphs.
Citation:
Anne-Marie Kermarrec, Laurent Massoulié, Ayalvadi J. Ganesh, "Probabilistic Reliable Dissemination in Large-Scale Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 248-258, March 2003, doi:10.1109/TPDS.2003.1189583
Usage of this product signifies your acceptance of the Terms of Use.