Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin

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

doi:10.1109/CISS.2016.7460534

Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin

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

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

7 Scopus citations

Abstract

We describe a scheduler based on deficit-round robin (DRR) for multiple servers of multiple packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler uses a token allocation algorithm that is weighted max-min fair, and so we've called it Multi-Server Max-min Fair DRR (MSMF-DRR). The scheduler also compensates for potential errors in estimates of server capacities when determining token allocations, and considers service underflow resulting in unused tokens at the end of a round. Numerical examples are given to illustrate how the scheduler itself is weighted max-min fair.

Original language	English (US)
Title of host publication	2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	390-395
Number of pages	6
ISBN (Electronic)	9781467394574
DOIs	https://doi.org/10.1109/CISS.2016.7460534
State	Published - Apr 26 2016
Event	50th Annual Conference on Information Systems and Sciences, CISS 2016 - Princeton, United States Duration: Mar 16 2016 → Mar 18 2016

Publication series

Name	2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

Other

Other	50th Annual Conference on Information Systems and Sciences, CISS 2016
Country/Territory	United States
City	Princeton
Period	3/16/16 → 3/18/16

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Information Systems

Access to Document

10.1109/CISS.2016.7460534

Cite this

Khamse-Ashari, J., Kesidis, G., Lambadaris, I., Urgaonkar, B., & Zhao, Y. (2016). Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin. In 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016 (pp. 390-395). Article 7460534 (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISS.2016.7460534

Khamse-Ashari, J. ; Kesidis, G. ; Lambadaris, I. et al. / Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin. 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 390-395 (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016).

@inproceedings{35032581b8e54deb957dff24e2c916c3,

title = "Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin",

abstract = "We describe a scheduler based on deficit-round robin (DRR) for multiple servers of multiple packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler uses a token allocation algorithm that is weighted max-min fair, and so we've called it Multi-Server Max-min Fair DRR (MSMF-DRR). The scheduler also compensates for potential errors in estimates of server capacities when determining token allocations, and considers service underflow resulting in unused tokens at the end of a round. Numerical examples are given to illustrate how 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.; 50th Annual Conference on Information Systems and Sciences, CISS 2016 ; Conference date: 16-03-2016 Through 18-03-2016",

year = "2016",

month = apr,

day = "26",

doi = "10.1109/CISS.2016.7460534",

language = "English (US)",

series = "2016 50th Annual Conference on Information Systems and Sciences, CISS 2016",

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

pages = "390--395",

booktitle = "2016 50th Annual Conference on Information Systems and Sciences, CISS 2016",

address = "United States",

}

Khamse-Ashari, J, Kesidis, G, Lambadaris, I, Urgaonkar, B & Zhao, Y 2016, Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin. in 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016., 7460534, 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016, Institute of Electrical and Electronics Engineers Inc., pp. 390-395, 50th Annual Conference on Information Systems and Sciences, CISS 2016, Princeton, United States, 3/16/16. https://doi.org/10.1109/CISS.2016.7460534

Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin. / Khamse-Ashari, J.; Kesidis, G.; Lambadaris, I. et al.
2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 390-395 7460534 (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016).

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

TY - GEN

T1 - Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin

AU - Khamse-Ashari, J.

AU - Kesidis, G.

AU - Lambadaris, I.

AU - Urgaonkar, B.

AU - Zhao, Y.

PY - 2016/4/26

Y1 - 2016/4/26

N2 - We describe a scheduler based on deficit-round robin (DRR) for multiple servers of multiple packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler uses a token allocation algorithm that is weighted max-min fair, and so we've called it Multi-Server Max-min Fair DRR (MSMF-DRR). The scheduler also compensates for potential errors in estimates of server capacities when determining token allocations, and considers service underflow resulting in unused tokens at the end of a round. Numerical examples are given to illustrate how the scheduler itself is weighted max-min fair.

AB - We describe a scheduler based on deficit-round robin (DRR) for multiple servers of multiple packet-flows, where each packet-flow may be served by only a subset of available (preferred) servers. The scheduler uses a token allocation algorithm that is weighted max-min fair, and so we've called it Multi-Server Max-min Fair DRR (MSMF-DRR). The scheduler also compensates for potential errors in estimates of server capacities when determining token allocations, and considers service underflow resulting in unused tokens at the end of a round. Numerical examples are given to illustrate how the scheduler itself is weighted max-min fair.

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

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

U2 - 10.1109/CISS.2016.7460534

DO - 10.1109/CISS.2016.7460534

M3 - Conference contribution

AN - SCOPUS:84992315640

T3 - 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

SP - 390

EP - 395

BT - 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 50th Annual Conference on Information Systems and Sciences, CISS 2016

Y2 - 16 March 2016 through 18 March 2016

ER -

Khamse-Ashari J, Kesidis G, Lambadaris I, Urgaonkar B, Zhao Y. Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin. In 2016 50th Annual Conference on Information Systems and Sciences, CISS 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 390-395. 7460534. (2016 50th Annual Conference on Information Systems and Sciences, CISS 2016). doi: 10.1109/CISS.2016.7460534

Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this