Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-27T08:56:11.406Z Has data issue: false hasContentIssue false
  • English
  • Français

The Loss Probability in Finite-Buffer Queues with Batch Arrivals and Complete Rejection

Published online by Cambridge University Press:  27 July 2009

Frank N. Gouweleeuw
Frank N. Gouweleeuw
Affiliation:
Department of Econometrics, Vrije Universiteit, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

This note extends a recently proposed approximation for the loss probability to the batch-arrival Finite-buffer queues with complete rejection. Also, a condition is stated under which the approximation is exact.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 8 , Issue 2 , April 1994 , pp. 221 - 227
Copyright
Copyright © Cambridge University Press 1994

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.Manfield, D.R. & Tran-Gia, P. (1982). Analysis of a finite storage system with batch input arising out of message packetization. IEEE Transactions on Communications 30(3): 456–463.CrossRefGoogle Scholar
2.Miyazawa, M. & Tijms, H.C. (1993). Comparison of two approximations for the loss probability in finite-buffer queues. Probability in the Engineering and Informational Sciences 7: 19–27.Google Scholar
3.Nobel, R.D. (1989). Practical approximations for finite-buffer queueing models with batch arrivals. European Journal of Operational Research 38: 44–55.CrossRefGoogle Scholar
4.Tijms, H.C. (1986). Stochastic modeling and analysis: A computational approach. New York: Wiley.Google Scholar
5.Tijms, H.C. (1992). Heuristics for finite-buffer queues. Probability in the Engineering and Informational Sciences 6: 227–285.CrossRefGoogle Scholar