Please use this identifier to cite or link to this item:
Title: Asymptotic optimality of the max-min fair allocation
Authors: Ye, H.-Q. 
Yao, D.D.
Issue Date: 2006
Citation: Ye, H.-Q.,Yao, D.D. (2006). Asymptotic optimality of the max-min fair allocation. Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006 : 352-357. ScholarBank@NUS Repository.
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.
Source Title: Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006
ISBN: 1424400538
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Dec 15, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.