Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ThroughputCompetitive OnLine Routing Baruch Awerbuch \Lambda
 

Summary: Throughput­Competitive On­Line Routing
Baruch Awerbuch \Lambda
Lab. for Computer Science
MIT
Yossi Azar y
Tel­Aviv University
and DEC SRC
Serge Plotkin z
Dept. of Computer Science
Stanford University
Abstract
We develop a framework that allows us to address the issues of admission control and
routing in high­speed networks under the restriction that once a call is admitted and routed,
it has to proceed to completion and no reroutings are allowed. The ``no rerouting'' restriction
appears in all the proposals for future high­speed networks and stems from current hardware
limitations, in particular the fact that the bandwidth­delay product of the newly developed
optical communication links far exceeds the buffer capacity of the network.
In case the goal is to maximize the throughput, our framework yields an on­line O(lognT )­
competitive strategy, where n is the number of nodes in the network and T is the maximum
call duration. In other words, our strategy results in throughput that is within O(log nT )

  

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

 

Collections: Computer Technologies and Information Sciences