Greedy packet scheduling on shortest paths

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

Abstract

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 paths” ), 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.

Original languageEnglish
Title of host publicationProceedings of the Annual ACM Symposium on Principles of Distributed Computing
PublisherAssociation for Computing Machinery
Pages165-175
Number of pages11
ISBN (Print)0897914392
DOIs
StatePublished - 1 Jul 1991
Externally publishedYes
Event10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991 - Montreal, Canada
Duration: 19 Aug 199121 Aug 1991

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference10th Annual ACM Symposium on Principles of Distributed Computing, PODC 1991
Country/TerritoryCanada
CityMontreal
Period19/08/9121/08/91

Funding

FundersFunder number
Defense Advanced Research Projects AgencyNOO014-87-K-0825

    Fingerprint

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

    Cite this