Fair operation of multi-server and multi-queue systems

This work aims at studying the fairness of multi-queue and multi-server queueing systems. We deal with the issues of queue-multiplicity, queue joining policy and queue jockeying and use a quantitative measure (RAQFM) to evaluate them. Our results yield the relative fairness of the mechanisms as a function of the system configuration and parameters. Practitioners can use these results to quantitatively account for system fairness and to weigh efficiency aspects versus fairness aspects in designing and controlling their queueing systems. In particular, we quantitatively demonstrate that: 1) Joining the shortest queue increases fairness, 2) A single "combined" queue system is more fair than "separate" (multi) queue system and 3) Jockeying from the head of a queue is more fair than jockeying from its tail.

[1]  Benjamin Avi-Itzhak,et al.  Classes, Priorities and Fairness in Queueing Systems , 2004 .

[2]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.

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

[4]  Ger Koole,et al.  On the Optimality of the Generalized Shortest Queue Policy , 1990, Probability in the Engineering and Informational Sciences.

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

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

[7]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

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

[9]  W. Whitt,et al.  Resource sharing for efficiency in traffic systems , 1981, The Bell System Technical Journal.

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

[11]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[12]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[13]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..

[14]  Benjamin Avi-Itzhak,et al.  QUANTIFYING FAIRNESS IN QUEUEING SYSTEMS: PRINCIPLES AND APPLICATIONS , 2004 .

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

[16]  B. Avi-Itzhak,et al.  RAQFM : A Resource Allocation Queueing Fairness Measure , 2004 .

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

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

[19]  B. Avi-Itzhak,et al.  Fairness Considerations in Multi-Server and Multi-Queue Systems , 2005 .

[20]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[21]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

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

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