Overlay networks with linear capacity constraints

Lecture Notes in Computer Science

Volumn 3552, Issue , 2005, Pages 21-36

  Zhu, Ying ^a   Li, Baochun ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; PROBLEM SOLVING; TELECOMMUNICATION LINKS;

CORRELATED LINK; INDEPENDENT LINK CAPACITIES; LINEAR CAPACITY CONSTRAINTS; MAXIMUM FLOW;

QUALITY OF SERVICE;

EID: 26444438052     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499169_4     Document Type: Conference Paper

References (14)

1. Y. Chu, S. G. Rao, S. Seshan, and H. Zhang, "A Case for End System Multicast," IEEE Journal on Selected Areas in Communications, pp. 1456-1471, October 2002.
2. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "Split-Stream: High-Bandwidth Multicast in Cooperative Environments," in Proc. of the 19th ACM Symposium on Operating Systems Principles (SOSP 2003), October 2003.
3. J. Byers and J. Considine, "Informed Content Delivery Across Adaptive Overlay Networks," in Proc. of ACM SIGCOMM, August 2002.
4. K. Shen, "Structure Management for Scalable Overlay Service Construction," in Proc. of NSDI, 2004.
5. A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: Boston University Representative Internet Topology Generator, http://www.cs.bu.edu/brite.
6. C. Faloutsos, M. Faloutsos, and P. Faloutsos, "On Power-Law Relationships of the Internet Topology," in Proc. of ACM SIGCOMM, August 1999.
7. M.S. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.
8. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs NJ, 1993.
9. D. Katabi and C. Blake, "Inferring Congestion Sharing and Path Characteristics from Packet Interarrival Times," Tech. Rep., Laboratory of Computer Science, Massachusetts Institute of Technology, 2001.
10. D. Katabi, I. Bazzi, and X. Yang, "A passive approach for detecting shared bottlenecks," in Proc. of ICCCN'01, 2001.
11. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," in Proc. of ACM SIGCOMM, August 2001, pp. 149-160.
12. I. Stoica, R. Morris, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. of ACM SIGCOMM, 2001.
13. A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, and R. Wang, "Overlay Mesh Construction Using Interleaved Spanning Trees," in Proc. of INFOCOM, 2004.
14. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically- Aware Overlay Construction and Server Selection," in Proc. of the IEEE INFOCOM, 2002.