A path-based framework for analyzing large markov models

Lam, Vinh V.

Permalink

https://hdl.handle.net/2142/24155 Copy

Description

Title

A path-based framework for analyzing large markov models

Author(s)

Lam, Vinh V.

Issue Date

2011-05-25T15:03:21Z

Director of Research (if dissertation) or Advisor (if thesis)

Sanders, William H.

Doctoral Committee Chair(s)

Sanders, William H.

Committee Member(s)

• Agha, Gul A.
• Meseguer, José
• Nicol, David M.
• Buchholz, Peter

Department of Study

Computer Science

Discipline

Computer Science

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

Ph.D.

Degree Level

Dissertation

Keyword(s)

• Numerical analysis
• Markov chains
• System modelling

Abstract

Reliability and dependability modeling can be employed during many stages of analysis of a computing system to gain insights into its critical behaviors. To provide useful results, realistic models of systems are often necessarily large and complex. Numerical analysis of these models presents a formidable challenge because the sizes of their state-space descriptions grow exponentially in proportion to the sizes of the models. On the other hand, simulation of the models requires analysis of many trajectories in order to compute statistically correct solutions. This dissertation presents a novel framework for performing both numerical analysis and simulation. The new numerical approach computes bounds on the solutions of transient measures in large continuous-time Markov chains (CTMCs). It extends existing path-based and uniformization-based methods by identifying sets of paths that are equivalent with respect to a reward measure and related to one another via a simple structural relationship. This relationship makes it possible for the approach to explore multiple paths at the same time,· thus significantly increasing the number of paths that can be explored in a given amount of time. Furthermore, the use of a structured representation for the state space and the direct computation of the desired reward measure (without ever storing the solution vector) allow it to analyze very large models using a very small amount of storage. Often, path-based techniques must compute many paths to obtain tight bounds. In addition to presenting the basic path-based approach, we also present algorithms for computing more paths and tighter bounds quickly. One resulting approach is based on the concept of path composition whereby precomputed subpaths are composed to compute the whole paths efficiently. Another approach is based on selecting important paths (among a set of many paths) for evaluation. Many path-based techniques suffer from having to evaluate many (unimportant) paths. Evaluating the important ones helps to compute tight bounds efficiently and quickly.

Graduation Semester

2011-05

Permalink

http://hdl.handle.net/2142/24155

Copyright and License Information

Copyright 2011 Vinh V. Lam

Owning Collections