Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Online client-server load balancing without global information
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
New lower bounds for oblivious routing in undirected graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
ACM SIGACT News
Online packet admission and oblivious routing in sensor networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We study the problem of online call admission and routing ("call control") on general networks. We give new algorithms that with high probability achieve a poly-logarithmic fraction (in the size of the network) of the optimal solution. The decisions of our algorithms do not depend on the current load of all network links, as in previous algorithms for general network topologies [AAP93]. Instead, their admission decisions depend only on link loads along a single path between the communicating parties, and they can thus be performed in a distributed hop-by-hop manner through the network. Furthemore, our algorithms can handle concurrent requests in the network.