Hostname: page-component-89b8bd64d-r6c6k Total loading time: 0 Render date: 2026-05-06T16:07:51.321Z Has data issue: false hasContentIssue false
  • English
  • Français

Waiting-Time Percentiles in the Multi-server Mx/G/c Queue with Batch Arrivals

Published online by Cambridge University Press:  27 July 2009

A. M. Eikeboom  and
H. C. Tijms
A. M. Eikeboom
Affiliation:
Department of Actuarial Sciences and EconometricsVrije Universiteit Amsterdam, The Netherlands
H. C. Tijms
Affiliation:
Department of Actuarial Sciences and EconometricsVrije Universiteit Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper deals with the MX/G/c queue. Using analytical results for the special cases of the MX/M/c queue and the MX/D/c queue, a two-moment approximation is proposed for the waiting-time percentiles in the general case. This approximation is based on a linear interpolation with respect to the squared coefficient of variation of the service time distribution. Validation experiments indicate that this approximation performs quite well for practical purposes. In particular, the practically important percentiles in the tail of the waiting-time distribution are approximated extremely well.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 1 , Issue 1 , January 1987 , pp. 75 - 96
Copyright
Copyright © Cambridge University Press 1987

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

Baba, Y. (1983). An algorithmic solution to the M/PH/c queue with batch arrivals. J. Oper. Res. Jpn, 26: 33–50.Google Scholar
Burke, P. J. (1975). Delays in single-server queues with batch input. Oper. Res. 23: 830–833.CrossRefGoogle Scholar
Cosmetatos, G. P. (1978). Some practical considerations on multi-server queues with multiple Poisson arrivals. Omega 6: 443–448.CrossRefGoogle Scholar
Cromie, M. V., Chaudry, M. L., and Grassmann, W. K. (1979). Further results for the queueing system Mx/M/c. J. Oper. Res. Soc. 40: 755–763.Google Scholar
Crommelin, C. D. (1932). Delay probability formulae when the holding times are constant. P.O. Elect. Engr. J. 25: 41–50.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. I, 3rd Ed., Wiley, New York.Google Scholar
Kimura, K. and Ohsone, T. (1984). A diffusion approximation for an M/G/m queue with group arrivals, Management Sci. 30: 381–388.CrossRefGoogle Scholar
Kuczura, A. (1973). Batch input to a multi-server queue with constant service times. Bell System Techn. J. 52: 83–99.CrossRefGoogle Scholar
Seelen, L. P. (1986). An algorithm for PH/PH/c queues. European J. Oper. Res. 23: 118–127.CrossRefGoogle Scholar
Tijms, H. C. (1986). Stochastic Modelling and Analysis: A Computational Approach, Wiley, Chichester.Google Scholar
Wolff, R. W. (1977). The effect of service time regularity on system performance. In Computer Performance (Eds. Chandy, K. M. and Reiser, M.), North-Holland, 297–304.Google Scholar
Wolff, R. W. (1982). Poisson arrivals see time averages. Oper. Res. 30: 223–231.CrossRefGoogle Scholar