This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Overlay Networks with Linear Capacity Constraints
February 2008 (vol. 19 no. 2)
pp. 159-173
Overlay networks are virtual networks residing overthe IP network, consequently, overlay links may share hiddenl ower-level bottlenecks. Previous work have assumed an independent overlay model: a graph with independent link capacities.We introduce a model of overlays which incorporates correlated link capacities and linear capacity constraints (LCC) to formulate hidden shared bottlenecks; we refer to these as LCC-overlays. We define metrics to qualitatively measure overlay quality in terms of its accuracy (in representing the true network topology) and efficiency (i.e., performance). Through analysis and simulations,we show that LCC-overlay is perfectly accurate and hence enjoys much higher efficiency than the inaccurate independent overlay. We discover that even a highly restricted LCC class — node basedLCC— yields near-optimal accuracy and significantly higher efficiency. We study two network flow problems in the context of LCC-graphs: Widest-Path and Maximum-Flow. Weprove that Widest-Path with LCC is NP-complete. We formulate Maximum-Flow with LCC as a linear program, and propose an efficient distributed algorithm to solve it. Based on the LCCmodel, we further study the problem of optimizing delay while still maintaining optimal or near-optimal bandwidth. We also outline a distributed algorithm to efficiently construct an overlay with node-based LCC.

[1] 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.
[2] 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.
[3] J. Byers and J. Considine, “Informed Content Delivery Across Adaptive Overlay Networks,” Proc. ACM SIGCOMM, Aug. 2002.
[4] K. Shen, “Structure Management for Scalable Overlay Service Construction,” Proc. Symp. Networked Systems Design and Implementation (NSDI '04), 2004.
[5] A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: Boston Univ. Representative Internet Topology Generator, http://www.cs.bu.edubrite, 2007.
[6] C. Faloutsos, M. Faloutsos, and P. Faloutsos, “On Power-Law Relationships of the Internet Topology,” Proc. ACM SIGCOMM, Aug. 1999.
[7] H. Tangmunarunkit et al., “Network Topology Generators: Degree-Based versus Structural,” Proc. ACM SIGCOMM, 2002.
[8] M.S. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
[9] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[10] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically-Aware Overlay Construction and Server Selection,” Proc. IEEE INFOCOM, 2002.
[11] D. Katabi and C. Blake, “Inferring Congestion Sharing and Path Characteristics from Packet Interarrival Times,” technical report, Laboratory of Computer Science, Massachusetts Inst. of Tech nology, 2001.
[12] D. Katabi, I. Bazzi, and X. Yang, “A Passive Approach for Detecting Shared Bottlenecks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks (ICCCN '01), 2001.
[13] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM, pp. 149-160, Aug. 2001.
[14] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Middleware, Nov. 2001.
[15] I. Stoica, R. Morris, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
[16] A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, and R. Wang, “Overlay Mesh Construction Using Interleaved Spanning Trees,” Proc. IEEE INFOCOM, 2004.
[17] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM, Aug. 2002.
[18] D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” Proc. ACM Symp. Operating System Principles (SOSP '03), 2003.
[19] 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.
[20] J.M. Jaffe, “Algorithms for Finding Paths with Multiple Constraints,” Networks, pp. 95-116, 1984.
[21] A. Iwata et al., “ATM Routing Algorithms with Multiple QoS Requirements for Multimedia Internetworking,” IEICE Trans. and Comm. E79-B, pp. 999-1006, 1996.
[22] H. De Neve and P. Van Mieghem, “TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm,” Computer Comm., pp. 667-679, 2000.
[23] P. Van Mieghem, H. De Neve, and F.A. Kuipers, “Hop-by-Hop Quality of Service Routing,” Computer Networks, pp. 407-423, Oct. 2001.
[24] F.A. Kuipers and P. Van Mieghem, “MAMCRA: A Constrained-Based Multicast Routing Algorithm,” Computer Comm., pp. 801-810, May 2002.

Index Terms:
Overlay networks, network protocols, algorithm/protocol design and analysis, network topology.
Citation:
Ying Zhu, Baochun Li, "Overlay Networks with Linear Capacity Constraints," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 2, pp. 159-173, Feb. 2008, doi:10.1109/TPDS.2007.70726
Usage of this product signifies your acceptance of the Terms of Use.