Constrained max-min fair scheduling of variable-length packet-flows to multiple servers
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.
|Conference||59th IEEE Global Communications Conference, GLOBECOM 2016|
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. doi:10.1109/GLOCOM.2016.7841686