Computational analysis of the maximal queue length in the MAP/M/c retrial queue

作者:

Highlights:

摘要

We consider a multi-server retrial queueing model in which arrivals occur according to a Markovian arrival process. Using continuous-time Markov chain with absorbing states, we determine the distribution of the maximum number of customers in a retrial orbit. Illustrative numerical examples that reveal some interesting results are presented.

论文关键词:Markovian arrival process,Retrial,Busy period,Queueing,Algorithmic probability

论文评审过程:Available online 4 August 2006.

论文官网地址:https://doi.org/10.1016/j.amc.2006.05.140