Asymptotic optimality of the max-min fair allocation

Hengqing Ye, David D. Yao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review


Multiple classes of jobs are processed in a stochastic network that consists of a set of servers. Each class of jobs requires a concurrent occupancy of a subset of servers to be processed, and each server is shared among the job classes in a head-of-the-line processor-sharing mechanism. In each state of the network, the server capacities are allocated among the job classes according to the so-called max-minfair policy. We derive the fluid and diffusion limits of the network under this resource control policy. Furthermore, we provide a characterization of the fixed-point state associated with the fluid limit, and identify a cost function that is minimized in the diffusion regime.
Original languageEnglish
Title of host publicationProceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006
Number of pages6
Publication statusPublished - 1 Dec 2006
Externally publishedYes
Event8th International Workshop on Discrete Event Systems, WODES 2006 - Ann Arbor, MI, United States
Duration: 10 Jul 200612 Jul 2006


Conference8th International Workshop on Discrete Event Systems, WODES 2006
Country/TerritoryUnited States
CityAnn Arbor, MI

ASJC Scopus subject areas

  • Computer Science(all)
  • Control and Systems Engineering


Dive into the research topics of 'Asymptotic optimality of the max-min fair allocation'. Together they form a unique fingerprint.

Cite this