Asymptotic optimality of the max-min fair allocation

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Title of host publicationProceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006
Pages352-357
Publication statusPublished - 2006
Externally publishedYes

Conference

Title8th International Workshop on Discrete Event Systems, WODES 2006
PlaceUnited States
CityAnn Arbor, MI
Period10 - 12 July 2006

Abstract

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. © 2006 IEEE.

Citation Format(s)

Asymptotic optimality of the max-min fair allocation. / Ye, Heng-Qing; Yao, David D.

Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006. 2006. p. 352-357.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review