Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering

European Journal of Operational Research

Volumn 165, Issue 3, 2005, Pages 810-825

  Pekergin, Nihal ^a,b   Dayar, Tuǧrul ^c   Alparslan, Denizhan N ^d  

^a UNIVERSITY OF VERSAILLES   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^c BILKENT UNIVERSITY   (Turkey)

^d UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Aggregation; Markov processes; Near complete decomposability; Reorderings; Stochastic comparison

Indexed keywords

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; LINEAR EQUATIONS; MARKOV PROCESSES; MATRIX ALGEBRA; POISSON DISTRIBUTION; PROBABILITY; PROBLEM SOLVING; QUEUEING NETWORKS; VECTORS;

MARKOV MODULATED POISSON PROCESS (MMPP); NEAR COMPLETE DECOMPOSABILITY; REORDERING; STOCHASTIC COMPARISON;

OPERATIONS RESEARCH;

EID: 13444259536     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2001.09.001     Document Type: Article

References (23)

1. O. Abu-Amsha, J.-M. Vincent, An algorithm to bound functionals of Markov chains with large state space, Rapport de recherche MAI n 25, IMAG, Grenoble, France, 1996
2. Courtois P.-J. Decomposability: Queueing and Computer System Applications. 1977;Academic Press, New York
3. Courtois P.-J., Semal P. Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition. Journal of the Association for Computer Machinery. 31:1984;804-825
4. T. Dayar, Permuting Markov chains to nearly completely decomposable form, Technical Report BU-CEIS-9808, Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey, 1998, Available from 〈http://www.cs.bilkent.edu.tr/tech-reports/1998/ABSTRACTS.1998.html〉
5. T. Dayar, N. Pekergin, Stochastic comparison, reorderings, and nearly completely decomposable markov chains (NSMC'99), in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Spain, 1999, pp. 228-246
6. Dayar T., Stewart W.J. Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains. SIAM Journal on Scientific Computing. 21:2000;1691-1705
7. Dayar T., Stewart W.J. On the effects of using the Grassmann-Taksar- Heyman method in iterative aggregation-disaggregation. SIAM Journal on Scientific Computing. 17:1996;287-303
8. Grassmann W.K., Taksar M.I., Heyman D.P. Regenerative analysis and steady state distributions for Markov chains. Operations Research. 33:1985;1107-1116
9. Kamburowski J. Stochastically minimizing the makespan in two-machine flow shops without blocking. European Journal of Operational Research. 112:1999;304-309
10. Keilson J., Kester A. Monotone matrices and monotone Markov processes. Stochastic Processes and Their Applications. 5:1977;231-241
11. Massey W.A. Stochastic orderings for Markov processes on partially ordered spaces. Mathematics of Operations Research. 12:1987;350-367
12. Meyer C.D. Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Review. 31:1989;240-272
13. N. Pekergin, Stochastic delay bounds on fair queueing algorithms, in: Proceedings of INFOCOM'99, New York, 1999, pp. 1212-1220
14. Pekergin N. Stochastic performance bounds by state reduction. Performance Evaluation. 36-37:1999;1-17
15. N. Pekergin, T. Dayar, D.N. Alparslan, Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering, Technical Report BU-CE-0202, Department of Computer Engineering, Bilkent University, Ankara, Turkey, 2002, Available from 〈http://www.cs. bilkent.edu.tr/tech-reports/2002/ABSTRACTS.2002.html〉
16. P. Semal, Analysis of large Markov models, bounding techniques and applications, Doctoral Thesis, Université Catholique de Louvain, Belgium, 1992
17. Shaked M., Shantikumar J.G. Stochastic Orders and Their Applications. 1994;Academic Press, San Diego, CA
18. Skelly P., Schwartz M., Dixit S. A histogram-based model for video traffic behavior in an ATM multiplexer. IEEE/ACM Transactions on Networking. 1:1993;446-459
19. Stewart W.J. Introduction to the Numerical Solution of Markov Chains. 1994;Princeton University Press, Princeton, NJ
20. Stoyan D. Comparison Methods for Queues and Other Stochastic Models. 1983;John Wiley & Sons, Berlin, Germany
21. M. Tremolieres, J.-M. Vincent, B. Plateau, Determination of the optimal upper bound of a Markovian generator, Technical Report 106, LGI-IMAG, Grenoble, France, 1992
22. Truffet L. Near complete decomposability: Bounding the error by stochastic comparison method. Advances in Applied Probability. 29:1997;830-855
23. Vèque V., Ben-Othman J. MRAP: A multiservices resource allocation policy for wireless ATM network. Computer Networks and ISDN Systems. 29:1998;2187-2200