haku: @indexterm NUMERICAL COMPUTATION / yhteensä: 22
viite: 8 / 22
| Tekijä: | Dijk, N. M. van |
| Otsikko: | Truncation of Markov chains with applications to queueing |
| Lehti: | Operations Research
1991 : NOV-DEC, VOL. 39:6, p.1018-1027 |
| Asiasana: | MARKOV CHAINS QUEUING THEORY PROBABILITY BIAS NUMERICAL COMPUTATION |
| Kieli: | eng |
| Tiivistelmä: | State-space truncation is frequently demanded for computation of large or infinite Markov chains. Conditions are given that guarantee an error bound or rate of convergence. Roughly, these conditions apply either when probabilities of large states are sufficiently small, or when transition probabilities for state increases become small in sufficiently large states. The verification of these conditions is based on establishing bounds for bias terms of reward structures. The paper is mainly concerned with illustrating the conditions for two concrete multidimensional, nonproduct form queueing examples: an overflow model and a tandem queue with blocking. |
SCIMA