Stochastic performance bounds by state space reduction

Performance Evaluation

Volumn 36-37, Issue , 1999, Pages 1-17

  Pekergin, Nihal ^a,b  

^a UNIVERSITY OF VERSAILLES   (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; ERRORS; MARKOV PROCESSES; MATHEMATICAL MODELS; PERFORMANCE; STATE SPACE METHODS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

BOUNDING MODELS; DISCRETE TIME MARKOV CHAINS; MARKOVIAN MODELS; QUALITY OF SERVICE; SAMPLE PATH STOCHASTIC ORDERING; STOCHASTIC COMPARISON;

ASYNCHRONOUS TRANSFER MODE;

EID: 0033169499     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(99)00026-7     Document Type: Article

References (17)

1. O. Abu-amsha, J.M. Fourneau, N. Pekergin, Bornes stochastiques pour les taux de pertes dans un tampon mémoire ATM, Research Report PRISM, 97/012, 1997.
2. O. Abu-amsha, J.M. Vincent, An algorithm to bound functionals of Markov chains with large state space, Technical Report IMAG-Grenoble, France, RR Mai-25, April 1996.
3. M. Doisy, Comparaison de processus markoviens, Ph.D. thesis, Université de Pau et des Pays de l'Adour, 1992.
4. A. Gravey, G. Hébuterne, Mixing time and loss priorities in a single server queue, ATM Workshop, 13th International Teletraffic Congress, Copenhagen, 1991.
5. J.M. Fourneau, N. Pekergin, H. Taleb, Stochastic bounds and QoS: application to the loss rates in ATM networks, European Simulation Multiconference (ESM'96), Budapest, Hungary, 1996.
6. J.M. Fourneau, N. Pekergin, H. Taleb, An application of stochastic ordering to the analysis of the pushout mechanism, in: D. Kouvatsos (Ed.), Performance Modelling and Evaluation of ATM Networks, Chapman-Hall, London, 1995.
7. J.M. Fourneau, L. Mokdad, N. Pekergin, Bounding the loss rates in a multistage ATM switch, in: Marie et al. (Eds.), Proc. Tools, St. Malo, France, LNCS 1245, Springer, Berlin, 1997.
8. J.C. Muntz, S. Lui, R. Muntz, D. Towsley, Bounding the response time of a minimum expected delay routing system: an algorithmic approach, IEEE Trans. Comput. 44 (12) (1995).
9. T. Kamae, U. Krengel, G.L. O'Brien, Stochastic inequalities on partially ordered spaces, Ann. Probab. 5 (6) (1977) 899-912.
10. J. Keilson, A. Kester, Monotone matrices and monotone Markov processes, Stoch. Process. Appl. 5 (1977) 231-241.
11. W. Massey, A family of bounds for the transient behavior of a Jackson network, J. Appl. Probab. 23 (1986).
12. R. Onvural, Asynchronous Transfer Mode Networks: Performance Issues, Artech House, Boston, 1993.
13. K. Mosler, M. Scarsini, Stochastic Orders and Applications, LNEMS 401, Springer, Berlin, 1993.
14. M. Shaked, G. Shantikumar, Stochastic Orders and Their Applications, Academic Press, Orlando, 1994.
15. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, Wiley, New York, 1976.
16. L. Truffet, Near complete decomposability: bounding the error by stochastic comparison method, Adv. Appl. Probab. 29 (1997).
17. M. Woodward, Communication and Computer Networks: Modelling with Discrete Time Queues, Pentech Press, London, 1993.