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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007
Publisher	IEEE Computer Society
Pages	623-630
Number of pages	8
ISBN (Print)	1424410312, 9781424410316
DOIs	https://doi.org/10.1109/AICCSA.2007.370695
Publication status	Published - 1 Jan 2007
Externally published	Yes
Event	2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007 - Amman, Jordan Duration: 13 May 2007 → 16 May 2007

Publication series

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

Conference

Conference	2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007
Country/Territory	Jordan
City	Amman
Period	13/05/07 → 16/05/07

Keywords

Loss rates
MPLS networks
Markov chains
QoS
Stochastic comparison

Access to Document

10.1109/AICCSA.2007.370695

Cite this

Castel, H., Mokdad, L., & Pekergin, N. (2007). Loss rates bounds in IP buffers by Markov chains aggregations. In 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007 (pp. 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. in 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, pp. 623-630, 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, Jordan, 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).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this