An algorithmic and numerical approach to bound the performance of high speed networks

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

Volumn 2002-January, Issue , 2002, Pages 375-382

  Benmammoun, M ^a   Fourneau, J M ^a   Pekergin, N ^a   Troubnikoff, A ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; CHAINS; COMPLEX NETWORKS; HIGH SPEED NETWORKS; MARKOV PROCESSES; NUMERICAL METHODS; QUALITY OF SERVICE;

NETWORK CALCULUS; NUMERICAL APPROACHES; NUMERICAL COMPLEXITY; PERFORMANCE INDICES; QOS REQUIREMENTS; REWARD FUNCTION; STOCHASTIC BOUND; STOCHASTIC ORDER;

STOCHASTIC SYSTEMS;

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

References (26)

1. O. Abu-Amsha, J.-M. Vincent, "An algorithm to bound functionals of Markov chains with large state space", 4th INFORMS Conference on Telecommunications, Boca Raton, Florida, 1998.
2. M. Benmammoun, N. Pekergin, "Closed form stochastic bounds on the stationary distribution of Markov chains", To appear in Probability in the Engineering and Informational Sciences, 2002.
3. P. Buchholz, "An aggregation\disaggregation algorithm for stochastic automata networks", Probability in the Engineering and Informational Sciences, 11 (1997), 229-253.
4. P.J. Courtois, P. Semal, "Computable bounds for conditional steady-state probabilities in large Markov chains and queueing models" IEEE JSAC, 4(6), 1986.
5. T. Dayar, J.M. Fourneau, N. Pekergin, "Transforming stochastic matrices for stochastic comparison with the st-order", Submitted, 2001.
6. S. Donatelli, "Superposed generalized stochastic Petri nets: definition and efficient solution", Proc. 15th Int. Conf. on Application and Theory of Petri Nets, Zaragoza, Spain, June 1994.
7. P. Fernandes, B. Plateau, W.J. Stewart, "Efficient descriptor-vector multiplications in stochastic automata networks", JACM, 45 (1998), 381-414.
8. J.M. Fourneau, F. Quessette, "Graphs and Stochastic Automata Networks", Proceedings of the 2nd Int. Workshop on the Numerical Solution of Markov Chains, Raleigh, USA, (1995)
9. L. Golubchik, J. Lui, "Bounding of performance measures for a threshold-based queuing systems with hysteresis", Proceeding of ACM SIGMETRICS'97, (1997) 147-157
10. G. Hébuterne and A. Gravey, "A space priority queueing mechanism for multiplexing ATM channels", ITC Specialist Seminar, Computer Network and ISDN Systems, Vol. 20 (Dec. 90), 37-43.
11. J. Hillston, L. Kloul, "An Efficient Kronecker Representation for PEPA Models", PAPM'2001, Sept. 2001, Aachen Germany
12. J. Keilson, A. Kester, "Monotone matrices and monotone Markov processes", Stochastic Processes and Their Applications, 5 (1977), 231-241.
13. J. Lui, R. Muntz, D. Towsley, "Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach", IEEE Trans. on Computers, V44 N12 (1995), 1371-1382
14. J. Lui, R. Muntz, D. Towsley, "Computing performance bounds of Fork-Join parallel programs under a multiprocessing environment", IEEE Trans. on Parallel and Distributed Systems, V9 N3 (1998), 295-311
15. C.D. Meyer, "Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems", SIAM Review, 31 (1989), 240-272.
16. N. Pekergin, "Stochastic delay bounds on fair queueing algorithms", Proceedings of INFOCOM'99, New York, 1999, 1212-1220.
17. N. Pekergin, "Stochastic performance bounds by state reduction", Performance Evaluation 36-37 (1999) 1-17.
18. B. Plateau, "On the stochastic structure of parallelism and synchronization models for distributed algorithms", Proc. of the SIGMETRICS Conference, Texas, 1985, 147-154.
19. B. Plateau, J.-M. Fourneau, "A methodology for solving Markov models of parallel systems", Journal of Parallel and Distributed Computing 12 (1991) 370-387.
20. M. Shaked, J.G. Shantikumar, "Stochastic Orders and Their Applications", Academic Press, 1994.
21. W.J. Stewart, "Introduction to the Numerical Solution of Markov Chains", Princeton University Press, 1994.
22. W.J. Stewart, K. Atif, B. Plateau, "The numerical solution of stochastic automata networks", European Journal of Operational Research, 86 (1995), 503-525.
23. D. Stoyan, "Comparison Methods for Queues and Other Stochastic Models", Wiley, 1983.
24. L. Truffet, "Reduction Technique For Discrete Time Markov Chains on Totally Ordered State Space Using Stochastic Comparisons", Journal of Applied Probability, 37, 3, 2000.
25. E. Uysal, T. Dayar, "Iterative methods based on splittings for stochastic automata networks", European Journal of Operational Research, 110 (1998), 166-186.
26. N. Van Dijk, "Error bound analysis for queueing networks", Performance 96 Tutorials, Lausanne, 1996.