An open tool to compute stochastic bounds on steady-state distributions and rewards

Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

Volumn 2003-January, Issue , 2003, Pages 219-224

  Fourneau, J M ^a   Le Coz, M ^a   Pekergin, N ^a   Quessette, F ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

Algebra; Distributed computing; Laboratories; Numerical analysis; Performance loss; Petri nets; Quality of service; State space methods; Steady state; Stochastic processes

Indexed keywords

ALGEBRA; ALGORITHMS; CHAINS; DISTRIBUTED COMPUTER SYSTEMS; LABORATORIES; MARKOV PROCESSES; NUMERICAL ANALYSIS; NUMERICAL METHODS; PETRI NETS; QUALITY OF SERVICE; RANDOM PROCESSES; STATE SPACE METHODS; STOCHASTIC SYSTEMS;

NUMERICAL COMPLEXITY; PERFORMANCE INDICES; PERFORMANCE LOSS; REWARD FUNCTION; STEADY STATE; STEADY-STATE DISTRIBUTIONS; STOCHASTIC BOUND; STOCHASTIC ORDER;

QUALITY CONTROL;

EID: 34748900230     PISSN: 15267539     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOT.2003.1240661     Document Type: Conference Paper

References (16)

1. O. Abu-Amsha and 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. Fourenau, N. Pekergin, and A. Troubnikoff. An algorithmic and numerical approach to bound the performance of high speed networks. In IEEE Mascots, Fort Worth, USA, 2002.
3. M. Benmammoun and N. Pekergin. Closed form stochastic bounds on the stationary distribution of markov chains. Probability in the Engineering and Informational Sciences, (16):403-426, 2002.
4. F. Boujdaine, T. Dayar, J.-M. Fourneau, N. Pekergin, S. Saadi, and J. Vincent. A new proof of st-comparison for polynomials of a stochastic matrix. InSubmitted, 2003.
5. T. Dayar, J.-M. Fourneau, and N. Pekergin. Transforming stochastic matrices for stochastic comparison with the storder. RAIRO-RO, To appear, 2003.
6. T. Dayar and N. Pekergin. Stochastic comparison, reorderings, and nearly completely decomposable markov chains. In B. Plateau and W. Stewart, editors, Proceedings of the International Conference on the Numerical Solution of Markov Chains (NSMC'99), pages 228-246, 1999.
7. S. Donatelli. Superposed generalized stochastic petri nets: definition and efficient solution. In Proc. 15th Int. Conf. on Application and Theory of Petri Nets, Zaragoza, Spain, 1994.
8. J.-M. Fourneau, M. Le Coz, and F. Quessette. Algorithms for an irreducible and lumpable strong stochastic bound. In Numerical Solution of Markov Chains, USA, 2003.
9. J.-M. Fourneau and N. Pekergin. An algorithmic approach to stochastic bounds. In LNCS 2459, Performance evaluation of complex systems: Techniques and Tools, pages 64-88, 2002.
10. B. Haverkort, A. Bell, and H. Bohnenkamp. On the efficient sequential and distributed generation of very large markov chains from stochastic petri nets. In I. Press, editor, PNPM 99, pages 12-21, Spain, 1999.
11. G. Hébuterne and A. Gravey. A space priority queueing mechanism for multiplexing atm channels. ITC Specialist Seminar, Computer Network and ISDN Systems, (V20):37-43, 1990.
12. J. Hillston and L. Kloul. An efficient kronecker representation for pepa models. In PAPM, Aachen Germany, 2001.
13. N. Pekergin. Stochastic delay bounds on fair queueing algorithms. In Proceedings of INFOCOM'99, pages 1212-1220, New York, 1999.
14. B. Plateau. On the stochastic structure of parallelism and synchronization models for distributed algorithms. In Proc. of the SIGMETRICS Conference, pages 147-154, Texas, 1985.
15. W. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
16. D. Stoyan. Comparison Methods for Queues and Other Stochastic Models. Wiley, 1983.