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 proceedingConference 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 languageEnglish (US)
Title of host publication2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509013289
DOIs
StatePublished - Jan 1 2016
Event59th IEEE Global Communications Conference, GLOBECOM 2016 - Washington, United States
Duration: Dec 4 2016Dec 8 2016

Publication series

Name2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings

Other

Other59th IEEE Global Communications Conference, GLOBECOM 2016
CountryUnited States
CityWashington
Period12/4/1612/8/16

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Constrained max-min fair scheduling of variable-length packet-flows to multiple servers'. Together they form a unique fingerprint.

  • 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 [7841686] (2016 IEEE Global Communications Conference, GLOBECOM 2016 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2016.7841686