Article

# Bounds For Performance Characteristics; A Systematic Approach Via Cost Structures

02/1999; DOI: 10.1080/15326349808807467
Source: CiteSeer

ABSTRACT In this paper we present a systematic approach for the construction of bounds for the average cost in Markov chains with infinitely many states. The technique to prove the bounds is based on dynamic programming. Most performance characteristics of Markovian systems can be represented by the average cost for some appropriately chosen cost structure. Therefore, the approach can be used to generate bounds for relevant performance characteristics. The approach is demonstrated for the shortest queue model. It is shown how for this model several bounds for the mean waiting time can be constructed. We include numerical results to demonstrate the quality of these bounds. 1 INTRODUCTION In this paper we consider an irreducible N-dimensional Markov chain with states m = (m 1 ; Delta Delta Delta ; mN ), where each m i is an integer, and transition probabilities p(m;n). Let ß denote its equilibrium distribution (which we assume to exist). If c(m) is the cost per period in state m, then the ...

0 Followers
·
92 Views
• Source
• Source
##### Article: Comparing Markov chains: Aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems
[Hide abstract]
ABSTRACT: Solving Markov chains is in general difficult if the state space of the chain is very large (or infinite) and lacking a simple repeating structure. One alternative to solving such chains is to construct models that are simple to analyze and provide bounds for a reward function of interest. We present a new bounding method for Markov chains inspired by Markov reward theory: Our method constructs bounds by redirecting selected sets of transitions, facilitating an intuitive interpretation of the modifications of the original system. We show that our method is compatible with strong aggregation of Markov chains; thus we can obtain bounds for an initial chain by analyzing a much smaller chain. We illustrate our method by using it to prove monotonicity results and bounds for assemble-to-order systems.
Mathematics of Operations Research 05/2012; DOI:10.2307/23256623 · 0.92 Impact Factor
• Source
##### Article: On the convergence of the power series algorithm
[Hide abstract]
ABSTRACT: In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. We show that normalization plays a crucial role and that the con- vergence can be improved by introducing some minor changes in the algorithm. We illustrate this with several numerical examples.
Performance Evaluation 09/2000; 42:21-39. DOI:10.1016/S0166-5316(99)00081-4 · 0.89 Impact Factor