Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-06T10:15:04.919Z Has data issue: false hasContentIssue false
  • English
  • Français

Transient and busy period analysis of the GIG/1 Queue as a Hilbert factorization problem

Published online by Cambridge University Press:  14 July 2016

Dimitris J. Bertsimas ,
Julian Keilson ,
Daisuke Nakazato  and
Hongtao Zhang
Dimitris J. Bertsimas*
Affiliation:
Sloan School of Management, MIT
Julian Keilson*
Affiliation:
Sloan School of Management, MIT
Daisuke Nakazato*
Affiliation:
Operations Research Center, MIT
Hongtao Zhang*
Affiliation:
Operations Research Center, MIT
*
∗ Postal address: Sloan School of Management
∗ Postal address: Sloan School of Management
∗∗ Operations Research Center, MIT, Cambridge, MA 02139, USA.
∗∗ Operations Research Center, MIT, Cambridge, MA 02139, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we find the waiting time distribution in the transient domain and the busy period distribution of the GI G/1 queue. We formulate the problem as a two-dimensional Lindley process and then transform it to a Hilbert factorization problem. We achieve the solution of the factorization problem for the GI/R/1, R/G/1 queues, where R is the class of distributions with rational Laplace transforms. We obtain simple closed-form expressions for the Laplace transforms of the waiting time distribution and the busy period distribution. Furthermore, we find closed-form formulae for the first two moments of the distributions involved.

Keywords

TRANSIENT ANALYSISBUSY PERIODLINDLEY EQUATION
Type
Research Papers
Information
Journal of Applied Probability , Volume 28 , Issue 4 , December 1991 , pp. 873 - 885
Copyright
Copyright © Applied Probability Trust 1991 

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

Footnotes

The research of Dr Bertsimas was partially supported by grants from the Leaders for Manufacturing program at MIT and from Draper Laboratory.

References

[1] Asmussen, S. (1989) Aspects of matrix Wiener-Hopf factorisation in applied probability. Math. Sci. 14, 101–116.Google Scholar
[2] Bertsimas, D. and Nakazato, D. (1989) Transient and busy period analysis of the GI/G/1 queue using the method of stages. QUESTA. To appear.Google Scholar
[3] Grassmann, W. K. (1977) Transient solutions in Markovian queueing systems. Comput. Operat Res. 4, 47–53.10.1016/0305-0548(77)90007-7Google Scholar
[4] Gross, D. and Harris, C. (1985) Fundamentals of Queueing Theory. Wiley, New York.Google Scholar
[5] Jensen, A. (1953) Markoff chains as an aid in the study of Markoff processes. Skand. Aktuarietidskr 36, 87–91.Google Scholar
[6] Keilson, J. (1961) The homogeneous random walk on the half-line and the Hilbert problem. Bull. Inst. Internat. Statist. 33rd Session, Paper 113, 1–13.Google Scholar
[7] Keilson, J. (1962) General bulk queue as a Hilbert problem. J. R. Statist. Soc. 24, 344–358.Google Scholar
[8] Keilson, J. (1969) On the matrix renewal function for Markov renewal process. Ann. Math. Statist. 40, 1901–1907.Google Scholar
[9] Kleinrock, L. (1975) Queueing Systems; Vol. 1: Theory. Wiley, New York.Google Scholar
[10] Lindley, D. (1952) The theory of queues with a single server. Proc. Camb. Phil. Soc. 48, 277–289.10.1017/S0305004100027638Google Scholar
[11] Ramaswami, V. (1982) The busy period of queues which have a matrix-geometric steady state probability vector. Opsearch 19, 238–261.Google Scholar
[12] Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar
[13] Takács, L. (1962) A single-server queue with Poisson input. Operat. Res. 10, 388–397.10.1287/opre.10.3.388Google Scholar