Asymptotic analysis and simple approximation of the loss probability of the GIX/M/c/K queue

Authors:
Bara Kim;Bong Dae Choi
Affiliations:
Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1, Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea;Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1, Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea
Venue:
Performance Evaluation
Year:
2003

Citing 3
Cited 2

Asymptotic Behavior of Loss Probability in GI/M/1/K Queue as K Tends to Infinity

Queueing Systems: Theory and Applications
Analysis of finite-buffer multi-server queues with group arrivals: GIX/M/c/N

Queueing Systems: Theory and Applications
Exact Convergence Rate for the Distributions of GI/M/c/K Queue as K Tends to Infinity

Queueing Systems: Theory and Applications

Performance analysis of a GI[X]/Geo/m/N queue with partial- and total-batch rejection

Computers & Mathematics with Applications
Estimating the loss probability under heavy traffic conditions

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the GIX/M/c/K queues with partial rejection or total rejection, and find an asymptotic behavior of loss probability of the GIX/M/c/K queue as K tends to infinity. The asymptotic loss probability is expressed only in terms of the roots of the characteristic equation and the boundary probabilities of the corresponding GIX/M/c queue. Numerical examples show that the asymptotic loss probability is a quite accurate approximation for the loss probability of the GIX/M/c/K queue even when the system capacity K is moderate.