Source Routing and Scheduling in Packet Networks
Matthew Andrews, Antonio Fernandez, Ashish Goel, and Lisa Zhang

TL;DR
This paper introduces an online routing algorithm that finds admissible paths in packet networks and a distributed scheduling protocol that guarantees polynomial end-to-end delays, improving network stability and performance.
Contribution
It presents the first online routing algorithm for admissible paths and a deterministic distributed scheduling protocol with polynomial delay guarantees.
Findings
The routing algorithm computes paths immediately upon packet injection using congestion-aware shortest paths.
The scheduling protocol ensures polynomial delay for all packets under deterministic, distributed implementation.
Path selection can influence network stability, with some topologies remaining stable under certain protocols regardless of adversarial path choices.
Abstract
We study {\em routing} and {\em 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 {\em 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 best previous delay bounds for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Mobile Ad Hoc Networks · Interconnection Networks and Systems
