A retrial BMAP/PH/N system
Retrial queueing models are characterized by the fact that the arrival calls, which find the servers busy, do not line up or leave the system forever, but they try their luck after some random time. In this paper the authors consider a multi-server retrial queueing model with batch Markovian arrival process and phase-type service distribution. This model is suitable for the analysis and optimization of mobile computer communication networks. The continuous-time multi-dimensional Markov chain describing the behavior of the system is investigated by means of reducing it to the corresponding discrete-time multi-dimensional Markov chain.
asymptotically quasi-Toeplitz Markov chain
scientific article; zbMATH DE number 1746326