On ramaswami's algorithm for the computation of the steady state vector in markov chains ofM/G/1-Type
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 6 (3), 541-550
- https://doi.org/10.1080/15326349908807161
Abstract
Based on well known results of Markov chain theory, a new proof of Ra-maswami's algorithm for the computation of the steady state vector in Markov chains of M/G/1-type is given. The starting vector of the recursive scheme is explicitly represented.Keywords
This publication has 8 references indexed in Scilit:
- Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open ProblemsSIAM Review, 1988
- A stable recursion for the steady state vector in markov chains of m/g/1 typeCommunications in Statistics. Stochastic Models, 1988
- OpsearchCommunications in Statistics. Stochastic Models, 1985
- Matrix-analytic methods in queuing theoryEuropean Journal of Operational Research, 1984
- The N/G/1 queue and its detailed analysisAdvances in Applied Probability, 1980
- Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service timesAdvances in Applied Probability, 1977
- Computation of the stationary distribution of an infinite stochastic matrix of special formBulletin of the Australian Mathematical Society, 1974
- The Markov Renewal Branching ProcessPublished by Springer Nature ,1974