Imbedded Markov chain analysis of single server bulk queues
- 1 February 1964
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of the Australian Mathematical Society
- Vol. 4 (2) , 244-263
- https://doi.org/10.1017/s1446788700023454
Abstract
Summary In this paper results from Fluctuation Theory are used to analyse the imbedded Markov chains of two single server bulk-queueing systems, (i)with Poisson arrivals and arbitrary service time distribution and (ii) with arbitrary inter-arrival time distribution and negative exponential service time. The discrete time transition probailities and the equilibrium behaviour of the queue lengths of the systems have been obtained along with distributions concerning the busy periods. From the general results several special cases have been derived.Keywords
This publication has 14 references indexed in Scilit:
- Queues with batch arrivals. IActa Mathematica Hungarica, 1964
- An Elementary Queueing ProblemThe American Mathematical Monthly, 1962
- Queues with Batch Departures IThe Annals of Mathematical Statistics, 1961
- The Transient Behavior of a Single Server Queuing Process with Recurrent Input and Gamma Service TimeThe Annals of Mathematical Statistics, 1961
- The Passage Problem for a Stationary Markov ChainPhysics Today, 1961
- Transient Behavior of Single-Server Queueing Processes With Erlang InputTransactions of the American Mathematical Society, 1961
- Imbedded Markov Chain Analysis of a Waiting-Line Process in Continuous TimeThe Annals of Mathematical Statistics, 1959
- 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
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov ChainThe Annals of Mathematical Statistics, 1953