On achieving optimized capacity utilization in application overlay networks with multiple competing sessions

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 160-169

  Cui, Yi ^a   Li, Baochun ^b   Nahrstedt, Klara ^a  

^a Digital Computer Laboratory   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Multicast; Multicommodity flow; Overlay

Indexed keywords

ALGORITHMS; BANDWIDTH; DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; MULTICASTING; NETWORK PROTOCOLS; PACKET SWITCHING;

MULTICOMMODITY FLOW MODELS; ONLINE TREE CONSTRUCTION ALGORITHMS; OVERLAY NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 8344232522     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007937     Document Type: Conference Paper

References (19)

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, &SplitStream: High-Bandwidth Multicast in Cooperative Environments,& in Proc. of the 19th ACM Symposium on Operating Systems Principles (SOSP 2003), October 2003.
3. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, &Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,& in Proc. of ACM SOSP, 2003.
4. J. Byers and J. Considine, &Informed Content Delivery Across Adaptive Overlay Networks,& in Proc. of ACM SIGCOMM, August 2002.
5. N. Deo, Graph Theory with Applications to Engineering and Computer Science, 1994.
6. M. Grotschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimizations, Springer-Verlag, 1993.
7. W.T. Tutte, &On the problem of decomposing a graph in n connected factors,& Journal of London Mathematical Society, vol. 36, pp. 221, 230, 1961.
8. C.S.J.A. Nash-Williams, &Edge-disjoint spanning trees of finite graphs,& Journal of London Mathematical Society, vol. 36, pp. 445, 450, 1961.
9. W.H. Cunningham, &Optimal attack and reinforcement of a network,& Journal of ACM, vol. 32, pp. 549, 561, 1985.
10. F. Barahona, &Packing spanning trees,& Mathematics of Operation Research, vol. 20, pp. 104, 115, 1995.
11. N. Garg and J. Konemann, &Faster and simpler algorithms for multicommodity flow and other fractional packing problems,& in IEEE FOCS, 1998.
12. L.K. Fleischer, &Approximating fractional multicommodity flow independent of the number of commodities,& SIAM Journal of Discrete Mathematics, vol. 13, pp. 505, 520, 2000.
13. Y. Cui, Baochun Li and K. Nahrstedt, &On achieving optimized capacity utilization in application overlahy networks with multiple competing sessions,& in Technical Report UIUCDCS-R-2004-2425/UILU-ENG-2004-1726, 2004.
14. R.M. Karp, &Reducibility among combinatorial problems,& Complexity of Computer Computations, pp. 85, 103, 1972.
15. P. Raghavan and C.D. Thompson, &Randomized rounding: A technique for provably good algorithms and algorithmic proofs,& Combinatorica, vol. 7, pp. 365, 374, 1987.
16. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts, &On-line routing of virtual circuits with applications to load balancing and machine scheduling,& Journal of ACM, vol. 44, pp. 486, 504, 1997.
17. J. Liebeherr, M. Nahas, and W. Si, &Application-Layer Multicasting With Delaunay Triangulation Overlays,& IEEE Journal on Selected Areas in Communications, pp. 1472-1488, 2002.
18. S. Banerjee, B. Bhattacharjee, and C. Kommareddy, &Scalable Application Layer Multicast,& in Proc. of ACM SIGCOMM, August 2002.
19. V. Padmanabhan, H. Wang, P. Chou, and K. Sripanidkulchai, &Distributing Streaming Media Content Using Cooperative Networking,& in Proc. of ACM NOSSDAV 2002, May 2002.