arXiv Analytics

Sign in

arXiv:math/0505127 [math.PR]AbstractReferencesReviewsResources

Asymptotic Analysis of Losses in the $GI/M/m/n$ Queueing System as $n$ Increases to Infinity

Vyacheslav M. Abramov

Published 2005-05-09, updated 2008-05-12Version 5

The paper studies asymptotic behavior of the loss probability for the $GI/M/m/n$ queueing system as $n$ increases to infinity. The approach of the paper is based on applications of classic results of Tak\'acs (1967) and the Tauberian theorem with remainder of Postnikov (1979-1980) associated with the recurrence relation of convolution type. The main result of the paper is associated with asymptotic behavior of the loss probability. Specifically it is shown that in some cases (precisely described in the paper) where the load of the system approaches 1 from the left and $n$ increases to infinity, the loss probability of the $GI/M/m/n$ queue becomes asymptotically independent of the parameter $m$.

Comments: 23 pages, 12pt, 1 table, to apear in "Quality Technology and Quantitative Management"
Journal: Quality Technology and Quantitative Management, 4 (2007), 379-393
Categories: math.PR
Subjects: 60K25, 40E05
Related articles: Most relevant | Search more
arXiv:math/0505597 [math.PR] (Published 2005-05-27)
Asymptotic analysis of the GI/M/1/n loss system as n increases to infinity
arXiv:math/0503518 [math.PR] (Published 2005-03-24)
A diffusion model of scheduling control in queueing systems with many servers
arXiv:math/0506227 [math.PR] (Published 2005-06-13, updated 2008-06-21)
Continuity theorems for the $M/M/1/n$ queueing system