Operator-geometric stationary distributions for markov chains, with application to queueing models
- 1 June 1982
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 14 (2), 368-391
- https://doi.org/10.2307/1426527
Abstract
This paper considers a class of Markov chains on a bivariate state space , whose transition probabilities have a particular ‘block-partitioned' structure. Examples of such chains include those studied by Neuts [8] who took E to be finite; they also include chains studied in queueing theory, such as (Nn, Sn) where Nn is the number of customers in a GI/G/1 queue immediately before, and Sn the remaining service time immediately after, the nth arrival.We show that the stationary distribution Πfor these chains has an ‘operator-geometric' nature, with , where the operator S is the minimal solution of a non-linear operator equation. Necessary and sufficient conditions for Πto exist are also found. In the case of the GI/G/1 queueing chain above these are exactly the usual stability conditions.G1/G/1 QUEUE; PHASE-TYPE; INVARIANT MEASURE; FOSTER'S CONDITIONSKeywords
This publication has 10 references indexed in Scilit:
- The probabilistic significance of the rate matrix in matrix-geometric invariant vectorsJournal of Applied Probability, 1980
- The probabilistic significance of the rate matrix in matrix-geometric invariant vectorsJournal of Applied Probability, 1980
- The Recurrence Structure of General Markov ProcessesProceedings of the London Mathematical Society, 1979
- Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vectorAdvances in Applied Probability, 1978
- Criteria for classifying general Markov chainsAdvances in Applied Probability, 1976
- Criteria for classifying general Markov chainsAdvances in Applied Probability, 1976
- A Uniform Theory for Sums of Markov Chain Transition ProbabilitiesThe Annals of Probability, 1975
- $R$-Theory for Markov Chains on a General State Space I: Solidarity Properties and $R$-Recurrent ChainsThe Annals of Probability, 1974
- The queue with Poisson input and general service times, treated as a branching processDuke Mathematical Journal, 1969
- On the busy period in the queueing system GI/G/1Journal of the Australian Mathematical Society, 1961