Greedy packet scheduling on shortest paths (preliminary version)

We investigate the simple class of greedy scheduling algorithms, that is, algorithms that always forward a packet if they can. Assuming that the routes traversed by a set of packets are distance optimal (“shortest pat hs” ), we prove that the time required to complete transmission of a packet in a the set is bounded by its route length plus the number of other packets in the set. This bound holds for any greedy algorithm, even, in the case of different starting times and different route lengths. Furthermore, the result holds in the asynchronous model, using the same proof technique. The generality of our result is demonstrated by a variety of applications. We present a simple protocol, for which we derive a general bound on the throughput with any greedy scheduling. Another protocol for the dynamic case is presented, whose packet delivery time is bounded by the length of the route of the packet plus the number of packets in the network in the time it is sent. ●Aiken computation Laboratory, Harvard University, Cambridge, MA 02138. Supported in part by ONR under contract NOO014-85-K-0445. t Laboratory for Computer Science, MIT, Cambridge, MA 02139. Supported in part by DARPA under Contract NOO014-87-K-0825. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. TO Copy otherwise, or to republish, requires a fee and/or specific permission. @ 1991 ACM 0-89791-439-2/91/0007/0165 $1.50 Boaz Patt-Shamirt

[1]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[2]  Shay Kutten,et al.  Greedy Packet Scheduling , 1990, WDAG.

[3]  Shamkant B. Navathe,et al.  Scheduling file transfers in fully connected networks , 1992, Networks.

[4]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[5]  Bruce M. Maggs,et al.  Universal Packet Routing Algorithms (Extended Abstract) , 1988, FOCS 1988.

[6]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.