Source Routing and Scheduling in Packet Networks.pdfVIP

Source Routing and Scheduling in Packet Networks  Matthew Andrews y Antonio Fern´andez z Ashish Goel x Lisa Zhang { Abstract 1 Introduction We study routing and scheduling in packet-switched net- Two of the most important problems in the control of works. We assume an adversary that controls the injection packet-switched networks are routing and scheduling. The time, source, and destination for each packet injected. A set goal of routing is to assign a path to a packet from its source of paths for these packets is admissible if no link in the net- to its destination. The goal of scheduling is to deal with the work is overloaded. We present the first on-line routing al- contention that occurs when two or more packets wish to gorithm that finds a set of admissible paths whenever this is cross a link simultaneously. Each link must have a sched- feasible. Our algorithm calculates a path for each packet uler that resolves this contention by deciding which packet as soon as it is injected at its source using a simple shortest to advance. path computation. The length of a link reflects its current The scheduling problem typically assumes that the paths congestion. We also show how our algorithm can be imple- of the packets are given as part of the input. The goal is then mented under today’s Internet routing paradigms. to schedule the packets along their paths in such a way that When the paths are know