On Ramaswami’s algorithm for the computation of the steady state vector in Markov chains of M/G/1-type

On Ramaswami’s algorithm for the computation of the steady state vector in Markov chains of M/G/1-type

0.00 Avg rating—0 Votes
Article ID: iaor1991346
Country: United States
Volume: 6
Start Page Number: 541
End Page Number: 550
Publication Date: Sep 1990
Journal: Stochastic Models
Authors:
Keywords: queues: theory
Abstract:

Based on well known results of Markov chain theory, a new proof of Ramaswami’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.

Reviews

Required fields are marked *. Your email address will not be published.