By Topic

Transient analysis of some rewarded Markov models using randomization with quasistationarity detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Carrasco, J.A. ; Dept. d''Enginyeria Elettronica, Univ. Politecnica de Catalunya, Barcelona, Spain

Rewarded homogeneous continuous-time Markov chain (CTMC) models can be used to analyze performance, dependability and performability attributes of computer and telecommunication systems. In this paper, we consider rewarded CTMC models with a reward structure including reward rates associated with states and two measures summarizing the behavior in time of the resulting reward rate random variable: the expected transient reward rate at time t and the expected averaged reward rate in the time interval [0, t]. Computation of those measures can be performed using the randomization method, which is numerically stable and has good error control. However, for large stiff models, the method is very expensive. Exploiting the existence of a quasistationary distribution in the subset of transient states of discrete-time Markov chains with a certain structure, we develop a new variant of the (standard) randomization method, randomization with quasistationarity detection, covering finite CTMC models with state space S/spl cup/{f/sub 1/,f/sub 2/,..., f/sub A/}, A/spl ges/1, where all states in S are transient and reachable among them and the states f/sub i/ are absorbing. The method has the same good properties as the standard randomization method and can be much more efficient. We also compare the performance of the method with that of regenerative randomization.

Published in:

Computers, IEEE Transactions on  (Volume:53 ,  Issue: 9 )