Optimal oblivious routing in polynomial time

Yossi Azar, Edith Cohen*, Amos Fiat, Haim Kaplan, Harald Räcke

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)383-394
Number of pages12
JournalJournal of Computer and System Sciences
Volume69
Issue number3 SPEC. ISS.
DOIs
StatePublished - Nov 2004

Keywords

  • Communication networks
  • Oblivious ratio
  • Oblivious routing

Fingerprint

Dive into the research topics of 'Optimal oblivious routing in polynomial time'. Together they form a unique fingerprint.

Cite this