A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Cross-layer optimization in TCP/IP networks
IEEE/ACM Transactions on Networking (TON)
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the approximability of the minimum congestion unsplittable shortest path routing problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Toward internet-wide multipath routing
IEEE Network: The Magazine of Global Internetworking
Cost of not splitting in routing: characterization and estimation
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieved by the joint optimization of congestion control and routing. As computing the exact loss for a general network topology is NP-hard, we develop analytical bounds on this "cost of not splitting". Our bound is independent of the number of source-destination pairs when the latter one is larger than the number of links in a network. We also propose a vertex projection method and combine it with branch-and-bound to provide progressively tighter bounds on the performance loss. Numerical examples are used to show the effectiveness of our approximation technique.