Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Oblivious Routing in Polynomial time Yossi Azar Edith Cohen y Amos Fiat Haim Kaplan Harald Racke z
 

Summary: Optimal Oblivious Routing in Polynomial time
Yossi Azar  Edith Cohen y Amos Fiat  Haim Kaplan  Harald Racke z
February 5, 2003
Abstract
A recent seminal result of Racke is that for any network there is an oblivious routing al-
gorithm 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.
1 Introduction
Communication routing is obviously one of the key technological issues today. The literature in-
cludes hundreds of papers and literally dozens of problem variants on this issue. Problem variants
are characterized by parameters such as packet routing vs. virtual circuit routing, xed vs. in -
nite bu ers, speci c vs. general networks, probabilistic input distribution models vs. worst case
input distributions, deterministic vs. randomized routing algorithms, online vs. oine routing al-
gorithms, distributed vs. centralized algorithms, etc. Examples of some surveys on this vast body
of literature are [6, 7].
In this paper we focus on the problem of online virtual circuit routing on general networks with
the goal of minimizing the congestion.
Two fundamental approaches towards routing in networks are to route adaptively depending
on the current loads in the network, or to route obliviously, without any knowledge of the current

  

Source: Azar, Yossi - School of Computer Science, Tel Aviv University

 

Collections: Computer Technologies and Information Sciences