Algorithms for an irreducible and lumpable strong stochastic bound

Linear Algebra and Its Applications

Volumn 386, Issue 1-3 SUPPL., 2004, Pages 167-185

  Fourneau, J M ^a   Lecoz, M ^a   Quessette, F ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

Lumpability; Stochastic bounds; Stochastic monotonicity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING; QUALITY OF SERVICE; QUEUEING NETWORKS;

LUMPABILITY; LUMPABLE STOCHASTIC BOUNDING MATRIX; STOCHASTIC BOUNDS; STOCHASTIC MONOTONICITY;

RANDOM PROCESSES;

EID: 2942555557     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2004.02.005     Document Type: Conference Paper

References (18)

1. O. Abu-Amsha, J.-M. Vincent, An algorithm to bound functionals of Markov chains with large state space, in: 4th INFORMS Conference on Telecommunications, Boca Raton, Florida, 1998.
2. M. Benmammoun, J.M. Fourneau, N. Pekergin, A. Troubnikoff, An algorithmic and numerical approach to bound the performance of high speed networks, IEEE MASCOTS 2002, Fort Worth, USA, pp. 375-382.
3. Buchholz P. Exact and ordinary lumpability in finite Markov chains. J. Appl. Probab. 31:1994;3159-3175.
4. Buchholz P. An iterative bounding method for stochastic automata networks. Perform. Eval. 49:2002;211-226.
5. Courtois P.J., Semal P. Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models. IEEE JSAC. 4(6):1986.
6. Dayar T., Stewart W.J. Comparison of partitioning techniques for two-level iterative solvers on large sparse Markov chains. SIAM J. Sci. Comput. 21:2000;1691-1705.
7. S. Donatelli, Superposed generalized stochastic Petri nets: definition and efficient solution, in: Proceedings of the 15th International Conference on Application and Theory of Petri Nets, Zaragoza, Spain, June 1994.
8. J.M. Fourneau, N. Pekergin, An algorithmic approach to stochastic bounds, LNCS 2459, Performance evaluation of complex systems: techniques and tools, 2002, pp. 64-88.
9. J.M. Fourneau, M. Le Coz, N. Pekergin, F. Quessette, An open tool to compute stochastic bounds on steady-state distributions and rewards, IEEE Mascots 03, USA, 2003.
10. G.Hébuterne, A. Gravey, A space priority queueing mechanism for multiplexing ATM channels, ITC Specialist Seminar, Computer Network and ISDN Systems, vol. 20, December 1990, pp. 37-43.
11. Keilson J., Kester A. Monotone matrices and monotone Markov processes. Stoch. Process. Appl. 5:1977;231-241.
12. B. Plateau, On the stochastic structure of parallelism and synchronization models for distributed algorithms, in: Proceedings of the SIGMETRICS Conference, Texas, 1985, pp. 147-154.
13. Stewart W.J. Introduction to the Numerical Solution of Markov Chains. 1994;Princeton University Press.
14. Stewart W.J., Atif K., Plateau B. The numerical solution of stochastic automata networks. European J. Oper. Res. 86:1995;503-525.
15. Stoyan D. Comparison Methods for Queues and Other Stochastic Models. 1983;Wiley.
16. Truffet L. Reduction technique for discrete time Markov chains on totally ordered state space using stochastic comparisons. J. Appl. Probab. 37(3):2000.
17. Uysal E., Dayar T. Iterative methods based on splittings for stochastic automata networks. European J. Oper. Res. 110:1998;166-186.
18. N. Van Dijk, Error bound analysis for queueing networks, Performance 96 Tutorials, Lausanne, 1996.