The BMAP/G/1/N -> ./PH/1/M tandem queue with losses

Tandem queues of the BMAP/G/1/[email protected]?->@?/PH/1/M type are good models for different fragments of communication systems and networks, so their investigation is interesting for theory and applications. These queues may play an important role for the validation of different decomposition algorithms designed for investigating more general queueing networks. Exact analytic analysis of this kind of queues for the cases of infinite and finite input buffers is implemented. Possible correlation and group arrivals are taken into account by means of considering the Batch Markovian Arrival Process (BMAP) as input stream to the system. The Markov chain embedded at service completion epochs at the first service stage and the process of system states at arbitrary time are investigated. Loss probabilities at the first and second stages are calculated. Numerical results are presented to demonstrate the feasibility of the presented algorithms and describe the performance of the queueing model under study. The necessity of taking the input correlation into account is illustrated.

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

[2]  Christoph Lindemann,et al.  Modeling IP traffic using the batch Markovian arrival process , 2003, Perform. Evaluation.

[3]  Valentina Klimenok,et al.  Multi-dimensional quasitoeplitz Markov chains , 1999 .

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

[5]  Erhan Çinlar,et al.  Introduction to stochastic processes , 1974 .

[6]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

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

[8]  Armin Heindl,et al.  Decomposition of general queueing networks with MMPP inputs and customer losses , 2003, Perform. Evaluation.

[9]  Simon J. Godsill,et al.  Probability Theory and Random Processes , 1998 .

[10]  Shigeo Shioda.  Departure Process of the MAP/SM/1 Queue , 2003, Queueing Syst. Theory Appl..

[11]  M. Neuts.  A Versatile Markovian Point Process , 1979 .

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

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

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

[15]  Alexander N. Dudin,et al.  A Retrial BMAP/PH/N System , 2002, Queueing Syst. Theory Appl..

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

[17]  Jin-Fu Chang,et al.  Departure Processes of BMAP/G/1 Queues , 2001, Queueing Syst. Theory Appl..

[18]  Jin-Fu Chang,et al.  Connection-wise end-to-end performance analysis of queueing networks with MMPP inputs , 2001, Perform. Evaluation.

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

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