By Topic

Loss rates bounds in IP buffers by Markov chains aggregations

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

3 Author(s)
Castel, Hind ; GET/INT/SAMOVAR, Evry ; Mokdad, L. ; Pekergin, N.

We use a mathematical method based on stochastic comparison of multidimensional Markov chains in order to compute packet loss rates in IP routers for MPLS networks. The key idea of this methodology is that given a complex system represented by a Markov chain which is too large to be solved, we propose to build smaller Markov chains providing performance measures bounds.

Published in:

Computer Systems and Applications, 2007. AICCSA '07. IEEE/ACS International Conference on

Date of Conference:

13-16 May 2007