Skip to main navigation Skip to search Skip to main content

Loss rates bounds in IP buffers by Markov chains aggregations

  • Hind Castel
  • , Lynda Mokdad
  • , Nihal Pekergin
  • CNRS UMR 5157 SAMOVAR
  • Université Paris Dauphine
  • Université Panthéon-Sorbonne (Paris 1)
  • CNRS and PRiSM

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 languageEnglish
Title of host publication2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007
PublisherIEEE Computer Society
Pages623-630
Number of pages8
ISBN (Print)1424410312, 9781424410316
DOIs
Publication statusPublished - 1 Jan 2007
Externally publishedYes
Event2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007 - Amman, Jordan
Duration: 13 May 2007 → 16 May 2007

Publication series

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

Conference

Conference2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007
Country/TerritoryJordan
CityAmman
Period13/05/07 → 16/05/07

Keywords

  • Loss rates
  • MPLS networks
  • Markov chains
  • QoS
  • Stochastic comparison

Fingerprint

Dive into the research topics of 'Loss rates bounds in IP buffers by Markov chains aggregations'. Together they form a unique fingerprint.

Cite this