Semi-oblivious routing

Authors:
MohammadTaghi Hajiaghayi;Robert Kleinberg;Tom Leighton
Affiliations:
Carnegie Mellon University;University of California, Berkeley;Massahusetts Institute of Technology
Venue:
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2006

Citing 4
Cited 0

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
Optimal oblivious routing in polynomial time

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce semi-oblivious routing, a generalization of oblivious routing in which multicommodity flows must be routed using a polynomial-sized set of paths which is predefined by the algorithm before the demand matrix for the flow problem is revealed. Our results, which are primarily negative, exclude the possibility of constant-competitive semi-oblivious routing schemes, even when the network is a grid or a seriesparallel graph. We provide an even stronger lower bound on the congestion of constant-bend routing schemes in the grid.