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 proceedingConference contribution

6 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 languageEnglish (US)
Title of host publication2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages390-395
Number of pages6
ISBN (Electronic)9781467394574
DOIs
StatePublished - Apr 26 2016
Event50th Annual Conference on Information Systems and Sciences, CISS 2016 - Princeton, United States
Duration: Mar 16 2016Mar 18 2016

Publication series

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

Other

Other50th Annual Conference on Information Systems and Sciences, CISS 2016
Country/TerritoryUnited States
CityPrinceton
Period3/16/163/18/16

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Fingerprint

Dive into the research topics of 'Max-min Fair scheduling of variable-length packet-flows to multiple servers by deficit round-robin'. Together they form a unique fingerprint.

Cite this