The single server queue with Poisson input and semi-Markov service times
- 1 June 1966
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 3 (01), 202-230
- https://doi.org/10.1017/s0021900200114056
Abstract
We assume that the successive service times in a single server queue with Poisson arrivals form an m-state semi-Markov process. The results for the M/G/1 queue are extended to this case. Both the time-dependence and the stationary solutions are discussed.Keywords
This publication has 8 references indexed in Scilit:
- A comparison of queue disciplines when service orientation times occurNaval Research Logistics Quarterly, 1963
- Stationary Waiting-Time Distributions for Single-Server QueuesThe Annals of Mathematical Statistics, 1962
- A continuous-time treatment of certain queues and infinite damsJournal of the Australian Mathematical Society, 1962
- Markov Renewal Processes with Finitely Many StatesThe Annals of Mathematical Statistics, 1961
- A Convexity Property in the Theory of Random Variables Defined on a Finite Markov ChainThe Annals of Mathematical Statistics, 1961
- Markov Renewal Processes: Definitions and Preliminary PropertiesThe Annals of Mathematical Statistics, 1961
- Regenerative stochastic processesProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1955
- Unzerlegbare, nicht negative MatrizenMathematische Zeitschrift, 1950