Queues with semi-Markovian arrivals
- 1 August 1967
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 4 (2), 365-379
- https://doi.org/10.2307/3212030
Abstract
A queueing system with a single server is considered. There are a finite number of types of customers, and the types of successive arrivals form a Markov chain. Further, the nth interarrival time has a distribution function which may depend on the types of the nth and the n–1th arrivals. The queue size, waiting time, and busy period processes are investigated. Both transient and limiting results are given.Keywords
This publication has 7 references indexed in Scilit:
- Decomposition of a Semi-Markov Process Under a State Dependent RuleSIAM Journal on Applied Mathematics, 1967
- The single server queue with Poisson input and semi-Markov service timesJournal of Applied Probability, 1966
- Stationary Waiting-Time Distributions for Single-Server QueuesThe Annals of Mathematical Statistics, 1962
- Markov Renewal Processes with Finitely Many StatesThe 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
- Recherches sur les chaînes de Markoff: Premier MémoireActa Mathematica, 1936