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

Document Type

Article

Publication Date

12-15-2006

Publication Title

Applied Mathematics and Computation

Abstract

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.

Volume

183

Issue

2

First Page

1399

Last Page

1409

DOI

10.1016/j.amc.2006.05.140

ISSN

0096-3003

Rights

© 2006 Elsevier Inc. All rights reserved

Share

COinS