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.

[1]  Randolph W. Hall,et al.  Queueing Methods: For Services and Manufacturing , 1991 .

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[3]  Benjamin Avi-Itzhak,et al.  A resource-allocation queueing fairness measure , 2004, SIGMETRICS '04/Performance '04.

[4]  Mor Harchol-Balter,et al.  Analysis of SRPT scheduling: investigating unfairness , 2001, SIGMETRICS '01.

[5]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[6]  L. Mann.  Queue Culture: The Waiting Line as a Social System , 1969, American Journal of Sociology.

[7]  Anat Rafaeli,et al.  The Effects of Queue Structure on Attitudes , 2002 .

[8]  Kumar Jayantilal Parekn Abhay,et al.  A generalized processor sharing approach to frow control in integrated services networks , 1992 .

[9]  John N. Daigle,et al.  Queueing Theory for Computer Communications , 1991 .

[10]  B. Avi-Itzhak,et al.  On measuring fairness in queues , 2004, Advances in Applied Probability.

[11]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[12]  Benjamin Avi-Itzhak,et al.  A resource allocation queueing fairness measure: properties and bounds , 2007, Queueing Syst. Theory Appl..

[13]  Yung-Terng Wang,et al.  Load Sharing in Distributed Systems , 1985, IEEE Transactions on Computers.

[14]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[15]  Michael H. Rothkopf,et al.  Perspectives on Queues: Combining Queues is Not Always Beneficial , 1987, Oper. Res..

[16]  Adam Wierman,et al.  Classifying scheduling policies with respect to unfairness in an M/GI/1 , 2003, SIGMETRICS '03.

[17]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  Albert G. Greenberg,et al.  Hardware-efficient fair queueing architectures for high-speed networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[19]  Richard C. Larson,et al.  OR Forum - Perspectives on Queues: Social Justice and the Psychology of Queueing , 1987, Oper. Res..

[20]  J. F. C. Kingman.  The effect of queue discipline on waiting time variance , 1962 .

[21]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[22]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[23]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[24]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[25]  John N. Daigle.  Queueing theory for telecommunications , 1992, Addison-Wesley series in telecommunications.

[26]  Robert B. Cooper,et al.  An Introduction To Queueing Theory , 2016 .

[27]  M. Neuts,et al.  Introduction to Queueing Theory (2nd ed.). , 1983 .

[28]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[29]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[30]  Ward Whitt,et al.  The amount of overtaking in a network of queues , 1984, Networks.

[31]  Alexandre Proutière,et al.  Insensitive Bandwidth Sharing in Data Networks , 2003, Queueing Syst. Theory Appl..

[32]  Harish Sethu,et al.  On the relationship between absolute and relative fairness bounds , 2002, IEEE Communications Letters.