An algorithmic approach to stochastic bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2459, Issue , 2002, Pages 64-88

  Fourneau, J M ^a   Pekergin, N ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; MARKOV PROCESSES; QUALITY OF SERVICE;

ALGORITHMIC APPROACH; NUMERICAL COMPLEXITY; PERFORMANCE INDICES; QOS REQUIREMENTS; REWARD FUNCTION; STOCHASTIC BOUND; STOCHASTIC ORDER;

STOCHASTIC SYSTEMS;

EID: 84957048821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45798-4_4     Document Type: Conference Paper

References (38)

1. Abu-Amsha O., Vincent J.-M.: An algorithm to bound functionals of Markov chains with large state space. Int: 4th INFORMS Conference on Telecommunications, Boca Raton, Florida, (1998).
2. Benmammoun M.: Encadrement stochastiques et évaluation de performances des réseaux, PHD, Université de Versailles St-Quentin en Yvelines, (2002).
3. Benmammoun M., Fourneau J.M., Pekergin N., Troubnikoff A.: An algorithmic and numerical approach to bound the performance of high speed networks, Submitted, (2002).
4. Benmammoun M., Pekergin N.: Closed form stochastic bounds on the stationary distribution of Markov chains. To appear in Probability in the Engineering and Informational Sciences, (2002).
5. Boujdaine F., Dayar T., Fourneau J.M., Pekergin N., Saadi S., Vincent J.M.: A new proof of st-comparison for polynomials of a stochastic matrix, Submitted, (2002).
6. Buchholz P.: An aggregation\disaggregation algorithm for stochastic automata networks. In: Probability in the Engineering and Informational Sciences, V 11, (1997) 229–253.
7. Buchholz P.: Projection methods for the analysis of stochastic automata networks. In: Proc. Of the 3rd International Workshop on the Numerical Solution of Markov Chains, B. Plateau, W. J. Stewart, M. Silva, (Eds.), Prensas Universitarias de Zaragoza, Spain, (1999) pp. 149–168.
8. Courtois P.J., Semal P.: Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition. In: Journal of ACM, V 31 (1984) 804–825.
9. Courtois P.J., Semal P.: Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models. In: IEEE JSAC, V4, N6, (1986).
10. Dayar T., Fourneau J.M., Pekergin N.: Transforming stochastic matrices for stochastic comparison with the st-order, Submitted, (2002).
11. Dayar T., Pekergin, N.: Stochastic comparison, reorderings, and nearly completely decomposable Markov chains. In: Proceedings of the International Conference on the Numerical Solution of Markov Chains (NSMC’99), (Ed. Plateau, B. Stewart, W.), Prensas universitarias de Zaragoza. (1999) 228–246.
12. Dayar T., Stewart W. J.: Comparison of partitioning techniques for two-level iterative solvers on large sparse Markov chains. In: SIAM Journal on Scientific Computing V21 (2000) 1691–1705.
13. Donatelli S.: Superposed generalized stochastic Petri nets: definition and efficient solution. In: Proc. 15th Int. Conf. On Application and Theory of Petri Nets, Zaragoza, Spain, (1994).
14. Feinberg B.N., Chiu S.S.: A method to calculate steady-state distributions of large Markov chains by aggregating states. In: Oper. Res, V 35 (1987) 282-290.
15. Fernandes P., Plateau B., Stewart W.J.: Efficient descriptor-vector multiplications in stochastic automata networks. In: Journal of the ACM, V45 (1998) 381–414.
16. Fourneau J.M., Pekergin N., Taleb H.: An Application of Stochastic Ordering to the Analysis of the PushOut Mechanism. In Performance Modelling and Evaluation of ATM Networks, Chapman and Hall, (1995) 227–244.
17. Fourneau J.M., Quessette F.: Graphs and Stochastic Automata Networks. In: Proceedings of the 2nd Int. Workshop on the Numerical Solution of Markov Chains, Raleigh, USA, (1995).
18. Hébuterne G., Gravey A.: A space priority queueing mechanism for multiplexing ATM channels. In: ITC Specialist Seminar, Computer Network and ISDN Systems, V20 (1990) 37–43.
19. Golubchik, L. And Lui, J.: Bounding of performance measures for a threshold-based queuing systems with hysteresis. In: Proceeding of ACM SIGMETRICS’97, (1997) 147–157.
20. Hillston J., Kloul L.: An Efficient Kronecker Representation for PEPA Models. In: PAPM’2001, Aachen Germany, (2001).
21. Keilson J., Kester A.: Monotone matrices and monotone Markov processes. In: Stochastic Processes and Their Applications, V5 (1977) 231–241.
22. Kijima M.: Markov Processes for stochastic modeling. Chapman & Hall (1997).
23. Latouche G., Ramaswami V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM, (1999).
24. Lui, J., Muntz, R. And Towsley, D.: Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach. In: IEEE Transactions on Computers. V44 N12 (1995) 1371–1382.
25. Lui, J., Muntz, R. And Towsley, D.: Computing performance bounds of Fork-Join parallel programs under a multiprocessing environment. In: IEEE Transactions on Parallel and Distributed Systems. V9 N3 (1998) 295–311.
26. Meyer C.D.: Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. In: SIAM Review. V31 (1989) 240–272.
27. Pekergin N.: Stochastic delay bounds on fair queueing algorithms. In: Proceedings of INFOCOM’99 New York (1999) 1212–1220.
28. Pekergin N.: Stochastic performance bounds by state reduction. In: Performance Evaluation V36-37 (1999) 1–17.
29. Plateau B.: On the stochastic structure of parallelism and synchronization models for distributed algorithms. In: Proceedings of the SIGMETRICS Conference on Measurement and Modeling of Computer Systems, Texas (1985) 147–154.
30. Plateau B., Fourneau J.-M., Lee K.-H.: PEPS: A package for solving complex Markov models of parallel systems. In: Modeling Techniques and Tools for Computer Performance Evaluation, R. Puigjaner, D. Potier (Eds.), Spain (1988) 291–305.
31. Plateau B., Fourneau J.-M.: A methodology for solving Markov models of parallel systems. In: Journal of Parallel and Distributed Computing. V12 (1991) 370–387.
32. Shaked M., Shantikumar J.G.: Stochastic Orders and Their Applications. In: Academic Press, California (1994).
33. Stewart W.J., Atif K., Plateau B.: The numerical solution of stochastic automata networks. In: European Journal of Operational Research V86 (1995) 503–525.
34. Stewart W. J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, (1994).
35. Stoyan D.: Comparison Methods for Queues and Other Stochastic Models. John Wiley & Sons, Berlin, Germany, (1983).
36. Truffet L.: Reduction Technique For Discrete Time Markov Chains on Totally Ordered State Space Using Stochastic Comparisons. In: Journal of Applied Probability, V37 N3 (2000).
37. Uysal E., Dayar T.: Iterative methods based on splittings for stochastic automata networks. In: European Journal of Operational Research, V 110 (1998) 166–186.
38. Van Dijk N.: Error bound analysis for queueing networks” In: Performane 96 Tutorials, Lausanne, (1996).