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

Journal of Applied Probability

Volumn 37, Issue 3, 2000, Pages 795-806

  Truffet, Laurent ^a  

^a ECOLE DES MINES DE NANTES   (France)

Author keywords

Exact and ordinary lumpability; Strong order; Transient analysis

Indexed keywords

EID: 0034337851     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1014842837     Document Type: Article

References (12)

1. Buchholz, P. (1994). Exact and ordinary lumpability in finite Markov chains. J. Appl. Prob. 31, 59-75.
2. d. 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, 231-241.
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, 350-367.
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, 373-392.
7. Schweitzer, P. (1984). Aggregation methods for large Markov chains. Math. Comp. Perf. and Reliab. Eds. G. Iazeola etal. Elsevier North-Holland, Amsterdam.
8. Stoyan, D. (1976). Comparison Methods for Queues and Other Stochastic Models. John Wiley, NewYork.
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. D. Kouvatsos. Chapman and Hall, London.
11. Truffet, L. (1997). Near complete decomposability: bounding the errorby stochastic comparison method. Adv. Appl. Prob. 29, 830-855.
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.