A tandem retrial queueing system with two Markovian flows and reservation of channels

We consider a tandem queueing system with single-server first station and multi-server second station. The input flow at Station 1 is described by the BMAP (batch Markovian arrival process). Customers from this flow are considered as non-priority customers. Customers of an arriving group, which meet a busy server, go to the orbit of infinite size. From the orbit, they try their luck in exponentially distributed random time. Service times at Station 1 are independent identically distributed random variables having an arbitrary distribution. After service at Station 1 a non-priority customer proceeds to Station 2. The service time by a server of Station 2 is exponentially distributed. Besides customers proceeding from Station 1, an additional MAP flow of priority customers arrives at Station 2 directly, not entering Station 1. If a priority customer meets a free server upon arrival, it starts service immediately. Else, it leaves the system forever. It is assumed that a few servers of Station 2 are reserved to serve the priority customers only. We calculate the stationary distribution and the main performance measures of the system. The problem of optimal design is numerically investigated.

[1]  Antonio Gómez-Corral,et al.  A bibliographical guide to the analysis of retrial queues through matrix analytic techniques , 2006, Ann. Oper. Res..

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

[3]  V. Ramaswami.  The N/G/1 queue and its detailed analysis , 1980, Advances in Applied Probability.

[4]  Antonio Gómez-Corral,et al.  Performance of two-stage tandem queues with blocking: The impact of several flows of signals , 2006, Perform. Evaluation.

[5]  Christos Langaris,et al.  TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERS , 2001 .

[6]  Armin Heindl.  Decomposition of general tandem queueing networks with MMPP input , 2001, Perform. Evaluation.

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

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

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

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

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

[12]  Adhir K Basu,et al.  Introduction to Stochastic Process , 2002 .

[13]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

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

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

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

[17]  Jesús R. Artalejo,et al.  Retrial Queueing Systems: A Computational Approach , 2008 .

[18]  V. Ramaswami,et al.  Advances in Probability Theory and Stochastic Processes , 2001 .