Priority tandem queueing model with admission control

A two-stage multi-server tandem queue with two types of processed customers is analyzed. The input is described by the Marked Markovian Arrival Process (MMAP). The first stage has an infinite number of servers while the second stage has a finite number of servers. The service time at the both stages has an exponential distribution. Priority customers are always admitted to the system. Non-priority customers are admitted to the system only if the number of busy servers at the second stage does not exceed some pre-assigned threshold. Queueing system's behavior is described in terms of the multi-dimensional asymptotically quasi-Toeplitz continuous time Markov chain. It allows to exploit a numerically stable algorithm for calculation of the stationary distribution of the queueing system. The loss probability at the both stages of the tandem is computed. An economic criterion of the system operation is optimized with respect to the threshold. The effect of control on the main performance measures of the system is numerically demonstrated.

[1]  Srinivas R. Chakravarthy.  The Batch Markovian Arrival Process: A Review and Future Work , 2001 .

[2]  Jacques Resing,et al.  A tandem queueing model with coupled processors , 2003, Oper. Res. Lett..

[3]  John A. Buzacott,et al.  A two-stage tandem queue attended by a moving server with holding and switching costs , 1997, Queueing Syst. Theory Appl..

[4]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[5]  Mark E. Lewis,et al.  OPTIMAL CONTROL OF A TWO-STAGE TANDEM QUEUING SYSTEM WITH FLEXIBLE SERVERS , 2002 .

[6]  Johan van Leeuwaarden,et al.  A Tandem Queue with Coupled Processors: Computational Issues , 2004 .

[7]  Antonio Gómez-Corral,et al.  Sojourn times in a two‐stage queueing network with blocking , 2004 .

[8]  WINFRIED K. GRASSMANN,et al.  A Tandem Queuewith a Movable Server: An Eigenvalue Approach , 2002, SIAM J. Matrix Anal. Appl..

[9]  Paola Inverardi,et al.  A review on queueing network models with finite capacity queues for software architectures performance prediction , 2003, Perform. Evaluation.

[10]  Alexander Graham,et al.  Kronecker Products and Matrix Calculus: With Applications , 1981 .

[11]  Antonio Gómez-Corral,et al.  A Tandem Queue with Blocking and Markovian Arrival Process , 2002, Queueing Syst. Theory Appl..

[12]  Qi-Ming He,et al.  Queues with marked customers , 1996, Advances in Applied Probability.

[13]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[14]  Alexander N. Dudin,et al.  A Two-Phase BMAP|G|1|N → PH|1|M – 1 System with Blocking , 2004 .

[15]  Lasse Leskelä,et al.  A Tandem Queueing Network with Feedback Admission Control , 2007, NET-COOP.

[16]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[17]  Antonio Gómez-Corral,et al.  A matrix-geometric approximation for tandem queues with blocking and repeated attempts , 2002, Oper. Res. Lett..

[18]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[19]  Alexander N. Dudin,et al.  The BMAP/G/1/N -> ./PH/1/M tandem queue with losses , 2005, Perform. Evaluation.

[20]  Harry G. Perros,et al.  A Bibliography of Papers on Queueing Networks with Finite Capacity Queues , 1989, Perform. Evaluation.

[21]  Alexander N. Dudin,et al.  Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory , 2006, Queueing Syst. Theory Appl..

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

[23]  A. Gómez-Corral,et al.  On a tandem G-network with blocking , 2002, Advances in Applied Probability.

[24]  Che Soong Kim,et al.  The BMAP/G/1 -> ./PH/1/M tandem queue with feedback and losses , 2007, Perform. Evaluation.