On the relationship between absolute and relative fairness bounds (2002) [8 citations — 3 self]
Abstract:
Abstract—The fairness of scheduling disciplines used in communication networks has frequently been evaluated using one of two fairness measures: the absolute fairness bound (AFB) and the relative fairness bound (RFB). In this letter, we present a tight bounded relationship between these measures of fairness. The bounds established in this letter are exactly reached in the case of many real scheduling disciplines, thus leading to an easy conversion between these two measures. In the case of latency-rate ( ) servers, this also leads to an easy determination of the upper bound on the latency of a flow from the more tractable relative fairness bound of the scheduler. Our results also indicate that in many real contexts, the two measures of fairness approach each other as the number of flows increases, confirming the RFB as an adequate measure of fairness. Index Terms—Absolute fairness bound, GPS, relative fairness bound. I.
Citations
| 1409 | A generalized processor sharing approach to flow control in integrated services network – Parekh - 1992 |
| 939 | Analysis and Simulation of a Fair Queueing Algorithm – Demers, Keshav, et al. - 1989 |
| 327 | A self-clocked fair queueing scheme for broadband application – Golestani - 1994 |
| 251 | An Engineering Approach to Computer Networking – Keshav - 1997 |
| 224 | WF2Q: Worst-case fair weighted fair queueing – Bennett, Zhang - 1996 |
| 210 | Efficient Fair Queueing Using Deficit Round Robin – Shreedhar, Varghese - 1995 |
| 153 | Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks – Goyal, Vin, et al. - 1997 |
| 123 | Latency-rate servers: a general model for analysis of traffic scheduling algorithms – Stiliadis, Varma - 1998 |
| 36 | How fair is fair queuing – Greenberg, Madras - 1992 |
| 4 | and efficient packet scheduling in wormhole networks – Kanhere, Parekh, et al. - 2000 |
