Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-28T10:30:39.681Z Has data issue: false hasContentIssue false
  • English
  • Français

Cell loss probability for M/G/1 and time-slotted queues

Part of: Stochastic processes Special processes Limit theorems

Published online by Cambridge University Press:  14 July 2016

David McDonald  and
François Théberge
David McDonald*
Affiliation:
University of Ottawa
François Théberge*
Affiliation:
University of Ottawa
*
∗ Postal address: Department of Mathematics and Statistics, University of Ottawa, 585 King Edward, Ottawa, Ontario, Canada K1N 6N5.
∗ Postal address: Department of Mathematics and Statistics, University of Ottawa, 585 King Edward, Ottawa, Ontario, Canada K1N 6N5.
Get access Rights & Permissions [Opens in a new window]

Abstract

It is common practice to approximate the cell loss probability (CLP) of cells entering a finite buffer by the overflow probability (OVFL) of a corresponding infinite buffer queue, since the CLP is typically harder to estimate. We obtain exact asymptotic results for CLP and OVFL for time-slotted queues where block arrivals in different time slots are i.i.d. and one cell is served per time slot. In this case the ratio of CLP to OVFL is asymptotically (1-ρ)/ρ, where ρ is the use or, equivalently, the mean arrival rate per time slot. Analogous asymptotic results are obtained for continuous time M/G/1 queues. In this case the ratio of CLP to OVFL is asymptotically 1-ρ.

Keywords

CBRcell loss probabilityM/G/1overflow probability

MSC classification

Primary: 60K25: Queueing theory 60G50: Sums of independent random variables; random walks
Secondary: 60F10: Large deviations
Type
Short Communications
Information
Journal of Applied Probability , Volume 37 , Issue 4 , December 2000 , pp. 1149 - 1156
Copyright
Copyright © by the Applied Probability Trust 2000 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Asmussen, S. (1981). Equilibrium properties of the M/G/1 queue. Z. Wahrscheinlichkeitsth. 58, 267–281.Google Scholar
[2] Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Vol. II. John Wiley, New York.Google Scholar
[3] Grossglauser, M., and Keshav, S. (1996). On CBR service. In Proc. IEEE Infocom '96, San Francisco, USA. IEEE Computer Society Press, Los Alamitos, USA, pp. 129–137.Google Scholar
[4] Guillemin, F., and Roberts, J. W. (1991). Jitter and bandwidth enforcement. In Proc. IEEE Globecom '91. IEEE, New York, pp. 261–265.Google Scholar
[5] Huang, A., and McDonald, D. (1998). Connection admission control for constant bit rate traffic at a multi-buffer multiplexer using oldest-cell-first discipline. Queueing Systems 29, 1–16.Google Scholar
[6] McDonald, D. (1999). Asymptotics of first passage times for random walks in an orthant. Ann. Appl. Prob. 9, 110–145.Google Scholar
[7] Pitts, J. M., and Shormans, J. A. (1996). Introduction to ATM Design and Performance. John Wiley, New York.Google Scholar
[8] Roberts, J., Mocci, U., and Virtamo, J. (eds) (1996). Broadband Network Teletraffic: Final Report of Action Cost 242 (Lecture Notes in Comput. Sci. 1155). Springer, New York, p. 585.Google Scholar