Optimal oblivious routing in polynomial time

Authors:
Yossi Azar;Edith Cohen;Amos Fiat;Haim Kaplan;Harald Racke
Affiliations:
Tel Aviv University, Tel Aviv, Israel;AT&T research labs, Florham park, NJ;Tel Aviv University, Tel Aviv, Israel;Tel Aviv University, Tel Aviv, Israel;Heinz Nixdorf Institute and Paderborn University, Paderborn, Germany
Venue:
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Year:
2003

Citing 9
Cited 40

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
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

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
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
The all-or-nothing multicommodity flow problem

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Secure routerless routing

Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Optimal Oblivious Path Selection on the Mesh

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Oblivious routing in directed graphs with random demands

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Universal approximations for TSP, Steiner tree, and set cover

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
Oblivious routing on node-capacitated and directed graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on geometric networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Improved lower and upper bounds for universal TSP in planar metrics

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New lower bounds for oblivious routing in undirected graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Oblivious network design

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Semi-oblivious routing

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
COPE: traffic engineering in dynamic networks

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Making routing robust to changing traffic demands: algorithms and evaluation

IEEE/ACM Transactions on Networking (TON)
Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Semi-oblivious routing: lower bounds

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on node-capacitated and directed graphs

ACM Transactions on Algorithms (TALG)
Minimizing average latency in oblivious routing

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal hierarchical decompositions for congestion minimization in networks

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Statistical Approach to NoC Design

NOCS '08 Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip
Oblivious routing of highly variable traffic in service overlays and IP backbones

IEEE/ACM Transactions on Networking (TON)
Atomic routing games on maximum congestion

Theoretical Computer Science
Survey on Oblivious Routing Strategies

CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Simultaneous source location

ACM Transactions on Algorithms (TALG)
Routing with load balancing: increasing the guaranteed node traffics

IEEE Communications Letters
Oblivious routing in fat-tree based system area networks with uncertain traffic demands

IEEE/ACM Transactions on Networking (TON)
A hybrid approach for robust traffic engineering

ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
Optimal capacity allocation for load balanced shortest path routing

HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Cost reduction of reliable networks using load balanced routing

IEEE Communications Letters
Two phase load balanced routing using OSPF

IEEE Journal on Selected Areas in Communications
Evaluation of Routing with Robustness to the Variation in Traffic Demand

Journal of Network and Systems Management
Traffic-oblivious routing in the hose model

IEEE/ACM Transactions on Networking (TON)
MicroTE: fine grained traffic engineering for data centers

Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Generalized secure routerless routing

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Distributing content simplifies ISP traffic engineering

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Fast pattern-specific routing for fat tree networks

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recent seminal result of Racke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, Racke's construction is not polynomial time. We give a polynomial time construction that guarantee's Racke's bounds, and more generally gives the true optimal ratio for any network.