Asymptotic optimality of the max-min fair allocation

Hengqing Ye; David D. Yao

Asymptotic optimality of the max-min fair allocation

Hengqing Ye
, David D. Yao

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

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.

Original language	English
Title of host publication	Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006
Pages	352-357
Number of pages	6
Publication status	Published - 1 Dec 2006
Externally published	Yes
Event	8th International Workshop on Discrete Event Systems, WODES 2006 - Ann Arbor, MI, United States Duration: 10 Jul 2006 → 12 Jul 2006

Conference

Conference	8th International Workshop on Discrete Event Systems, WODES 2006
Country/Territory	United States
City	Ann Arbor, MI
Period	10/07/06 → 12/07/06

ASJC Scopus subject areas

General Computer Science
Control and Systems Engineering

Cite this

@inproceedings{fa752cba07a6483d8a866ccff0644961,

title = "Asymptotic optimality of the max-min fair allocation",

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.",

author = "Hengqing Ye and Yao, \{David D.\}",

year = "2006",

month = dec,

day = "1",

language = "English",

isbn = "1424400538",

pages = "352--357",

booktitle = "Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006",

note = "8th International Workshop on Discrete Event Systems, WODES 2006 ; Conference date: 10-07-2006 Through 12-07-2006",

}

TY - GEN

T1 - Asymptotic optimality of the max-min fair allocation

AU - Ye, Hengqing

AU - Yao, David D.

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/34250664937

M3 - Conference article published in proceeding or book

SN - 1424400538

SN - 9781424400539

SP - 352

EP - 357

BT - Proceedings - Eighth International Workshop on Discrete Event Systems, WODES 2006

T2 - 8th International Workshop on Discrete Event Systems, WODES 2006

Y2 - 10 July 2006 through 12 July 2006

ER -

Asymptotic optimality of the max-min fair allocation

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this