Summary: General Dynamic Routing with Per­Packet Delay Guarantees of
O( distance + 1 / session rate ) \Lambda
Matthew Andrews y Antonio Fern'andez z Mor Harchol­Balter x Tom Leighton --
Lisa Zhang k
Laboratory for Computer Science, MIT.
fandrews, anto, harchol, ftl, ylzg@theory.lcs.mit.edu
Abstract
A central issue in the design of modern communication networks is that of providing per­
formance guarantees. This issue is particularly important if the networks support real­time
traffic such as voice and video. The most critical performance parameter to bound is the delay
experienced by a packet as it travels from its source to its destination.
We study the dynamic routing problem in a connection­oriented packet­switching network.
We consider a network with arbitrary topology on which a set of sessions is defined. Each
session follows a fixed path from a source to a destination. Packets are injected continually in
the sessions with rate r i
for session i. During any time step at most one packet may traverse
any edge. Session paths may overlap subject to the constraint that the total rate of sessions
using any particular edge is less than 1.
We show the existence of an asymptotically­optimal schedule that achieves a delay bound of
O(1=r i

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

Collections: Mathematics; Computer Technologies and Information Sciences