This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Capacity-Aware Multicast Algorithms on Heterogeneous Overlay Networks
February 2006 (vol. 17 no. 2)
pp. 135-147

Abstract—The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust interdomain multicast routing protocol. Application-level multicast becomes a promising alternative. Many overlay multicast systems have been proposed in recent years. However, they are insufficient in supporting applications that require any-source multicast with varied host capacities and dynamic membership. In this paper, we propose two capacity-aware multicast systems that focus on host heterogeneity, any source multicast, dynamic membership, and scalability. We extend Chord and Koorde to be capacity-aware. We then embed implicit degree-varying multicast trees on top of the overlay network and develop multicast routines that automatically follow the trees to disseminate multicast messages. The implicit trees are well balanced with the workload evenly spread across the network. We rigorously analyze the expected performance of multisource capacity-aware multicasting, which was not thoroughly addressed in any previous work. We also perform extensive simulations to evaluate the proposed multicast systems.

[1] G. Banavar, M. Chandra, B. Nagarajaro, R. Strom, and C. Sturman, “An Efficient Multicast Protocol for Content-Based Publish-Subscribe System,” Proc. Int'l Conf. Distributed Computing Systems '98, May 1998.
[2] Y.H. Chu, S. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. SIGMETRICS '00, June 2000.
[3] J. Jannotti, D. Gifford, K. Johnson, M. Kaashoek, and J. O'Toole, “Overcast: Reliable Multicasting with an Overlay Network,” Proc. Symp. Operating Systems Design and Implementation '00, Oct. 2000.
[4] C. Kommareddy, S. Banerjee, and B. Bhattacharjee, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM '02, Aug. 2002.
[5] S.E. Deering, “Multicast Routing in a Datagram Internetwork,” PhD thesis, Stanford Univ., Dec. 1991.
[6] S.E. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei, “An Architecture for Wide-Area Multicast Routing,” Proc. ACM SIGCOMM '94, pp. 126-135, Aug. 1994.
[7] Y. Chu, S.G. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet Using an Overlay Multicast Architecture,” Proc. ACM SIGCOMM '01, Aug. 2001.
[8] B. Zhang, S. Jamin, and L. Zhang, “Host Multicast: A Framework for Delivering Multicast to End Users,” Proc. INFOCOM '02, June 2002.
[9] G.-I. Kwon and J.W. Byers, “ROMA: Reliable Overlay Multicast with Loosely Coupled TCP Connections,” Proc. INFOCOM '04, Mar. 2004.
[10] P. Mohapatra and Z. Li, “Impact of Topology on Overlay Routing Service,” Proc. INFOCOM '04, Mar. 2004.
[11] Y. Shavitt and T. Tankel, “On the Curvature of the Internet and Its Usage for Overlay Construction and Distance Estimation,” Proc. INFOCOM '04, Mar. 2004.
[12] F. Baccelli, A. Chaintreau, Z. Liu, A. Riabov, and S. Sahu, “Scalability of Reliable Group Communication Using Overlays,” Proc. INFOCOM '04, Mar. 2004.
[13] V. Pappas, B. Zhang, A. Terzis, and L. Zhang, “Fault-Tolerant Data Delivery for Multicast Overlay Networks,” Proc. Int'l Conf. Distributed Computing Systems '04, Mar. 2004.
[14] S. Zhuang, B. Zhao, A. Joseph, R. Katz, and J. Kubiatowicz, “Bayeux: An Architecture for Scalable and Fault-Tolerant WideArea Data Dissemination,” Proc. 11th Int'l Workshop Network and Operating System Support for Digital Audio and Video (NOSSDAV '01), June 2001.
[15] R. Zhang and Y.C. Hu, “Borg: A Hybrid Protocol for Scalable Application-Level Multicast in Peer-to-Peer Networks,” Proc. NOSSDAV '03, 2003.
[16] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Technical Report UCB/CSD-01-1141, Univ. of California at Berkeley, Apr. 2001.
[17] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,” Proc. Middleware '01, Nov. 2001.
[18] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Application-Level Multicast Using Content-Addressable Networks,” Proc. Second Int'l Workshop Network Group Comm. (NGC '01), 2001.
[19] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content Addressable Network,” Proc. ACM SIGCOMM '01, Aug. 2001.
[20] S. El-Ansary, L.O. Alima, P. Brand, and S. Haridi, “Efficient Broadcast in Structured P2P Networks,” Proc. Int'l Workshop Peer-to-Peer Systems '03, Feb. 2003.
[21] M. Castro, M. Jones, A.-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang, and A. Wolman, “An Evaluation of Scalable Application-Level Multicast Built Using Peer-to-Peer Overlays,” Proc. INFOCOM '03, Apr. 2003.
[22] S. Shi, J. Turner, and M. Waldvogel, “Dimensioning Server Access Bandwidth and Multicast Routing in Overlay Networks,” Proc. NOSSDAV '01, June 2001.
[23] S. Shi and J. Turner, “Routing in Overlay Multicast Networks,” Proc. INFOCOM '02, June 2002.
[24] J. Albrecht, D. Kosti, A. Rodriguez, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” Proc. Symp. Operating Systems Principles '03, Oct. 2003.
[25] S. Banerjee, C. Kommareddy, B. Bhattacharjee, K. Kar, and S Khuller, “Construction of an Efficient Overlay Multicast Infrastructure for Real-Time Applications,” Proc. INFOCOM '03, Mar. 2003.
[26] A. Riabov, L. Zhang, and Z. Liu, “Overlay Multicast Trees of Minimal Delay,” Proc. Int'l Conf. Distributed Computing Systems '04, Mar. 2004.
[27] H. Yamaguchi, A. Hiromori, T. Higashino, and K. Taniguchi, “An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree,” Proc. Int'l Conf. Distributed Computing Systems '04, Mar. 2004.
[28] 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 '01, pp. 149-160, Aug. 2001.
[29] M. Kaashoek and D. Karger, “Koorde: A Simple Degree-Optimal Distributed Hash Table,” Proc. Second Int'l Workshop Peer-to-Peer Systems, Feb. 2003.
[30] K.P. Gummadi, R. Gummadi, S.D. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, “The Impact of DHT Routing Geometry on Resilience and Proximity,” Proc. ACM SIGCOMM '03, Aug. 2003.
[31] S. Sen and J. Wong, “Analyzing Peer-to-Peer Traffic across Large Networks,” Proc. Second Ann. ACM Internet Measurement Workshop, Nov. 2002.
[32] S. Ratnasamy, “Routing Algorithms for DHTs: Some Open Questions,” Proc. First Int'l Workshop Peer-to-Peer Systems, Mar. 2002.
[33] A. Mukherjee, “On the Dynamics and Significance of Low Frequency Components of Internet Load,” Internetworking: Research and Experience, vol. 5, no. 4, pp. 163-205, 1994.

Index Terms:
Multicast, network communication.
Citation:
Zhan Zhang, Shigang Chen, Yibei Ling, Randy Chow, "Capacity-Aware Multicast Algorithms on Heterogeneous Overlay Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 2, pp. 135-147, Feb. 2006, doi:10.1109/TPDS.2006.19
Usage of this product signifies your acceptance of the Terms of Use.