This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast
July 2006 (vol. 17 no. 7)
pp. 593-605

Abstract—Epidemic-style (gossip-based) techniques have recently emerged as a class of scalable and reliable protocols for peer-to-peer multicast dissemination in large process groups. However, popular implementations of epidemic-style dissemination suffer from two major drawbacks: 1) Network overhead: When deployed on a WAN-wide or VPN-wide scale, they generate a large number of packets that transit across the boundaries of multiple network domains (e.g., LANs, subnets, ASs), causing an overload on core network elements such as bridges, routers, and associated links. 2) Lack of adaptivity: They impose the same load on process group members and the network even under reduced failure rates (viz., packet losses, process failures). In this paper, we describe two protocols to address these problems: 1) a hierarchical gossiping protocol and 2) an adaptive dissemination framework (for multicasts) that allows use of any gossiping primitive within it. These protocols work within a virtual peer-to-peer hierarchy called the Leaf Box Hierarchy. Processes can be allocated in a topologically aware manner to the leaf boxes of this structure, so that protocols 1 and 2 produce low traffic across domain boundaries in the network and induce minimal overhead when there are no failures.

[1] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM, pp. 205-217, 2002.
[2] R. Bhagwan, S. Savage, and G. Voelker, “Understanding Availability,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS), pp. 135-140, Feb. 2003.
[3] 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, 1999.
[4] Y. Chu, S.G. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet Using an Overlay Muilticast Architecture,” Proc. ACM SIGCOMM, pp. 55-67, 2001.
[5] F. Dabek, R. Cox, F. Kaashoek, and R. Morris, “Vivaldi: A Decentralized Network Coordinate System,” Proc. ACM SIGCOMM, Aug. 2004.
[6] A. Das, I. Gupta, and A. Motivala, “SWIM: Scalable Weakly-Consistent Infection-Style Process Group Membership Protocol,” Proc. 2002 Int'l Conf. Dependable Systems and Networks (DSN '02), pp. 303-312, 2002.
[7] A. Demers, D. Greene, C. Hauser, W. Irish, and J. Larson, “Epidemic Algorithms for Replicated Database Maintenance,” Proc. Sixth Ann. ACM Symp. Principles of Distributed Computing (PODC '87), pp. 1-12, 1987.
[8] P. Eugster, R. Guerraoui, S. Handurukande, A.-M. Kermarrec, and P. Kouznetsov, “Lightweight Probabilistic Broadcast,” Proc. Int'l Conf. Dependable Systems and Networks (DSN '01), pp. 443-452, 2001.
[9] P.T. Eugster and R. Guerraoui, “Probabilistic Multicast,” Proc. 2002 Int'l Conf. Dependable Systems and Networks (DSN '02), pp. 313-322, 2002.
[10] S. Floyd, V. Jacobson, C. Liu, S. McCanne, and L. Zhang, “A Reliable Multicast Framework for Light-Weight Sessions and Application Level Framing,” IEEE/ACM Trans Networking, vol. 5, no. 6, pp. 784-803, Dec. 1997.
[11] A. Ganesh, A.-M. Kermarrec, and L. Massoulié, “Peer-To-Peer Membership Management for Gossip-Based Protocols,” IEEE Trans. Computers, vol. 52, no. 2, pp. 139-149, Feb. 2003.
[12] I. Gupta, A.-M. Kermarrec, and A.J. Ganesh, “Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast,” Proc. Symp. Reliable Distributed Systems (SRDS '02) pp. 180-189, Oct. 2002.
[13] I. Gupta, R. van Renesse, and K. Birman, “Scalable Fault-Tolerant Aggregation in Large Process Groups,” Proc. Int'l Conf. Dependable Systems and Networks (DSN '01), pp. 433-442, 2001.
[14] I. Gupta, R. van Renesse, and K. Birman, “Fighting Fire with Fire: Using Randomized Gossip to Combat Stochastic Scalability Limits,” J. Quality and Reliability Eng. Int'l, vol. 18, pp. 165-184, May/June 2002.
[15] A. Iamnitchi, M. Ripeanu, and I. Foster, “Locating Data In (Small-World?) P2P Scientific Collaborations,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS '02), pp. 85-93, Mar. 2002.
[16] A.-M. Kermarrec, L. Massoulié, and A. Ganesh, “Probabilistic Reliable Dissemination in Large-Scale Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 3, pp. 248-258, Mar. 2003.
[17] M.-J. Lin and K. Marzullo, “Directional Gossip: Gossip in a Wide Area Network,” Proc. European Dependable Computing Conf., pp. 364-379, 1999.
[18] M.-J. Lin, K. Marzullo, and S. Masini, “Gossip versus Deterministically Constrained Flooding on Small Networks,” Proc. 14th Int'l Conf. Distributed Computing (DISC 2000), pp. 253-267, 2000.
[19] M. Lucas, “Efficient Data Distribution in Large-Scale Multicast Networks“ PhD thesis, Univ. of Virginia, May 1998.
[20] D. Malkhi and K. Horowitz, “Estimating Network Size from Local Information,” ACM Information Processing Letters, vol 88, no. 5, pp. 237-243, Dec. 2003.
[21] T. Ng and H. Zhang, “Towards Global Network Positioning,” Proc. ACM SIGCOMM Conf. Internet Measurement, pp. 25-29, Nov. 2001.
[22] S. Paul, K. Sabnani, and S. Bhattacharya, “Reliable Muticast Transport Protocol (RMTP),” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 405-421, 1997.
[23] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically-Aware Overlay Construction and Server Selection,” Proc. 21st IEEE INFOCOM, June 2002.
[24] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Conf. Middleware, pp. 329-350, 2001.
[25] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, pp. 149-160, 2001.
[26] R. van Renesse, K.P. Birman, and W. Vogels, “Astrolabe: A Robust and Scalable Technology for Distributed Systems Monitoring, Management, and Data Mining,“ ACM Trans. Computer Systems vol. 21, no. 3, pp. 164-206, 2003.
[27] R. van Renesse, Y. Minsky, and M. Hayden, “A Gossip-Style Failure Detection Service,” Proc. Conf. Middleware, pp. 55-70, 1998.
[28] Z. Xiao and K. Birman, “A Randomized Error Recovery Algorithm for Reliable Multicast,” Proc. 20th IEEE INFOCOM, vol. 1, pp. 239-248, 2001.
[29] E. Zegura, K. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. 15th IEEE INFOCOM, vol. 2, pp. 594-602, 1996.

Index Terms:
Distributed systems, reliability, network communication, simulation, multicast, reliability, epidemics, gossip, adaptivity, topology awareness.
Citation:
Indranil Gupta, Anne-Marie Kermarrec, Ayalvadi J. Ganesh, "Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 7, pp. 593-605, July 2006, doi:10.1109/TPDS.2006.85
Usage of this product signifies your acceptance of the Terms of Use.