HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES

We study the steady-state queue-length vector in a multi-class single-server queue with relative priorities. Upon service completion, the probability that the next customer to be served is from class k is controlled by class- dependent weights. Once a customer has started service, it is served without interruption until completion. This is a generalization of the random-order-of-service discipline. We investigate the system in a heavy-traffic regime. We first establish a state-space collapse for the scaled queue length vector, that is, in the limit the scaled queue length vector is distributed as the product of an exponentially distributed random variable and a deterministic vector. As a direct consequence, we obtain that the scaled number of customers in the system reduces as classes with smaller mean service requirement obtain relatively larger weights. We then show that the scaled waiting time of a class-k customer is distributed as the product of two exponentially distributed random variables. This allows us to determine the value of the weights that minimize the m-th moment of the scaled waiting time for a customer of arbitrary class. We simulate a system with two different classes of customers in order to numerically verify some of the analytical results.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[2]  Anindo Banerjea,et al.  Queueing delays in rate controlled ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[3]  J. Dai,et al.  Heavy Traffic Limits for Some Queueing Networks , 2001 .

[4]  Sem C. Borst,et al.  The equivalence between processor sharing and service in random order , 2003, Oper. Res. Lett..

[5]  S. Asmussen,et al.  Applied Probability and Queues , 1989 .

[6]  Urtzi Ayesta,et al.  Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing , 2009, Oper. Res..

[7]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[8]  Jeongsim Kim.  QUEUE LENGTH DISTRIBUTION IN A QUEUE WITH RELATIVE PRIORITIES , 2009 .

[9]  J. F. C. Kingman,et al.  On queues in which customers are served in random order , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[10]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[11]  John Frank Charles Kingman,et al.  The single server queue in heavy traffic , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  Ruth J. Williams,et al.  Correlation resonance generated by coupled enzymatic processing. , 2010, Biophysical journal.

[13]  Urtzi Ayesta,et al.  Heavy traffic analysis of the discriminatory randomorderofservice discipline , 2011, PERV.

[14]  Moshe Haviv,et al.  Waiting times in queues with relative priorities , 2007, Oper. Res. Lett..

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

[16]  Bert Zwart.  Heavy-traffic asymptotics for the single-server queue with random order of service , 2005, Oper. Res. Lett..

[17]  Bara Kim,et al.  Analysis of the M/G/1 queue with discriminatory random order service policy , 2011, Perform. Evaluation.

[18]  J. F. C. Kingman,et al.  Queue Disciplines in Heavy Traffic , 1982, Math. Oper. Res..

[19]  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.

[20]  Dee Denteneer,et al.  Some Models for Contention Resolution in Cable Networks , 2002, NETWORKING.

[21]  R. Núñez Queija,et al.  Waiting Time Asymptotics in the Single Server Queue with Service in Random Order , 2004, Queueing Syst. Theory Appl..