Constrained max-min fair scheduling of variable-length packet-flows to multiple servers

J. Khamse-Ashari; G. Kesidis; I. Lambadaris; B. Urgaonkar; Y. Zhao

doi:10.1109/GLOCOM.2016.7841686

Constrained max-min fair scheduling of variable-length packet-flows to multiple servers

J. Khamse-Ashari, G. Kesidis, I. Lambadaris, B. Urgaonkar, Y. Zhao

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

3 Scopus citations

Abstract

We describe a scheduler for multiple servers shared among different packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler allocates tokens to flows in a round-by-round manner, where token allocation to flows at the beginning of each round is weighted max-min fair. We present a packet scheduling scheme where when a server becomes free, it is allocated to serve the HOL packet of an eligible flow with the maximum remaining tokens. The scheduling algorithm is applicable even when the capacity of servers are not known a priori and may vary over duration of a round. Numerical examples are given to illustrate that the scheduler itself is weighted max-min fair.

Original language	English (US)
Title of host publication	2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781509013289
DOIs	https://doi.org/10.1109/GLOCOM.2016.7841686
State	Published - 2016
Event	59th IEEE Global Communications Conference, GLOBECOM 2016 - Washington, United States Duration: Dec 4 2016 → Dec 8 2016

Publication series

Name	2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings

Other

Other	59th IEEE Global Communications Conference, GLOBECOM 2016
Country/Territory	United States
City	Washington
Period	12/4/16 → 12/8/16

All Science Journal Classification (ASJC) codes

Computational Theory and Mathematics
Computer Networks and Communications
Hardware and Architecture
Safety, Risk, Reliability and Quality

Access to Document

10.1109/GLOCOM.2016.7841686

Cite this

Khamse-Ashari, J., Kesidis, G., Lambadaris, I., Urgaonkar, B., & Zhao, Y. (2016). Constrained max-min fair scheduling of variable-length packet-flows to multiple servers. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings Article 7841686 (2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2016.7841686

@inproceedings{7f0483a696f24592b688279802ad5b8d,

title = "Constrained max-min fair scheduling of variable-length packet-flows to multiple servers",

abstract = "We describe a scheduler for multiple servers shared among different packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler allocates tokens to flows in a round-by-round manner, where token allocation to flows at the beginning of each round is weighted max-min fair. We present a packet scheduling scheme where when a server becomes free, it is allocated to serve the HOL packet of an eligible flow with the maximum remaining tokens. The scheduling algorithm is applicable even when the capacity of servers are not known a priori and may vary over duration of a round. Numerical examples are given to illustrate that the scheduler itself is weighted max-min fair.",

author = "J. Khamse-Ashari and G. Kesidis and I. Lambadaris and B. Urgaonkar and Y. Zhao",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 59th IEEE Global Communications Conference, GLOBECOM 2016 ; Conference date: 04-12-2016 Through 08-12-2016",

year = "2016",

doi = "10.1109/GLOCOM.2016.7841686",

language = "English (US)",

series = "2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings",

address = "United States",

}

Khamse-Ashari, J, Kesidis, G, Lambadaris, I, Urgaonkar, B & Zhao, Y 2016, Constrained max-min fair scheduling of variable-length packet-flows to multiple servers. in 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings., 7841686, 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings, Institute of Electrical and Electronics Engineers Inc., 59th IEEE Global Communications Conference, GLOBECOM 2016, Washington, United States, 12/4/16. https://doi.org/10.1109/GLOCOM.2016.7841686

Constrained max-min fair scheduling of variable-length packet-flows to multiple servers. / Khamse-Ashari, J.; Kesidis, G.; Lambadaris, I. et al.
2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2016. 7841686 (2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings).

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

TY - GEN

T1 - Constrained max-min fair scheduling of variable-length packet-flows to multiple servers

AU - Khamse-Ashari, J.

AU - Kesidis, G.

AU - Lambadaris, I.

AU - Urgaonkar, B.

AU - Zhao, Y.

PY - 2016

Y1 - 2016

N2 - We describe a scheduler for multiple servers shared among different packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler allocates tokens to flows in a round-by-round manner, where token allocation to flows at the beginning of each round is weighted max-min fair. We present a packet scheduling scheme where when a server becomes free, it is allocated to serve the HOL packet of an eligible flow with the maximum remaining tokens. The scheduling algorithm is applicable even when the capacity of servers are not known a priori and may vary over duration of a round. Numerical examples are given to illustrate that the scheduler itself is weighted max-min fair.

AB - We describe a scheduler for multiple servers shared among different packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler allocates tokens to flows in a round-by-round manner, where token allocation to flows at the beginning of each round is weighted max-min fair. We present a packet scheduling scheme where when a server becomes free, it is allocated to serve the HOL packet of an eligible flow with the maximum remaining tokens. The scheduling algorithm is applicable even when the capacity of servers are not known a priori and may vary over duration of a round. Numerical examples are given to illustrate that the scheduler itself is weighted max-min fair.

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

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

U2 - 10.1109/GLOCOM.2016.7841686

DO - 10.1109/GLOCOM.2016.7841686

M3 - Conference contribution

AN - SCOPUS:85015369065

T3 - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings

BT - 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 59th IEEE Global Communications Conference, GLOBECOM 2016

Y2 - 4 December 2016 through 8 December 2016

ER -

Khamse-Ashari J, Kesidis G, Lambadaris I, Urgaonkar B, Zhao Y. Constrained max-min fair scheduling of variable-length packet-flows to multiple servers. In 2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2016. 7841686. (2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings). doi: 10.1109/GLOCOM.2016.7841686

Constrained max-min fair scheduling of variable-length packet-flows to multiple servers

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this