Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin
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.
|Conference||50th Annual Conference on Information Systems and Sciences, CISS 2016|
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). doi:10.1109/CISS.2016.7460534