Uniformization: Basics, extensions and applications

被引:21
|
作者
van Dijk, N. M. [1 ]
van Brummelen, S. P. J. [1 ]
Boucherie, R. J. [2 ]
机构
[1] Univ Twente, Stochast Operat Res Grp, Stochast Operat Res, Enschede, Netherlands
[2] Univ Twente, Dept Appl Math, Stochast Operat Res, Enschede, Netherlands
关键词
Uniformization; Randomization; Time discretization; Time inhomogeneous; Cumulative reward model; Web server tandem model; TRANSIENT ANALYSIS; MARKOV-CHAINS; APPROXIMATION; NETWORKS; MODEL;
D O I
10.1016/j.peva.2017.09.008
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Uniformization, also referred to as randomization, is a well-known performance evaluation technique to model and analyse continuous-time Markov chains via an easier to performance measures via iteration of the one-step transition matrix of the discrete-time Markov chain. The number of iterations has a Poisson distribution with rate dominating the maximum exit rate from the states of the continuous-time Markov chain. This paper contains an expository presentation of uniformization techniques to increase awareness and to provide a formal and intuitive justification of several exact and approximate extensions, including: exact uniformization for reward models, exact uniformization for time-inhomogeneous rates, a numerical comparison with simple time-discretization, approximate uniformization for unbounded transition rates, and exact uniformization for continuous state variables for non-exponential networks. Furthermore, several of these results are numerically illustrated for a processor sharing web server tandem model of practical interest. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:8 / 32
页数:25
相关论文
共 50 条