Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Packet Routing with Arbitrary EndtoEnd Delay Requirements Matthew Andrews
 

Summary: Packet Routing with Arbitrary End­to­End Delay Requirements
Matthew Andrews
andrews@research.bell­labs.com
Lisa Zhang
ylz@research.bell­labs.com
Bell Laboratories
600­700 Mountain Avenue
Murray Hill, NJ 07974
October 7, 1998
Abstract
We study the problem of scheduling packets to meet an arbitrary set of delay requirements.
Consider a connection­oriented network in which a set of sessions is defined. Each session i
follows a fixed route and requests an end­to­end delay requirement \Delta i . The packet injections
for each session are subject to a specified session rate and burst size; the packet movement is
restricted to one packet per link per time step.
If an arbitrary set of delay requirements is schedulable for every link in isolation and for every
session in isolation, we present a simple distributed protocol in which every session i achieves
a delay bound of O((ff + log m
ae min
)\Delta i ). Here, ff is a term that depends logarithmically on the

  

Source: Andrews, Matthew - Mathematics of Networks and Systems, Mathematical Sciences Research Center, Bell Laboratories

 

Collections: Mathematics; Computer Technologies and Information Sciences