Is max-min fairness achievable in the presence of insubordinate users?
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 120-122 |
Journal / Publication | IEEE Communications Letters |
Volume | 6 |
Issue number | 3 |
Publication status | Published - Mar 2002 |
Link(s)
Abstract
Enforcement of max-rain fairness encourages end users to implement adaptive end-to-end flow control. Unfortunately, there can be insubordinate users who ignore congestion and cause performance degradation to others. The commonly used max-min fairness definition that treats insubordinate users fairly causes inefficiency. We demonstrate that a strict priority regime can protect the cooperative users so that they enjoy fair and efficient service. We also demonstrate that this cannot be achieved by weighted class fairness.
Research Area(s)
- Congestion control, Fairness, Flow control
Citation Format(s)
Is max-min fairness achievable in the presence of insubordinate users? / Chan, Sammy; Zukerman, Moshe.
In: IEEE Communications Letters, Vol. 6, No. 3, 03.2002, p. 120-122.
In: IEEE Communications Letters, Vol. 6, No. 3, 03.2002, p. 120-122.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review