Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Competitive Routing of Virtual Circuits with Unknown Duration \Lambda
 

Summary: Competitive Routing of Virtual Circuits with
Unknown Duration \Lambda
Baruch Awerbuch y Yossi Azar z Serge Plotkin x Orli Waarts --
September 21, 1995
Abstract
In this paper we present a strategy to route unknown duration virtual circuits in a high­
speed communication network. Previous work on virtual circuit routing concentrated on
the case where the call duration is known in advance. We show that by allowing O(logn)
reroutes per call, we can achieve O(logn) competitive ratio with respect to the maximum
load (congestion) for the unknown duration case, were n is the number of nodes in the
network. This is in contrast to
the\Omega\Gamma 4
p
n) lower bound on the competitive ratio for this
case if no rerouting is allowed [3].
Our routing algorithm can be also applied in the context of machine load balancing of
tasks with unknown duration. We present an algorithm that makes O(log n) reassignments
per task and achieves O(logn) competitive ratio with respect to the load, where n is the
number of parallel machines. For a special case of unit load tasks we design a constant
competitive algorithm. The previously known algorithms that achieve up to polylogarith­

  

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

 

Collections: Computer Technologies and Information Sciences