Computation of the steady state distribution for multi-server retrial queues with phase type service process
We consider a multi-server retrial queueing system with the Batch Markovian Arrival Process and phase type service time distribution. Such a general queueing system suits for modeling and decision making in many real life objects including modern wireless communication networks. Behavior of such a system is described by the level dependent multi-dimensional Markov chain. Blocks of the generator of this chain, which is the block structured matrix of infinite size, can have large size if the number of servers is large and distribution of service time is not exponential. Due to this fact, the existing in literature algorithms allow to compute key performance measures of such a system only for a small number of servers. Here we describe the algorithm that allows to compute the stationary distribution of the system for larger number of servers and numerically illustrate its advantage. Importance of taking into account correlation in the arrival process is numerically demonstrated.
performance queues applications queues theory