An Algorithmic and Numerical Approach to Bound the Performance of High Speed Networks

  • Authors:

  • M. Benmammoun;J. M. Fourneau;N. Pekergin;A. Troubnikoff

  • Affiliations:

  • -;-;-;-

  • Venue:
  • MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
  • Year:
  • 2002

  • Stochastic model checking with stochastic comparison

    EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes

Quantified Score

Hi-index 0.00

Visualization

Abstract

Stochastic bounds and deterministic bounds (for instanceNetwork Calculus) are promising methods to analyzeQoS requirements for high speed networks. Indeed itis sufficient to prove that a bound of the real performancesatisfies the guarantee. However stochastic bounds arequite difficult to prove and often require some sample-pathproofs. Here, we present a new method based on stochasticordering, algorithmic derivation of simpler Markovchains and numerical analysis of these chains. The performanceindices defined by reward functions are stochasticallybounded by reward functions computed on much simpleror smaller Markov chains. This leads to an importantreduction of numerical complexity.