On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
- 27 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A case for end system multicastIEEE Journal on Selected Areas in Communications, 2002
- Application-layer multicasting with Delaunay triangulation overlaysIEEE Journal on Selected Areas in Communications, 2002
- Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesSIAM Journal on Discrete Mathematics, 2000
- On-line routing of virtual circuits with applications to load balancing and machine schedulingJournal of the ACM, 1997
- Packing Spanning TreesMathematics of Operations Research, 1995
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961