Skip to main content Accessibility help
×
Home

Reduction techniques for discrete-time Markov chains on totally ordered state space using stochastic comparisons

  • Laurent Truffet (a1)

Abstract

We propose in this paper two methods to compute Markovian bounds for monotone functions of a discrete time homogeneous Markov chain evolving in a totally ordered state space. The main interest of such methods is to propose algorithms to simplify analysis of transient characteristics such as the output process of a queue, or sojourn time in a subset of states. Construction of bounds are based on two kinds of results: well-known results on stochastic comparison between Markov chains with the same state space; and the fact that in some cases a function of Markov chain is again a homogeneous Markov chain but with smaller state space. Indeed, computation of bounds uses knowledge on the whole initial model. However, only part of this data is necessary at each step of the algorithms.

Copyright

Corresponding author

Postal address: Ecole des Mines de Nantes, Dpt. Automatique et Productique, 4, rue Alfred Kastler BP 20722, 44307 Nantes, Cedex 3, France. Email address: laurent.truffet@emn.fr

References

Hide All
[1] Buchholz, P. (1994). Exact and ordinary lumpability in finite Markov chains. J. Appl. Prob. 31, 5975.
[2] Doisy, M. (1992). Comparaison de processus à valeurs dans Zd . In Actes des journées de mathématiques appliquées de Pau-Zaragosse.
[3] Keilson, J., and Kester, A. (1977). Monotone matrices and monotone Markov processes. Stoch. Proc. Appl. 5, 231241.
[4] Kemeny, J. G., and Snell, J. L. (1960). Finite Markov Chains. Princeton University Press.
[5] Massey, W. A. (1987). Stochastic orderings for Markov processes on partially ordered spaces. Math. Operat. Res. 11, 350367.
[6] Moulki, M., Beylot, A. L., Truffet, L., and Becker, M. (1998). An aggregation technique to evaluate the performance of a two-stage buffered ATM switch. Ann. Operat. Res. 79, 373392.
[7] Schweitzer, P. (1984). Aggregation methods for large Markov chains. Math. Comp. Perf. and Reliab. Eds. Iazeola, G. et al. Elsevier North-Holland, Amsterdam.
[8] Stoyan, D. (1976). Comparison Methods for Queues and Other Stochastic Models. John Wiley, New York.
[9] Trémolières, M., Vincent, J. M., and Plateau, B. (1992). Determination of the optimal stochastic upper bound of a Markovian generator. Tech. Rept, LGI-IMAG, Grenoble-FRANCE. RR 906-I-.
[10] Truffet, L. (1996). Geometrical bounds on an output stream of a queue in ATM switch: application to the dimensioning problem. ATM Networks: Performance Modelling and Analysis, Vol. II. Ed. Kouvatsos, D. Chapman and Hall, London.
[11] Truffet, L. (1997). Near complete decomposability: bounding the error by stochastic comparison method. Adv. Appl. Prob. 29, 830855.
[12] Truffet, L. (1998). A family of bounds on the output stream of queues with iid batch arrival arising in ATM networks models. In Proc. 4th INFORMS Telecomm. Conf. Boca Raton.

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed