Loss rates bounds in IP buffers by Markov chains aggregations

Hind Castel; Lynda Mokdad; Nihal Pekergin

doi:10.1109/AICCSA.2007.370695

Loss rates bounds in IP buffers by Markov chains aggregations

Hind Castel
, Lynda Mokdad
, Nihal Pekergin

CNRS UMR 5157 SAMOVAR
Université Paris Dauphine
Centre Marin Mersenne
Université Panthéon-Sorbonne (Paris 1)
CNRS and PRiSM

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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.

langue originale	Anglais
titre	2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007
Editeur	IEEE Computer Society
Pages	623-630
Nombre de pages	8
ISBN (imprimé)	1424410312, 9781424410316
Les DOIs	https://doi.org/10.1109/AICCSA.2007.370695
état	Publié - 1 janv. 2007
Modification externe	Oui
Evénement	2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007 - Amman, Jordanie Durée: 13 mai 2007 → 16 mai 2007

Série de publications

Nom	2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007

Une conférence

Une conférence	2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007
Pays/Territoire	Jordanie
La ville	Amman
période	13/05/07 → 16/05/07

Accès au document

10.1109/AICCSA.2007.370695

Contient cette citation

Castel, H., Mokdad, L., & Pekergin, N. (2007). Loss rates bounds in IP buffers by Markov chains aggregations. Dans 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007 (p. 623-630). Article 4231023 (2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007). IEEE Computer Society. https://doi.org/10.1109/AICCSA.2007.370695

@inproceedings{117c0953427c4b279d71b7a0b00f0088,

title = "Loss rates bounds in IP buffers by Markov chains aggregations",

abstract = "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.",

keywords = "Loss rates, MPLS networks, Markov chains, QoS, Stochastic comparison",

author = "Hind Castel and Lynda Mokdad and Nihal Pekergin",

year = "2007",

month = jan,

day = "1",

doi = "10.1109/AICCSA.2007.370695",

language = "English",

isbn = "1424410312",

series = "2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007",

publisher = "IEEE Computer Society",

pages = "623--630",

booktitle = "2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007",

note = "2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007 ; Conference date: 13-05-2007 Through 16-05-2007",

}

Castel, H, Mokdad, L & Pekergin, N 2007, Loss rates bounds in IP buffers by Markov chains aggregations. Dans 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007., 4231023, 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, IEEE Computer Society, p. 623-630, 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, Jordanie, 13/05/07. https://doi.org/10.1109/AICCSA.2007.370695

Loss rates bounds in IP buffers by Markov chains aggregations. / Castel, Hind; Mokdad, Lynda; Pekergin, Nihal.
2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007. IEEE Computer Society, 2007. p. 623-630 4231023 (2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - Loss rates bounds in IP buffers by Markov chains aggregations

AU - Castel, Hind

AU - Mokdad, Lynda

AU - Pekergin, Nihal

PY - 2007/1/1

Y1 - 2007/1/1

N2 - 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.

AB - 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.

KW - Loss rates

KW - MPLS networks

KW - Markov chains

KW - QoS

KW - Stochastic comparison

U2 - 10.1109/AICCSA.2007.370695

DO - 10.1109/AICCSA.2007.370695

M3 - Conference contribution

AN - SCOPUS:36249028670

SN - 1424410312

SN - 9781424410316

T3 - 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007

SP - 623

EP - 630

BT - 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007

PB - IEEE Computer Society

T2 - 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007

Y2 - 13 May 2007 through 16 May 2007

ER -

Loss rates bounds in IP buffers by Markov chains aggregations

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation