This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks
September 2007 (vol. 18 no. 9)
pp. 1188-1201
Application-level multicast is a promising alternative to IP multicast due to its independence to the IP routing infrastructure and its flexibility in constructing the delivery trees. The existing overlay multicast systems either support a single data source or have high maintenance overhead when multiple sources are allowed. They are inefficient for applications that require any-source multicast with varied host capacities and dynamic membership. This paper proposes ACOM, an any-source overlay multicast system, consisting of three distributed multicast algorithms on top of a non-DHT overlay network with simple structures (random overlay with a non-DHT ring) that are easy to manage as nodes join and depart. The nodes have different capacities, and they can support different numbers of direct children during a multicast session. No explicit multicast trees are maintained on top of the overlay. The distributed execution of the algorithms naturally defines an implicit, roughly-balanced, capacity-constrained multicast tree for each source node. We prove that the system can deliver a multicast message from any source to all nodes in expected O(logc n) hops, which is asymptotically optimal, where c is the average node capacity and n is the number of members in a multicast group.

[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 (ICDCS '98), May 1998.
[2] Y.H. Chu, S. Rao, S. Seshan, and H. Zhang, “A Case for End System Multicast,” IEEE J. Selected Areas in Comm., vol. 20, no. 8, Oct. 2002.
[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 (OSDI '00), Oct. 2000.
[4] C.K.S. Banerjee and B. Bhattacharjee, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM '02, Aug. 2002.
[5] B. Zhang, S. Jamin, and L. Zhang, “Host Multicast: A Framework for Delivering Multicast to End Users,” Proc. INFOCOM '02, June 2002.
[6] G.-I. Kwon and J.W. Byers, “ROMA: Reliable Overlay Multicast with Loosely Coupled TCP Connections,” Proc. INFOCOM '04, Mar. 2004.
[7] P.M. Zhi Li, “Impact of Topology on Overlay Routing Service,” Proc. INFOCOM '04, Mar. 2004.
[8] 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.
[9] F. Baccelli, A. Chaintreau, Z. Liu, A. Riabov, and S. Sahu, “Scalability of Reliable Group Communication Using Overlays,” Proc. INFOCOM '04, Mar. 2004.
[10] V. Pappas, B. Zhang, A. Terzis, and L. Zhang, “Fault-Tolerant Data Delivery for Multicast Overlay Networks,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS '04), Mar. 2004.
[11] J.A. Dejan Kosti, A. Rodriguez, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” Proc. Symp. Operating Systems Principles (SOSP '03), Oct. 2003.
[12] S. Banerjee, C. Kommareddy, B.B.K. Kar, and S. Khuller, “Construction of an Efficient Overlay Multicast Infrastructure for Real-Time Applications,” Proc. INFOCOM '03, Mar. 2003.
[13] A. Riabov and L.Z. Zhen Liu, “Overlay Multicast Trees of Minimal Delay,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS '04), Mar. 2004.
[14] 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 (ICDCS '04), Mar. 2004.
[15] 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.
[16] R. Zhang and Y.C. Hu, “Borg: A Hybrid Protocol for Scalable Application-Level Multicast in Peer-to-Peer Networks,” Proc. Int'l Workshop Network and Operating System Support for Digital Audio and Video (NOSSDAV '03), 2003.
[17] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Application-Level Multicast Using Content-Addressable Networks,” Proc. Int'l Workshop Networked Group Comm. (NGC '01), 2001.
[18] 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.
[19] Z. Zhang, S. Chen, Y. Ling, and R. Chow, “Capacity-Aware Multicast Algorithms in Heterogeneous Overlay Networks,” IEEE Trans. Parallel and Distributed Systems, special section on algorithm design and scheduling techniques (realistic platform models) for heterogeneous clusters, vol. 17, no. 2, pp. 135-147, Feb. 2006.
[20] S. Shi, J. Turner, and M. Waldvogel, “Dimensioning Server Access Bandwidth and Multicast Routing in Overlay Networks,” Proc. Int'l Workshop Network and Operating System Support for Digital Audio and Video (NOSSDAV '01), June 2001.
[21] S. Shi and J. Turner, “Routing in Overlay Multicast Networks,” Proc. INFOCOM '02, June 2002.
[22] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Univ. of California Berkeley Technical Report UCB/CSD-01-1141, Apr. 2001.
[23] A. Rowstron and P. Druschel, “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,” Proc. Middleware '01, Nov. 2001.
[24] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “AScalable Content Addressable Network,” Proc. ACM SIGCOMM '01, Aug. 2001.
[25] 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 (IPTPS '03), Feb. 2003.
[26] 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.
[27] M. Kaashoek and D. Karger, “Koorde: A Simple Degree-Optimal Distributed Hash Table,” Proc. Second Int'l Workshop Peer-to-Peer Systems (IPTPS '03), Feb. 2003.
[28] T.S.E. Ng and H. Zhang, “Predicting Internet Network Distance with Coordinates-Based Approaches,” Proc. IEEE INFOCOM '02, June 2002.
[29] 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:
Any-Source Overlay Multicast, Peer-to-Peer Networks, Distributed Multicast Algorithms
Citation:
Shiping Chen, Baile Shi, Shigang Chen, "ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 9, pp. 1188-1201, Sept. 2007, doi:10.1109/TPDS.2007.1037
Usage of this product signifies your acceptance of the Terms of Use.