Optimal oblivious routing in polynomial time

Authors:
Yossi Azar;Edith Cohen;Amos Fiat;Haim Kaplan;Harald Räcke
Affiliations:
School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel;AT&T Research Labs, 180 Park Ave., Florham Park, 07932 NJ;School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel;School of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel;Heinz Nixdorf Institute, Germany and Department of Mathematics and Computer Science, Paderborn University, 33102 Paderborn, Germany
Venue:
Journal of Computer and System Sciences - Special issue: STOC 2003
Year:
2004

Citing 13
Cited 8

Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences
Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Tight bounds for oblivious routing in the hypercube

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
Measuring ISP topologies with rocketfuel

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Minimizing Congestion in General Networks

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
On-line Network Routing

Developments from a June 1996 seminar on Online algorithms: the state of the art
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
Online oblivious routing

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

Routing and network design with robustness to changing or uncertain traffic demands

ACM SIGACT News
The VPN conjecture is true

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal routing for wireless mesh networks with dynamic traffic demand

Mobile Networks and Applications
Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty

Computer Networks: The International Journal of Computer and Telecommunications Networking
Demand-oblivious routing: distributed vs. centralized approaches

INFOCOM'10 Proceedings of the 29th conference on Information communications
Threshold rules for online sample selection

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Simultaneous approximations for adversarial and stochastic online budgeted allocation

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Towards load balanced distributed transactional memory

Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recent seminal result of Räcke is that for any undirected network there is an oblivious routing algorithm with a polylogarithmic competitive ratio with respect to congestion. Unfortunately, Räcke's construction is not polynomial time. We give a polynomial time construction that guarantees Räcke's bounds, and more generally gives the true optimal ratio for any (undirected or directed) network.