The MAP/PH/1/N queue with flows of customers as a model for traffic control in telecommunication networks
A single-server queueing model with finite buffer and flows of customers is considered. Flow means a group of customers which should be sequentially processed in the system. in contrast to the standard batch arrival when a whole group of customers arrives into the system at one epoch, we assume that the customers of an accepted flow arrive one by one in exponentially distributed times. Service time has Phase type (PH) distribution. Generation of flows is described by the Markov Arrival Process (MAP). A flow consists of a random number of customers. This number is geometrically distributed and is not known at a flow arrival epoch. The number of flows, which can be admitted into the system simultaneously, is subject to control. Accepted flow can be lost, with a given probability, in the case of any customer from this flow rejection. Analysis of the joint distribution of the number of flows and customers in the system. flow loss probability and sojourn time distribution is implemented by means of the matrix technique and method of catastrophes. The effect of control on the main performance measures of the system is demonstrated numerically. The influence of correlation in the arrival process of flows, variation of service time and probability of a flow loss in case of any customer from this flow rejection is illustrated. (C) 2009 Elsevier B.V. All rights reserved.
loss probability markovian arrival process phase type service reactive admission control matrix analytic methods performance modeling