A Perturbation and Reduction Based Algorithm

Authors:
Jean-Michel Fourneau;L. Mokdad
Affiliations:
-;-
Venue:
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Year:
1998

Citing 4
Cited 0

Reduced systems in Markov chains and their applications in queueing theory

Queueing Systems: Theory and Applications
Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems

SIAM Review
An efficient two-stage iterative method for the steady-state analysis of Markov regenerative stochastic Petri net models

Performance Evaluation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new algorithm for solving discrete-time Markov chains where transition probabilities have several orders of magnitude. Our method combines the decomposition by perturbation and the reduction approaches. In the decomposition phase, we remove from the chain some transitions with very small probabilities. But we assume that the reduced graph is still strongly connected after the deletion. A transversal (a cut set of the directed cycles) is then obtained and the reduction method is used to compute the first approximation of the steady-state distribution. Further approximations may be computed iteratively to obtain the desirable accuracy. We prove the algorithm and present some examples.