Approximate uniformization for continuous-time Markov chains with an application to performability analysis

An approximate version of the standard uniformization technique is introduced for application to continuous-time Markov chains with unbounded jump rates. This technique is shown to be asymptotically exact and an error bound for the order of its accuracy is provided. An illustrative queueing application is included.

[1]  Henk Tijms,et al.  A simple technique in Markovian control with applications to resource allocation in communication networks , 1986 .

[2]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[3]  Nico M. van Dijk.  On the finite horizon Bellman equation for controlled Markov jump models with unbounded characteristics: existence and approximation , 1988 .

[4]  Richard F. Serfozo,et al.  Technical Note - An Equivalence Between Continuous and Discrete Time Markov Decision Processes , 1979, Oper. Res..

[5]  N. K. Jaiswal,et al.  Priority queues , 1968 .

[6]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[7]  Peter W. Jones,et al.  Stochastic Modelling and Analysis , 1988 .

[8]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[9]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[10]  J. Shanthikumar,et al.  General queueing networks: Representation and stochastic monotonicity , 1987, 26th IEEE Conference on Decision and Control.

[11]  J. George Shanthikumar,et al.  Bounds and Approximations for the Transient Behavior of Continuous-Time Markov Chains , 1989, Probability in the Engineering and Informational Sciences.

[12]  Stanley R. Pliska,et al.  Controlled jump processes , 1975 .

[13]  David D. Yao,et al.  Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks , 1987, Oper. Res..

[14]  Rajan Suri,et al.  A Concept of Monotonicity and Its Characterization for Closed Queueing Networks , 1985, Oper. Res..

[15]  Jan van der Wal,et al.  Simple bounds and monotonicity results for finite multi-server exponential tandem queues , 1989, Queueing Syst. Theory Appl..

[16]  Nico M. van Dijk,et al.  Simple Bounds for Queueing Systems with Breakdowns , 1988, Perform. Evaluation.

[17]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[18]  Sheldon M. Ross,et al.  Approximating Transition Probabilities and Mean Occupation Times in Continuous-Time Markov Chains , 1987, Probability in the Engineering and Informational Sciences.