Source Routing and Scheduling in Packet Networks

We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is overloaded. We present the first on-line routing algorithm that finds a set of admissible paths whenever this is feasible. Our algorithm calculates a path for each packet as soon as it is injected at its source using a simple shortest path computation. The length of a link reflects its current congestion. We also show how our algorithm can be implemented under today's Internet routing paradigms. When the paths are known (either given by the adversary or computed as above), our goal is to schedule the packets along the given paths so that the packets experience small end-to-end delays. The This work was partially supported by DIMACS funding. A preliminary version of this article appeared in Proceedings of the 42nd IEEE Annual Symposium on Fou...

• Type: Journal
• Year: 2002
• Where: CORR
• Authors: Matthew Andrews, Antonio Fernández, Ashish Goel, Lisa Zhang
• Keywords: Admissible Paths, CORR 2002, Education, On-line Routing Algorithm, Routing