Greedy packet scheduling

Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Scheduling packets to be forwarded over a link is an important subtask of the routing process both in parallel computing and in communication networks. This paper investigates the simple class of greedy scheduling algorithms, namely, algorithms that always forward a packet if they can. It is first proved that for various “natural” classes of routes, the time required to complete the transmission of a set of packets is bounded by the sum of the number of packets and the maximal route length, for any greedy algorithm (including the arbitrary scheduling policy). Next, tight time bounds of Θ(n) are proved for a specific greedy algorithm on the class of shortest paths in n-vertex networks. Finally it is shown that when the routes are arbitrary, the time achieved by various “natural” greedy algorithms can be as bad as Ω(n1.5), when O(n) packets have to be forwarded on an n-vertex network.

Original languageEnglish
Title of host publicationDistributed Algorithms - 4th International Workshop, Proceedings
EditorsJan van Leeuwen, Nicola Santoro
PublisherSpringer Verlag
Number of pages16
ISBN (Print)9783540540991
StatePublished - 1991
Externally publishedYes
Event4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy
Duration: 24 Sep 199026 Sep 1990

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume486 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Workshop on Distributed Algorithms, WDAG 1990

Bibliographical note

Publisher Copyright:
© 1991, Springer Verlag. All rights reserved.


Dive into the research topics of 'Greedy packet scheduling'. Together they form a unique fingerprint.

Cite this