Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-25T09:04:21.001Z Has data issue: false hasContentIssue false
  • English
  • Français

On the busy period in the queueing system GI/G/1

Published online by Cambridge University Press:  09 April 2009

P. D. Finch
P. D. Finch
Affiliation:
University of Melbourne.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A number of authors have studied busy period problems for particular cases of the general single-server queueing system. For example, using the now standard notation of Kendall [7], GI/M/1 was studied by Conolly [3] and Takacs [18]. Earlier work on M/M/1 includes that of Ledermann and Reuter [8] and Bailey [1]. Kendall [6], Takacs [17], and Prabhu [11] have considered M/G/1.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 2 , Issue 2 , October 1961 , pp. 217 - 228
Copyright
Copyright © Australian Mathematical Society 1961

References

[1]Bailey, N. T. J., A continuous time treatment of a simple queue using generating functions. J. R. Statist. Soc. B. 16. (1954) 288–291.Google Scholar
[2]Chung, K. L. and Fuchs, W. H. J., On the distribution of values of sums of random variables. Memoirs of the Amer. Math. Soc. No. 6 (1951).CrossRefGoogle Scholar
[3]Conolly, B. W., The busy period in relation to the queueing system GI/M/1. Biometrika, 46. (1959) 246–251.Google Scholar
[4]Conolly, B. W., The busy period in relation to the single-server queueing system with general independent arrivals and Erlangian service-time. J. R. Statist. Soc. B. 22, (1960) 89–96.Google Scholar
[5]Feller, W., On combinatorial methods in fluctuation theory. Probability and Statistics. Ed. Grenander, U.. J. Wiley and Sons, Inc. (1959) 75–91.Google Scholar
[6]Kendall, D. G., Some problems in the theory of queues. J. R. Statist. Soc. B. (1951) 13, 151–173.Google Scholar
[7]Kendall, D. G., Stochastic processes occurring in the theory of queue and their analysis by the method of the imbedded Markov Chain. Ann. Math. Statist., (1953) 24, 338–354.CrossRefGoogle Scholar
[8]Lederman, W., and Reuter, G. E. H., Spectral theory for the differential equations of simple birth and death processes. Phil. Trans. A. 246, (1954) 321–369.Google Scholar
[9]Lindley, D. V., The theory of queues with a single server. Proc. Camb. Soc., 48, (1952) 277–289.CrossRefGoogle Scholar
[10]Loeve, M., Probability Theory. D. Van Nostrand Co., Inc. (1955).Google Scholar
[11]Prabhu, N. U., Some results for the queue with Poisson arrivals. J. R. Statist. Soc. B. 22, (1960) 104–107.Google Scholar
[12]Riordan, J., An Introduction to Combinatory analysis. J. Wiley & Sons, Inc. (1958).Google Scholar
[13]Sparre Andersen, E., On the fluctation of sums of random variables. I. Math. Scand. 1, (1953) 263–285.CrossRefGoogle Scholar
[14]Sparre Andersen, E., On the fluctuations of sums of random variables, II. Math. Scand. 2, (1954) 195–223.Google Scholar
[15]Spitzer, F., A Combinatorial lemma and its applications to Probability theory. Trans. Amer. Math. Soc. 82, (1956) 323–339.CrossRefGoogle Scholar
[16]Spitzer, F., The Wiener-Hopf equation whose kernel is a probability density. Duke. Math. Journ. 24, (1957) 327–343.CrossRefGoogle Scholar
[17]Takacs, L., Investigation of waiting time problems by reduction to Markov Processes. Acta. Math. Acad. Sci. Hung. 6, (1955) 101–128.CrossRefGoogle Scholar
[18]Takacs, L., Transient behaviour of single-server queueing processes with recurrent input and exponentially distributed service times. Opns. Res. 8, (1960) 231–245.CrossRefGoogle Scholar
[19]Takacs, L., Transient behaviour of single queueing processes with Erlang input. To be published.Google Scholar
[20]Wald., A., Sequential tests of statistical hypothesis. Ann. Math. Statist. 16, (1945) 117–186.CrossRefGoogle Scholar
[21]Widder, D. V., The Laplace Transform. Princeton Univ. Press. (1946).Google Scholar