Hostname: page-component-74656f9884-g96k6 Total loading time: 0 Render date: 2026-11-10T10:02:54.755Z Has data issue: false hasContentIssue false
  • English
  • Français

Approximations for the GI/G/c queue

Published online by Cambridge University Press:  14 July 2016

M. H. Van Hoorn  and
L. P. Seelen
M. H. Van Hoorn
Affiliation:
Vrije Universiteit, Amsterdam
L. P. Seelen*
Affiliation:
Vrije Universiteit, Amsterdam
*
∗ Postal address: Vrije Universiteit, Interfaculteit der Actuariële Wetenschappen en Econometrie, Postbus 7161, 1007 MC Amsterdam, The Netherlands.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we give good-quality approximations for multiserver queues with general service-time distributions. For the interarrival-time distribution we consider hyperexponential distributions and mixtures of Erlang distributions with the same scale parameters. We give an algorithm to compute various operating characteristics such as the delay probability and the mean queue length.

The approximations are obtained by making assumptions regarding the residual service times of services in progress at service completion epochs, whereas the arrival process is modelled exactly. As the operating characteristics are far more sensitive to changes in the parameters of the arrival process, the latter is very important.

The quality of the approximations is extensively tested by using the exact results of more than 2000 cases. In heavy traffic the average relative error is up to 1% and in moderate traffic about 4%.

Keywords

MULTISERVER QUEUEDELAY PROBABILITYMEAN QUEUE LENGTH

Information

Type
Research Paper
Information
Journal of Applied Probability , Volume 23 , Issue 2 , June 1986 , pp. 484 - 494
Copyright
Copyright © Applied Probability Trust 1986 

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.)

Article purchase

Temporarily unavailable

References

Boxma, O. J., Cohen, J. W. and Huffels, N. (1980) Approximations of the mean waiting time in an M/G/s queueing system. Operat. Res. 27, 1115–1127.CrossRefGoogle Scholar
Cohen, J. W. (1969) The Single Server Queue. North-Holland, Amsterdam.Google Scholar
Cosmetatos, G. P. (1976) Some approximate equilibrium results for the multiserver queue M/G/r. Operat. Res. Quart. 27, 615–620.Google Scholar
Hokstad, P. (1980) The steady state solution of the M/K2/m queue. Adv. Appl. Prob. 12, 799–823.Google Scholar
Hoorn, M. H. Van (1984a) Algorithms and Approximations for Queueing Systems. CWI Tract 8, CWI (formerly Mathematical Centre), Amsterdam.Google Scholar
Hoorn, M. H. Van (1984b) The numerical analysis of the Ph/D/c queue. Z. Operat. Res. To appear.Google Scholar
Hoorn, M. H. Van and Seelen, L. P. (1983) The SPP/G/1 queue: a single server queue with a switched Poisson process as input process. OR Spektrum 5, 207–218.CrossRefGoogle Scholar
Hoorn, M. H. Van and Seelen, L. P. (1984) Approximations for the GI/G/c queue. Research Report 129, IAWE, Vrije Universiteit, Amsterdam.Google Scholar
Kleinrock, L. (1975) Queueing Systems, Vol. I. Wiley, New York.Google Scholar
Krämer, W. and Langenbach-Belz, M. (1978) Approximate formulae for the delay in the queueing system GI/G/1. Proc. 8th ITC (Melbourne, 1976). Angew. Informatik (1978), 396–402.Google Scholar
Q-Lib, (1984) A program library for multiserver queues, written by van Hoorn, M. H. and Seelen, L. P. IAWE, Vrije Universiteit, Amsterdam.Google Scholar
Seelen, L. P. (1984) An efficient solution method for the Ph/Ph/c queue. European J. Operat. Res. To appear.Google Scholar
Seelen, L. P., Tijms, H. C. and Van Hoorn, M. H. (1984) Tables for Multiserver Queues. North-Holland, Amsterdam.Google Scholar
Smit, J. H. A. De (1983a) The queue GI/M/s with customers of different types or the queue GI/Hm/s. Adv. Appl. Prob. 15, 392–419.Google Scholar
Smit, J. H. A. De (1983b) A numerical solution for the multi-server queue with hyperexponential service times Operat. Res. Letters 2, 217–224.Google Scholar
Stoer, J. and Bulirsch, R. (1980) Introduction to Numerical Analysis. Springer-Verlag, New York.Google Scholar
Takahashi, Y. and Takami, Y. (1976) A numerical method for the steady state probabilities of a GI/G/c queueing system in a general class. J. Operat. Res. Soc. Japan. 19, 147–157.Google Scholar
Tijms, H. C. and Van Hoorn, M. H. (1981) Computational methods for single server and multiserver queues with Markovian input and general service times. In Proceedings of the Special TIMS Meeting on Applied Probability & Computer Science, ed. Disney, R. E., Birkhauser, Boston.Google Scholar
Tijms, H. C., Van Hoorn, M. H. and Federgruen, A. (1981) Approximations for the steady state probabilities in the M/G/c queue. Adv. Appl. Prob. 13, 186–206.Google Scholar