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: Contribution to journalArticlepeer-review

2 Scopus citations


In this paper, we study a multi-server queuing system wherein each user is constrained to get service only from a specified subset of servers. Fair packet scheduling in such a setting poses novel challenges that we address in this paper. Specifically, we observe that max-min fair allocation of the available resource over different servers (notably bandwidth) in the presence of placement constraints results in different levels of fair service-rates. To achieve the max-min fair service rates, we propose a novel packet scheduler which is inspired by the deficit-round robin (DRR) algorithm. 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. So, we have called it multi-server max-min fair DRR (MSMF-DRR). The performance of the MSMF-DRR algorithm in terms of achieving fairness is shown through a worst-case performance analysis. In addition to analytical results, numerical experiments are also carried out to illustrate service isolation and the delay guarantee that are provided by the algorithm. Generally, a scheduler for such a constrained multi-server queuing system can be applicable in many modern data-networking applications, especially in cloud computing wherein virtual machines and/or processes vie for different IT resources distributed over heterogenous servers, while different processes may have preferences over servers owing to their quality-of-service requirements and the heterogeneity of servers.

Original languageEnglish (US)
Pages (from-to)219-237
Number of pages19
JournalAnnales des Telecommunications/Annals of Telecommunications
Issue number3-4
StatePublished - Apr 1 2018

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


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