The mathematical model We consider tandem queue which consists of two stages. The rest of the paper is organized as follows. Since the BMAP was introduced in, it is thought to be a fairly general process taking into account the correlation and group arrivals. We deal with a tandem queue under the assumption that customers arrive according to the BMAP. In particular, the arrival process should be able to capture correlation and burstness since real traffic of modern communication networks exhibits these characteristics. Tandem queues can be used for modeling real-life two-node networks as well as for validation of general networks decomposition algorithms. Introduction Queuing networks are widely used in capacity planning and performance evaluation of computer and communication systems, service centers, manufacturing systems, etc. Keywords: queueing system, distribution, Marcov chain, model, queue. The main performance measures are calculated. We derive the condition for the stable operation of the system and determine the stationary distribution of the system states at embedded epochs and at arbitrary time. The waiting period is accompanied by blocking of the first stage server operating. If a customer does not see the required number of free servers it leaves the system forever or waits the releasing of servers. The service at the second stage requires a random number of servers. After receiving service at the first stage a customer proceeds to the second stage. The input flow is described by the BMAP (Batch Markovian Arrival Process).

A TANDEM QUEUING SYSTEM WITH BLOCKING AND LOSSES Emilija Kamceva, Oliver Iliev Fon University, FON, FIROM(Macedonia),, Abstract We consider a tandem queuing system BMAP/G/1   M/N/0.

Panduan ilmu tajwid bergambar pdf