Principles of Fairness Quantification in Queueing Systems
Queues serve as a major scheduling device in computer networks, both at the network level and at the application level. A fundamental and important property of a queue service discipline is its fairness. Recent empirical studies show fairness in queues to be highly important to queueing customers in practical scenarios. The objective of this tutorial is to discuss the issue of queue fairness and its dilemmas, and to review the research conducted on this subject. We discuss the fundamental principles related to queue fairness in the perspective of the relevant applications, with some emphasis on computer communications networks. This is conducted in the context of the recent research in this area and the queueing related fairness measures which have been proposed in recent years. We describe, discuss and compare their properties, and evaluate their relevance to the various practical applications.
Unable to display preview. Download preview PDF.
- 3.Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: Investigating unfairness. In: Proceedings of ACM Sigmetrics 2001 Conference on Measurement and Modeling of Computer Systems, pp. 279–290 (2001)Google Scholar
- 4.Bender, M., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 270–279 (1998)Google Scholar
- 5.Bennet, J.C.R., Zhang, H.: WF2Q: Worst-case fair weighted fair queueing. In: Proceedings of IEEE INFOCOM 1996, San Francisco, March 1996, pp. 120–128 (1996)Google Scholar
- 9.Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. Internetworking Research and Experience 1, 3–26 (1990)Google Scholar
- 10.Golestani, S.J.: A self-clocked fair queueing scheme for broadband application. In: Proceedings of IEEE INFOCOM 1994, Toronto, Canada, June 1994, pp. 636–646 (1994)Google Scholar
- 16.Keshav, S.: An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. Addison Wesley Professional, Reading (1997)Google Scholar
- 22.Palm, C.: Methods of judging the annoyance caused by congestion. Tele (English Ed.) 2, 1–20 (1953)Google Scholar
- 23.Parekh, A.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks. Ph.D. thesis, MIT (February 1992)Google Scholar
- 27.Rafaeli, A., Kedmi, E., Vashdi, D., Barron, G.: Queues and fairness: A multiple study experimental investigation. Tech. rep., Faculty of Industrial Engineering and Management, Technion. Haifa, Israel (2003) (under review), http://iew3.technion.ac.il/Home/Users/anatr/JAP-Fairness-Submission.pdf
- 28.Raz, D., Levy, H., Avi-Itzhak, B.: A resource-allocation queueing fairness measure. In: Proceedings of Sigmetrics 2004/Performance 2004 Joint Conference on Measurement and Modeling of Computer Systems, New York, NY, June 2004, pp. 130–141 (2004); Performance Evaluation Review, 32(1), 130–141Google Scholar
- 29.Rexford, J., Greenberg, A., Bonomi, F.: Hardware-efficient fair queueing architectures for high-speed networks. In: Proceedings of IEEE INFOCOM 1996, March 1996, pp. 638–646 (1996)Google Scholar
- 33.Wierman, A., Harchol-Balter, M.: Classifying scheduling policies with respect to unfairness in an M/GI/1. In: Proceedings of ACM Sigmetrics 2003 Conference on Measurement and Modeling of Computer Systems, San Diego, CA, June 2003, pp. 238–249 (2003)Google Scholar