Summary: Packet Routing via Min­Cost Circuit Routing
Baruch Awerbuch \Lambda Yossi Azar y Amos Fiat z
Abstract
In this paper we initiate the study of competitive on­line
packet routing algorithms. At any time, any network node
may initiate sending a packet to another node. Our goal
is to route these packets through the network, while simul­
taneously minimizing link bandwidth, buffer usage, and the
average delay of a packet. We give efficient centralized
on­line packet routing algorithms in this setting. These al­
gorithms achieve a constant competitive ratio with respect
to the average delay while increasing the link bandwidth by
no more than a logarithmic factor.
To obtain our packet routing results, we introduce com­
petitive algorithms for a new problem called min­cost load
circuit routing. Here, the goal is to create on­line virtual
circuits in a graph, while trying to simultaneously minimize
link bandwidth and (related) communication costs.
1. Introduction
In this paper we initiate the study of competitive on­line

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

Collections: Computer Technologies and Information Sciences; Physics