Article contents
A modified erlang approach to approximating GI/G/1 queues*
Published online by Cambridge University Press: 14 July 2016
Abstract
This paper presents a modification to the traditional technique of approximating general queueing problems by the Erlang distributions. It presents both theory and the results of some numerical testing.
Keywords
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1976
References
[1]
Gross, D. (1975) Sensitivity of queueing models to the assumption of exponentiality.
Naval Res. Logist. Quart.
22, 271–287.Google Scholar
[2]
Gross, D. and Harris, C. M. (1974)
Fundamentals of Queueing Theory.
Wiley, New York.Google Scholar
[3]
Hillier, F. S. and Lo, F. D. (1972) Tables for multiple-server queueing systems involving Erlang distributions. Technical Report No. 149. Department of Operations Research and Statistics, Stanford University.Google Scholar
[4]
Kendall, D. G. (1964) Some recent work and further problems in the theory of queues.
Theor. Prob. Appl.
9, 1–13.CrossRefGoogle Scholar
[5]
Kingman, J. F. C. (1962) Some inequalities for the queue GI/G/1.
Biometrika
49, 315–324.Google Scholar
[6]
Kotiah, T. C. T. et al. (1969) Use of Erlangian distributions for single-server queueing systems.
J. Appl. Prob.
6, 584–593.Google Scholar
[7]
Marchal, W. G. (1974) Some simple bounds and approximations in queueing. D. Sc. Dissertation. School of Engineering and Applied Science, The George Washington University, Washington, D. C.
Google Scholar
[9]
Smith, W. L. (1953) On the distribution of queueing times.
Proc. Camb. Phil. Soc.
49, 449–461.Google Scholar
- 10
- Cited by