This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Peer-to-Peer Membership Management for Gossip-Based Protocols
February 2003 (vol. 52 no. 2)
pp. 139-149

Abstract—Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. The requirement of global knowledge impairs their applicability to very large-scale groups. In this paper, we present SCAMP (Scalable Membership protocol), a novel peer-to-peer membership protocol which operates in a fully decentralized manner and provides each member with a partial view of the group membership. Our protocol is self-organizing in the sense that the size of partial views naturally converges to the value required to support a gossip algorithm reliably. This value is a function of the group size, but is achieved without any node knowing the group size. We propose additional mechanisms to achieve balanced view sizes even with highly unbalanced subscription patterns. We present the design, theoretical analysis, and a detailed evaluation of the basic protocol and its refinements. Simulation results show that the reliability guarantees provided by SCAMP are comparable to previous schemes based on global knowledge. The scale of the experiments attests to the scalability of the protocol.

[1] T. Anker, G.V. Chockler, D. Dolev, and I. Keidar, “Scalable Group Membership Services for Novel Applications,” Networks in Distributing Computing (DIMACS Workshop), M. Mavronicolas, M. Merrit, and N. Shavit, eds., pp. 23-42, Am. Math. Soc., 1998.
[2] F. Ball and A. Barbour, “Poisson Approximation for Some Epidemic Models,” J. Applied Probability, vol. 27, pp. 479-490, 1990.
[3] K. Birman, "The Process Group Approach to Reliable Distributed Computing," Comm. ACM, vol. 36, no. 12, pp. 37-53, 1993.
[4] 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.
[5] L.F. Cabrera, M.B. Jones, and M. Theimer, “Herald: Achieving a Global Event Notification Service,” Proc. HotOS VIII, May 2001.
[6] 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.
[7] I. Csiszár, “Information Theoretic Methods in Probability and Statistics,” Information Theory Soc. Rev. articles, http://www.itsoc.org/reviewfrrev.html, 1997.
[8] 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.
[9] S.E. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei, “The PIM Architecture for Wide-Area Multicast Routing,” IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 153-162, Apr. 1996.
[10] 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.
[11] 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.
[12] 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.
[13] S. Floyd et al., "A Reliable Multicast Framework for Lightweight Sessions and Application Level Framing," ACM/IEEE Trans. Networking, Dec. 1997, pp. 784-803.
[14] 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.
[15] I. Gupta, K.P. Birman, and R. van Renesse, “Fighting Fire with Fire: Using Randomized Gossip to Combat Stochastic Scalability Limits,” Quality and Reliability Eng. Int'l, vol. 18, pp. 165-184, Mar. 2002.
[16] I. Keidar, K. Marzullo, J. Sussman, and D. Dolev, A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs Proc. 20th Int'l Conf. Distributed Computing Systems, pp. 356-365, Apr. 2000.
[17] A.-M. Kermarrec, L. Massoulié, and A.J. Ganesh, “Probabilistic Reliable Dissemination in Large-Scale Systems,” IEEE Trans. Parallel and Distributed Systems, to appear.
[18] J.C. Lin and S. Paul, “A Reliable Multicast Transport Protocol,” Proc. IEEE INFOCOM '96, pp. 1414-1424, 1996.
[19] 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.
[20] 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.
[21] B. Pittel, “On Spreading a Rumour,” SIAM J. Applied Math., vol. 47, pp. 213-223, 1987.
[22] D. Powell, “Group Communication,” Comm. ACM, vol. 39, no. 4, Apr. 1996.
[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, “Scalable and Secure Resource Location,” Proc. IEEE Hawaii Int'l Conf. System Science, 2000.
[26] R. van Renesse, Y. Minsky, and M. Hayden, “A Gossip-Style Failure Detection Service,” Proc. IFIP Int'l Conf. Distributed Systems and Platforms and Open Distributed Processing (Middleware '98), 1998.
[27] S.Q. Zhuang, B.Y. Zhao, A.D. Joseph, R.H. Katz, and J. Kubiatowicz, “Bayeux: An Architecture for Scalable and Fault-tolerant Wide-Area Data Dissemination,” Proc. 11th Int'l Workshop Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001), June 2001.

Index Terms:
Scalability, reliability, peer-to-peer, gossip-based probabilistic multicast, membership, group communication, random graphs.
Citation:
Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Laurent Massoulié, "Peer-to-Peer Membership Management for Gossip-Based Protocols," IEEE Transactions on Computers, vol. 52, no. 2, pp. 139-149, Feb. 2003, doi:10.1109/TC.2003.1176982
Usage of this product signifies your acceptance of the Terms of Use.