Greedy packet scheduling

Israel Cidon; Shay Kutten; Yishay Mansour; David Peleg

doi:10.1007/3-540-54099-7_12

Greedy packet scheduling

Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

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 Ω(n^1.5), when O(n) packets have to be forwarded on an n-vertex network.

Original language	English
Title of host publication	Distributed Algorithms - 4th International Workshop, Proceedings
Editors	Jan van Leeuwen, Nicola Santoro
Publisher	Springer Verlag
Pages	169-184
Number of pages	16
ISBN (Print)	9783540540991
DOIs	https://doi.org/10.1007/3-540-54099-7_12
State	Published - 1991
Externally published	Yes
Event	4th International Workshop on Distributed Algorithms, WDAG 1990 - Bari, Italy Duration: 24 Sep 1990 → 26 Sep 1990

Publication series

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

Conference

Conference	4th International Workshop on Distributed Algorithms, WDAG 1990
Country/Territory	Italy
City	Bari
Period	24/09/90 → 26/09/90

Bibliographical note

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

Funding

in part by ~n Allon Fellowship,b y ~ Walter ~nd Ellse Ha~

Funders	Funder number
~n Allon Fellowship,b y ~ Walter ~nd Ellse Ha~

Access to Document

10.1007/3-540-54099-7_12

Cite this

Cidon, I., Kutten, S., Mansour, Y., & Peleg, D. (1991). Greedy packet scheduling. In J. van Leeuwen, & N. Santoro (Eds.), Distributed Algorithms - 4th International Workshop, Proceedings (pp. 169-184). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 486 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54099-7_12

@inproceedings{e29b780c28744a31b8f41f34fec0ddd1,

title = "Greedy packet scheduling",

abstract = "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.",

author = "Israel Cidon and Shay Kutten and Yishay Mansour and David Peleg",

note = "Publisher Copyright: {\textcopyright} 1991, Springer Verlag. All rights reserved.; 4th International Workshop on Distributed Algorithms, WDAG 1990 ; Conference date: 24-09-1990 Through 26-09-1990",

year = "1991",

doi = "10.1007/3-540-54099-7_12",

language = "אנגלית",

isbn = "9783540540991",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "169--184",

editor = "{van Leeuwen}, Jan and Nicola Santoro",

booktitle = "Distributed Algorithms - 4th International Workshop, Proceedings",

address = "גרמניה",

}

Cidon, I, Kutten, S, Mansour, Y & Peleg, D 1991, Greedy packet scheduling. in J van Leeuwen & N Santoro (eds), Distributed Algorithms - 4th International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 486 LNCS, Springer Verlag, pp. 169-184, 4th International Workshop on Distributed Algorithms, WDAG 1990, Bari, Italy, 24/09/90. https://doi.org/10.1007/3-540-54099-7_12

Greedy packet scheduling. / Cidon, Israel; Kutten, Shay; Mansour, Yishay et al.
Distributed Algorithms - 4th International Workshop, Proceedings. ed. / Jan van Leeuwen; Nicola Santoro. Springer Verlag, 1991. p. 169-184 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 486 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Greedy packet scheduling

AU - Cidon, Israel

AU - Kutten, Shay

AU - Mansour, Yishay

AU - Peleg, David

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33747909638&partnerID=8YFLogxK

U2 - 10.1007/3-540-54099-7_12

DO - 10.1007/3-540-54099-7_12

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33747909638

SN - 9783540540991

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 169

EP - 184

BT - Distributed Algorithms - 4th International Workshop, Proceedings

A2 - van Leeuwen, Jan

A2 - Santoro, Nicola

PB - Springer Verlag

T2 - 4th International Workshop on Distributed Algorithms, WDAG 1990

Y2 - 24 September 1990 through 26 September 1990

ER -

Greedy packet scheduling

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this