Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-08T09:13:01.469Z Has data issue: false hasContentIssue false
  • English
  • Français

On the steady-state solution of the M/G/2 queue

Published online by Cambridge University Press:  01 July 2016

Per Hokstad
Per Hokstad*
Affiliation:
University of Trondheim
*
∗ Postal address; Institutt for Matematisk Stanistikk, Norges Tekniske H⊘gskole, Universitetet i Trondheim, 7034 Trondheim-NTH, Norway.
Get access Rights & Permissions [Opens in a new window]

Abstract

The asymptotic behaviour of the M/G/2 queue is studied. The difference-differential equations for the joint distribution of the number of customers present and of the remaining holding times for services in progress were obtained in Hokstad (1978a) (for M/G/m). In the present paper it is found that the general solution of these equations involves an arbitrary function.

In order to decide which of the possible solutions is the answer to the queueing problem one has to consider the singularities of the Laplace transforms involved. When the service time has a rational Laplace transform, a method of obtaining the queue length distribution is outlined. For a couple of examples the explicit form of the generating function of the queue length is obtained.

Keywords

M/G/2 QUEUEQUEUE LENGTH

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 11 , Issue 1 , March 1979 , pp. 240 - 255
Copyright
Copyright © Applied Probability Trust 1979 

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

Cox, D. R. (1955) A use of complex probabilities in the theory of stochastic processes. Proc. Camb. Phil. Soc. 51, 313–319.Google Scholar
De Smit, J. H. A. (1973) Some general results for many server queues. Adv. Appl. Prob. 5, 153–169.CrossRefGoogle Scholar
Feller, W. (1971) An Introduction to Probability Theory and its Applications, Vol. 2. Wiley, New York.Google Scholar
Gnedenko, B. V. and Kovalenko, I. N. (1968) Introduction to Queueing Theory. Israel Program for Scientific Translations, Jerusalem.Google Scholar
Haji, R. and Newell, G. F. (1971) A relation between stationary queue and waiting time distributions. J. Appl. Prob. 8, 617–620.Google Scholar
Heffer, J. C. (1969) Steady-state solution of the M/E k /c (∞, fifo) queueing system. INFOR 7, 16–30.Google Scholar
Henderson, W. (1972) Alternative approaches to the analysis of the M/G/1 and G/M/1 queues. J. Opns Res. Soc. Japan 15, 92–101.Google Scholar
Hillier, F. S. and Lo, F. D. (1971) Tables for multiple-server queueing systems involving Erlang distributions. Technical Report No. 31, Dept. of Opns Res., Stanford University.Google Scholar
Hokstad, P. (1977) Asymptotic behaviour of the E k /G/1 queue with finite waiting room. J. Appl. Prob. 14, 358–366.CrossRefGoogle Scholar
Hokstad, P. (1978a) Approximations for the M/G/m queue. Opns Res. 26, 510–523.Google Scholar
Hokstad, P. (1978b) A M/G/1 priority queue. INFOR 16, 158–170.Google Scholar
Kleinrock, L. (1975) Queueing Systems, Vol. 1: Theory. Wiley, New York.Google Scholar
Mayhugh, J. O. and McCormick, R. E. (1968) Steady state solution of the queue M/E k /r . Management Sci. 14, 692–712.Google Scholar
Palm, C. (1937) Inhomogenous telephone traffic in full availability groups. Ericsson Technics 5, 3–38.Google Scholar
Pollaczek, F. (1961) Théorie analytique des problèmes stochastiques relatifs à un groupe de lignes téléphoniques avec dispositif d'attente. Gautier-Villars, Paris.Google Scholar
Schassberger, R. (1970) On the waiting time in the queueing system G/G/1. Ann. Math. Statist. 41, 182–187.Google Scholar
Shapiro, S. (1966) The M-server queue with Poisson input and gamma-distributed service of order two. Opns Res. 14, 685–694.Google Scholar
Syski, R. (1960) Introduction to Congestion Theory in Telephone Systems. Oliver and Boyd, London.Google Scholar