Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-27T18:32:45.503Z Has data issue: false hasContentIssue false
  • English
  • Français

Comparison of Two Approximations for the Loss Probability in Finite-Buffer Queues

Published online by Cambridge University Press:  27 July 2009

Masakiyo Miyazawa  and
Henk Tijms
Masakiyo Miyazawa
Affiliation:
Department of Information Sciences, Science University of Tokyo, Noda City, Chiba 278, Japan
Henk Tijms
Affiliation:
Department of Econometrics, Vrije University, 1081 HV Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper deals with two related approximations that were recently proposed for the loss probability in finite-buffer queues. The purpose of the paper is twofold: first, to provide better insight and more theoretical support for both approximations, and second, to show by an experimental study how well both approximations perform. An interesting empirical finding is that in many cases of practical interest the two approximations provide upper and lower bounds on the exact value of the loss probability.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 7 , Issue 1 , January 1993 , pp. 19 - 27
Copyright
Copyright © Cambridge University Press 1993

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.Miyazawa, M. (1989). Comparison of the loss probability of the GIx /GI/l/k queues with a common traffic intensity. Journal of the Operations Research Society of Japan 32: 505–516.Google Scholar
2.Miyazawa, M. & Shanthikumar, J.G. (1991). Monotonicity of the loss probabilities of single server finite queues with respect to convex order of arrival or service processes. Probability in the Engineering and Informational Sciences 5: 43–52.CrossRefGoogle Scholar
3.Sakasegawa, H., Miyazawa, M., & Yamazaki, G. (1993). Evaluating the overflow probability using the infinite queue. Management Science (to appear).CrossRefGoogle Scholar
4.Stoyan, D. (1983). Comparison methods for queues and other stochastic models. Edited with revision by Daley, D.J.. New York: John Wiley & Sons.Google Scholar
5.Tijms, H.C. (1992). Heuristics for finite-buffer queues. Probability in the Engineering and Informational Sciences 6: 277–285.CrossRefGoogle Scholar