The use of relative priorities in optimizing the performance of a queueing system

Relative priorities in an n-class queueing system can reduce server and customer costs. This property is demonstrated in a single server Markovian model where the goal is to minimize a non-linear cost function of class expected waiting times. Special attention is given to minimizing server's costs when the expected waiting time of each class is restricted.

[1]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[2]  Awi Federgruen,et al.  Competition in Service Industries with Segmented Markets , 2006, Manag. Sci..

[3]  Haim Mendelson,et al.  Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue , 1990, Oper. Res..

[4]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[5]  Refael Hassin,et al.  To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[6]  Arie Tamir,et al.  Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games , 1984, Math. Program..

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Awi Federgruen,et al.  Competition in Service Industries , 2005, Oper. Res..

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

[10]  László Lovász,et al.  Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers , 1984, STOC '84.

[11]  Isi Mitrani,et al.  Complete parameterized families of job scheduling strategies , 2004, Acta Informatica.

[12]  Eitan Altman,et al.  DPS queues with stationary ergodic service times and the performance of TCP in overload , 2004, IEEE INFOCOM 2004.

[13]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[14]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[15]  N. S. Barnett,et al.  Private communication , 1969 .

[16]  Bela Martos,et al.  Nonlinear programming theory and methods , 1977 .

[17]  Edward G. Coffman,et al.  A Characterization of Waiting Time Performance Realizable by Single-Server Queues , 1980, Oper. Res..

[18]  Awi Federgruen,et al.  Characterization and Optimization of Achievable Performance in General Queueing Systems , 1988, Oper. Res..

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

[20]  van der J Jan Wal,et al.  Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities , 1997, Probability in the Engineering and Informational Sciences.

[21]  Refael Hassin,et al.  Who should be given priority in a queue? , 2006, Oper. Res. Lett..

[22]  Richard Stong,et al.  Fair Queuing and Other Probabilistic Allocation Methods , 2002, Math. Oper. Res..

[23]  Kiran M. Rege,et al.  A decomposition theorem and related results for the discriminatory processor sharing queue , 1994, Queueing Syst. Theory Appl..

[24]  Isi Mitrani,et al.  Sharing a Processor Among Many Job Classes , 1980, JACM.