This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Multicast in Overlay Networks with Linear Capacity Constraints
July 2009 (vol. 20 no. 7)
pp. 925-939
ASCII Text
x 
 
Ying Zhu, Baochun Li, Ken Qian Pu, "Dynamic Multicast in Overlay Networks with Linear Capacity Constraints," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 7, pp. 925-939, July, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2008.155,
author = {Ying Zhu and Baochun Li and Ken Qian Pu},
title = {Dynamic Multicast in Overlay Networks with Linear Capacity Constraints},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {20},
number = {7},
issn = {1045-9219},
year = {2009},
pages = {925-939},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.155},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Dynamic Multicast in Overlay Networks with Linear Capacity Constraints
IS - 7
SN - 1045-9219
SP925
EP939
EPD - 925-939
A1 - Ying Zhu,
A1 - Baochun Li,
A1 - Ken Qian Pu,
PY - 2009
KW - Peer-to-peer overlay networks
KW - multicast
KW - algorithms
KW - network protocols.
VL - 20
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Ying Zhu, University of Ontario Institute of Technology, Oshawa
Baochun Li, University of Toronto, Toronto
Ken Qian Pu, University of Ontario Institute of Technology, Oshawa
In a peer-to-peer overlay network, the phenomenon of multiple overlay links sharing bottleneck physical links leads to correlation of overlay link capacities. We are able to more accurately model the overlay by incorporating these linear capacity constraints (LCCs). We formulate the problem of maximizing bandwidth in overlay multicast using our LCC model. We show that finding a maximum bandwidth multicast tree in an overlay network with LCC is NP-complete. Therefore, an efficient heuristics algorithm is designed to solve the problem. Extensive simulations show that our algorithm is able to construct multicast trees that are optimal or extremely close to optimal, with significantly higher bandwidth than trees formed in overlays with no LCC. Furthermore, we develop a fully distributed algorithm for obtaining near-optimal multicast trees, by means of gossip-based algorithms and a restricted but inherently distributed class of LCC (node-based LCC). We demonstrate that the distributed algorithm converges quickly to the centralized optimal and is highly scalable.

[1] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically-Aware Overlay Construction and Server Selection,” Proc. IEEE INFOCOM, 2002.
[2] M. Kwon and S. Fahmy, “Path-Aware Overlay Multicast,” Computer Networks, vol. 47, no. 1, pp. 23-45, Jan. 2005.
[3] A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, and R. Wang, “Overlay Mesh Construction Using Interleaved Spanning Trees,” Proc. IEEE INFOCOM, 2004.
[4] K. Shen, “Structure Management for Scalable Overlay Service Construction,” Proc. First Symp. Networked Systems Design and Implementation (NSDI), 2004.
[5] Y. Chu, S.G. Rao, S. Seshan, and H. Zhang, “A Case for End System Multicast,” IEEE J. Selected Areas in Comm., pp. 1456-1471, Oct. 2002.
[6] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM '02, Aug. 2002.
[7] X. Zheng, C. Cho, and Y. Xia, “Optimal Peer-to-Peer Technique for Massive Content Distribution,” Proc. IEEE INFOCOM, 2008.
[8] J. Byers and J. Considine, “Informed Content Delivery across Adaptive Overlay Networks,” Proc. ACM SIGCOMM '02, Aug. 2002.
[9] D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP), 2003.
[10] N. Magharei and R. Rejaie, “PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming,” Proc. IEEE INFOCOM, 2007.
[11] B. Li et al., “Inside the New Coolstreaming: Principles, Measurements and Performance Implications,” Proc. IEEE INFOCOM, 2008.
[12] D. Ren, Y.H. Li, and S.G. Chan, “On Reducing Mesh Delay for Peer-to-Peer Live Streaming,” Proc. IEEE INFOCOM, 2008.
[13] V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, “Distributing Streaming Media Content Using Cooperative Networking,” Proc. 12th Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '02), May 2002.
[14] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, “SplitStream: High-Bandwidth Multicast in Cooperative Environments,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), Oct. 2003.
[15] Y. Zhu and B. Li, “Overlay Networks with Linear Capacity Constraints,” Proc. 13th IEEE Int'l Workshop Quality of Service (IWQoS), 2005.
[16] M. Tsang, C. Wang, K. Tsang, and F. Lau, “A Receiver-Coordinated Approach for Throughput Aggregation in High Bandwidth Multicast,” Proc. IEEE INFOCOM, 2007.
[17] M.S. Kim, Y. Li, and S.S. Lam, “Eliminating Bottlenecks in Overlay Multicast,” Proc. Fourth Int'l IFIP-TC6 Networking Conf. (Networking), 2005.
[18] M.S. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[19] A. Medina, A. Lakhina, I. Matta, and J. Byers, “BRITE: Boston University Representative Internet Topology Generator,” http://www.cs.bu.edubrite, 2008.
[20] C. Faloutsos, M. Faloutsos, and P. Faloutsos, “On Power-Law Relationships of the Internet Topology,” Proc. ACM SIGCOMM '99, Aug. 1999.
[21] D. Katabi and C. Blake, “Inferring Congestion Sharing and Path Characteristics from Packet Interarrival Times,” technical report, Laboratory of Computer Science, Mass. Inst. Tech nology, 2001.
[22] D. Katabi, I. Bazzi, and X. Yang, “A Passive Approach for Detecting Shared Bottlenecks,” Proc. Int'l Conf. Computer Comm. and Networks (ICCCN), 2001.
[23] D. Kempe, A. Dobra, and J. Gehrke, “Gossip-Based Computation of Aggregate Information,” Proc. 44th IEEE Symp. Foundations of Computer Science (FOCS), 2003.
[24] M. Zaharia and S. Keshav, “Gossip-Based Search Selection in Hybrid Peer-to-Peer Networks,” J. Concurrency and Computation: Practice and Experience, 2007.
[25] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Gossip Algorithms: Design, Analysis and Applications,” Proc. IEEE INFOCOM, 2005.
[26] D. Psaltoulis et al., “Practical Algorithms for Size Estimation in Large and Dynamic Groups,” http://www.cs.cornell.edu/Info/Projects/ Spinglass/public_ pdfssize_estimation.PDF , 2008.
[27] J.E. Hopcroft, R. Motwani, and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, second ed. Addison Wesley, 2000.

Index Terms:
Peer-to-peer overlay networks, multicast, algorithms, network protocols.
Citation:
Ying Zhu, Baochun Li, Ken Qian Pu, "Dynamic Multicast in Overlay Networks with Linear Capacity Constraints," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 7, pp. 925-939, July 2009, doi:10.1109/TPDS.2008.155
Usage of this product signifies your acceptance of the Terms of Use.