The Community for Technology Leaders
International Conference on Dependable Systems and Networks (DSN'06) (2006)
Philadelphia, Pennsylvania
June 25, 2006 to June 28, 2006
ISBN: 0-7695-2607-1
pp: 485-494
Vinh V. Lam , University of Illinois at Urbana-Champaign
William H. Sanders , University of Illinois at Urbana-Champaign
Peter Buchholz , Informatik IV, Universitat Dortmund, Germany
Path-based techniques make the analysis of very large Markov models feasible by trading off high computational complexity for low space complexity. Often, a drawback in these techniques is that they have to evaluate many paths in order to compute reasonably tight bounds on the exact solutions of the models. In this paper, we present a path composition algorithm to speed up path evaluation significantly. It works by quickly composing subpaths that are precomputed locally at the component level. The algorithm is computationally efficient since individual subpaths are precomputed only once, and the results are reused many times in the computation of all composed paths. To the best of our knowledge, this work is the first to propose the idea of path composition for the analysis of Markov models. A practical implementation of the algorithm makes it feasible to solve even larger models, since it helps not only in evaluating more paths faster but also in computing long paths efficiently by composing them from short ones. In addition to presenting the algorithm, we demonstrate its application and evaluate its performance in computing the reliability and availability of a large distributed information service system in the presence of fault propagation and in computing the probabilities of buffer overflow and buffer flushing in a media multicast system with varying system configurations.

W. H. Sanders, V. V. Lam and P. Buchholz, "A Component-Level Path Composition Approach for Efficient Transient Analysis of Large CTMCs," International Conference on Dependable Systems and Networks (DSN'06)(DSN), Philadelphia, Pennsylvania, 2006, pp. 485-494.
86 ms
(Ver 3.3 (11022016))