Summary: Packet Routing with Arbitrary EndtoEnd Delay Requirements
600700 Mountain Avenue
Murray Hill, NJ 07974
October 7, 1998
We study the problem of scheduling packets to meet an arbitrary set of delay requirements.
Consider a connectionoriented network in which a set of sessions is defined. Each session i
follows a fixed route and requests an endtoend 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
)\Delta i ). Here, ff is a term that depends logarithmically on the