Thumbnail - Request a copy

Loss rates bounds in IP buffers by Markov chains aggregations

Castel-Taleb, Hind; Mokdad, Lynda; Pekergin, Nihal (2007), Loss rates bounds in IP buffers by Markov chains aggregations, IEEE/ACS International Conference on Computer Systems and Applications, 2007. AICCSA '07., IEEE Computer Society, p. 623-630. http://dx.doi.org/10.1109/AICCSA.2007.370695

Type
Communication / Conférence
Date
2007
Conference title
5th ACS/IEEE International Conference on Computer Systems and Applications, AICCSA 2007
Conference date
2007-05
Conference city
Amman
Conference country
Jordanie
Book title
IEEE/ACS International Conference on Computer Systems and Applications, 2007. AICCSA '07.
Publisher
IEEE Computer Society
ISBN
1-4244-1030-4
Pages
623-630
Publication identifier
Metadata
Show full item record
Author(s)
Castel-Taleb, Hind
Mokdad, Lynda
Pekergin, Nihal cc
Abstract (EN)
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.
Subjects / Keywords
MPLS networks; Markov Chains