Fluid computation of passage-time distributions in large Markov models

被引:26
|
作者
Hayden, Richard A. [1 ]
Stefanek, Anton [1 ]
Bradley, Jeremy T. [1 ]
机构
[1] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2BZ, England
基金
英国工程与自然科学研究理事会;
关键词
Fluid approximation; Passage-time distribution; Stochastic process algebra; Service level agreement; Scalability analysis; PEPA MODELS; APPROXIMATIONS; FRAMEWORK;
D O I
10.1016/j.tcs.2011.07.017
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Recent developments in the analysis of large Markov models facilitate the fast approximation of transient characteristics of the underlying stochastic process. Fluid analysis makes it possible to consider previously intractable models whose underlying discrete state space grows exponentially as model components are added. In this work, we show how fluid-approximation techniques may be used to extract passage-time measures from performance models. We focus on two types of passage measure: passage times involving individual components, as well as passage times which capture the time taken fora population of components to evolve. Specifically, we show that for models of sufficient scale, global passage-time distributions can be well approximated by a deterministic fluid-derived passage-time measure. Where models are not of sufficient scale, we are able to generate upper and lower approximations for the entire cumulative distribution function of these passage-time random variables, using moment-based techniques. Additionally, we show that, for passage-time measures involving individual components, the cumulative distribution function can be directly approximated by fluid techniques. Finally, using the GPA tool, we take advantage of the rapid fluid computation of passage times to show how a multi-class client-server system can be optimised to satisfy multiple service level agreements. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:106 / 141
页数:36
相关论文
共 50 条
  • [1] Passage-time computation and aggregation strategies for large semi-Markov processes
    Guenther, Marcel C.
    Dingle, Nicholas J.
    Bradley, Jeremy T.
    Knottenbelt, William J.
    [J]. PERFORMANCE EVALUATION, 2011, 68 (03) : 221 - 236
  • [3] Distributed computation of transient state distributions and passage time quantiles in large semi-Markov models
    Bradley, Jeremy T.
    Dingle, Nicholas J.
    Harrison, Peter G.
    Knottenbelt, William J.
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2006, 22 (07): : 828 - 837
  • [4] Iterative convergence of passage-time densities in semi-Markov performance models
    Bradley, JT
    Wilson, HJ
    [J]. PERFORMANCE EVALUATION, 2005, 60 (1-4) : 237 - 254
  • [5] Passage-time moments for positively recurrent Markov chains
    Shiga, T
    Shimizu, A
    Soshi, T
    [J]. NAGOYA MATHEMATICAL JOURNAL, 2001, 162 : 169 - 185
  • [6] A passage-time preserving equivalence for semi-Markov processes
    Bradley, JT
    [J]. COMPUTER PERFORMANCE EVALUATION: MODELLING TECHNIQUES AND TOOLS, 2002, 2324 : 178 - 187
  • [7] PASSAGE-TIME GENERATING FUNCTIONS FOR CONTINUOUS-TIME FINITE MARKOV CHAINS
    DARROCH, JN
    MORRIS, KW
    [J]. JOURNAL OF APPLIED PROBABILITY, 1968, 5 (02) : 414 - &
  • [8] Hypergraph-based parallel computation of passage time densities in large semi-Markov models
    Bradley, JT
    Dingle, NJ
    Knottenbelt, WJ
    Wilson, HJ
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2004, 386 : 311 - 334
  • [9] Passage-time distributions from a spin-boson detector model
    Hegerfeldt, Gerhard C.
    Neumann, Jens Timo
    Schulman, Lawrence S.
    [J]. PHYSICAL REVIEW A, 2007, 75 (01):
  • [10] Efficient computation of passage time densities and distributions in Markov chains using Laguerre method
    Kulatunga, H.
    Knottenbelt, W. J.
    [J]. ELECTRONICS LETTERS, 2008, 44 (15) : 935 - 937