By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Benmammoun, M. ; PRiSM, Univ. de Versailles Saint-Quentin, France ; Fourneau, J.M. ; Pekergin, N. ; Troubnikoff, A.

Stochastic bounds and deterministic bounds (for instance network calculus) are promising methods to analyze QoS requirements for high speed networks. Indeed, it is sufficient to prove that a bound of the real performance satisfies the guarantee. However, stochastic bounds are quite difficult to prove and often require some sample-path proofs. We present a new method based on stochastic ordering, algorithmic derivation of simpler Markov chains, and numerical analysis of these chains. The performance indices defined by reward functions are stochastically bounded by reward functions computed on much simpler or smaller Markov chains. This leads to an important reduction of numerical complexity.

Published in:

Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002. MASCOTS 2002. Proceedings. 10th IEEE International Symposium on

Date of Conference:

2002