Abstract
Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incorporates correlated link capacities by formulating shared bottlenecks as linear capacity constraints. We define metrics to measure overlay quality. We show that LCC-overlay is perfectly accurate and hence enjoys much better quality than the inaccurate independent overlay. We discover that even the restricted node-based LCC yields significantly better quality. We study two problems in the context of LCC-graphs: widest-path and maximum-flow. We also outline a distributed algorithm to efficiently construct an LCC-overlay.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chu, Y., Rao, S.G., Seshan, S., Zhang, H.: A Case for End System Multicast. IEEE Journal on Selected Areas in Communications, 1456–1471 (October 2002)
Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A., Singh, A.: SplitStream: High-Bandwidth Multicast in Cooperative Environments. In: Proc. of the 19th ACM Symposium on Operating Systems Principles (SOSP 2003) (October 2003)
Byers, J., Considine, J.: Informed Content Delivery Across Adaptive Overlay Networks. In: Proc. of ACM SIGCOMM (August 2002)
Shen, K.: Structure Management for Scalable Overlay Service Construction. In: Proc. of NSDI (2004)
Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: Boston University Representative Internet Topology Generator, http://www.cs.bu.edu/brite
Faloutsos, C., Faloutsos, M., Faloutsos, P.: On Power-Law Relationships of the Internet Topology. In: Proc. of ACM SIGCOMM (August 1999)
Garey, M.S., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Katabi, D., Blake, C.: “Inferring Congestion Sharing and Path Characteristics from Packet Interarrival Times,” Tech. Rep., Laboratory of Computer Science, Massachusetts Institute of Technology (2001)
Katabi, D., Bazzi, I., Yang, X.: A passive approach for detecting shared bottlenecks. In: Proc. of ICCCN 2001 (2001)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM, August 2001, pp. 149–160 (2001)
Stoica, I., Morris, R., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM (2001)
Young, A., Chen, J., Ma, Z., Krishnamurthy, A., Peterson, L., Wang, R.: Overlay Mesh Construction Using Interleaved Spanning Trees. In: Proc. of INFOCOM (2004)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-Aware Overlay Construction and Server Selection. In: Proc. of the IEEE INFOCOM (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, Y., Li, B. (2005). Overlay Networks with Linear Capacity Constraints. In: de Meer, H., Bhatti, N. (eds) Quality of Service – IWQoS 2005. IWQoS 2005. Lecture Notes in Computer Science, vol 3552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499169_4
Download citation
DOI: https://doi.org/10.1007/11499169_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26294-7
Online ISBN: 978-3-540-31659-6
eBook Packages: Computer ScienceComputer Science (R0)