Summary: Satisfying Arbitrary Delay Requirements in
Multihop Networks
Matthew Andrews
Bell Labs, Murray Hill NJ
Email: andrews@research.bell­labs.com
Lisa Zhang
Bell Labs, Murray Hill NJ
Email: ylz@research.bell­labs.com
Abstract--- We consider the problem of scheduling in a multi­
hop packet network so as to satisfy a set of arbitrary end­to­end
delay requirements. A number of scheduling protocols are known
for which end­to­end delay bounds can be derived. However, it
is often the case that these end­to­end delay bounds are large
for flows with small rate. This is clearly inappropriate for traffic
types such as VoIP for which tight delay bounds are required
but session rates are typically small.
In this paper we study the problem of satisfying an arbitrary
set of end­to­delay requirements. For a single server in isolation,
precise conditions on whether or not a set of delay requirements
can be satisfied are known. In contrast, for sessions in a

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

Collections: Mathematics; Computer Technologies and Information Sciences