Retrial Tandem Queue with BMAP -Input and Semi-Markovian Service Process

We consider a tandem queueing system consisting of two stations. The input flow at the single-server first station is described by a BMAP (batch Markovian arrival process). If a customer from this flow meets the busy server, it goes to the orbit of infinite size and tries its luck later on in exponentially distributed random time. The service time distribution at the first station is assumed to be semi-Markovian. After service at the first station a customer proceeds to the second station which is described by a multi-server queue without a buffer. The service time by the server of the second station is exponentially distributed. We derive the condition for the stable operation of the system and determine the stationary distribution of the system states. Some key performance measures are calculated and illustrative numerical results are presented.

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

[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. I. Klimenok,et al.  Tandem service system with batch Markov flow and repeated calls , 2010 .

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

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

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

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

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

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

[10]  Alexander N. Dudin,et al.  Software Sirius++ for Performance Evaluation of Modern Communication Networks , 2002, ESM.

[11]  Che Soong Kim,et al.  A tandem retrial queueing system with two Markovian flows and reservation of channels , 2010, Comput. Oper. Res..

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

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

[14]  Huei-Wen Ferng,et al.  Path-wise performance in a tree-type network: Per-stream loss probability, delay, and delay variance analyses , 2007, Perform. Evaluation.

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

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

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

[18]  Jesús R. Artalejo,et al.  Retrial Queueing Systems , 2008 .

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