Abstract
This paper investigates the asymptotic behaviour of the loss probability of theM / G/1/K and G/M/1/K queues as the buffer size increases. It is shown that the loss probability approaches its limiting value, which depends on the offered load, with an exponential decay in essentially all cases. The value of the decay rate can be easily computed from the main queue parameters. Moreover, the close relation existing between the loss behaviour of the two examined queueing systems is highlighted and a duality concept is introduced. Finally some numerical examples are given to illustrate on the usefulness of the asymptotic approximation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Baiocchi, Asymptotic behaviour of the loss probability of theM / G/1/K and G/M/1/K queues, Internal Report #6/002/90, Department INFOCOM, University “La Sapienza” of Roma, Roma, Italy (1990).
D. Gross and C.M. Harris,Fundamentals of Queueing Theory (Wiley, New York, 1985).
L. Kleinrock,Queueing Systems, vol. 1: Theory (Wiley, New York, 1975).
J.R. Louvion, P. Boyer and A. Gravey, A discrete-time single server queue with Bernoulli arrivals and constant service time,12th Int. Teletraffic Congress, Torino, Italy (June 1–8, 1988).
M.F. Neuts,Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baiocchi, A. Asymptotic behaviour of the loss probability of theM/G/1/K andG/M/1/K queues. Queueing Syst 10, 235–247 (1992). https://doi.org/10.1007/BF01159208
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01159208