On the busy period in the queueing system GI/G/1
- 1 October 1961
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 2 (2), 217-228
- https://doi.org/10.1017/s1446788700026690
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- Transient Behavior of Single-Server Queuing Processes with Recurrent Input and Exponentially Distributed Service TimesOperations Research, 1960
- The Wiener-Hopf equation whose kernel is a probability densityDuke Mathematical Journal, 1957
- A Combinatorial Lemma and Its Application to Probability TheoryTransactions of the American Mathematical Society, 1956
- A combinatorial lemma and its application to probability theoryTransactions of the American Mathematical Society, 1956
- Investigation of waiting time problems by reduction to Markov processesActa Mathematica Hungarica, 1955
- Spectral theory for the differential equations of simple birth and death processesPhilosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1954
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov ChainThe Annals of Mathematical Statistics, 1953
- The theory of queues with a single serverMathematical Proceedings of the Cambridge Philosophical Society, 1952
- On the distribution of values of sums of random variablesMemoirs of the American Mathematical Society, 1951
- Sequential Tests of Statistical HypothesesThe Annals of Mathematical Statistics, 1945