The BMAP/G/1/(N)over-bar→•/PH/1/M tandem queue with losses

Tandem queues of the BMAP/G/1/(N) over bar -> (.)/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. (c) 2004 Elsevier B.V. All rights reserved.