A simple and efficient class of functions to model arrival curve of packetised flows

Marc Boyer 1 Jörn Migge 2 Nicolas Navet 3
3 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Network Calculus is a generic theory conceived to compute upper bounds on network traversal times (WCTT - Worst Case Traversal Time). This theory models traffic constraints and service contracts with arrival curves and service curves. As usual in modelling, the more realistic the model is, the more accurate the results are, however a detailed model implies large running times which may not be the best option at each stage of the design cycle. Sometimes, a trade-off must be found between result accuracy and computation time. This paper proposes a combined use of two simple class of curves in order to produce accurate results with a low computational complexity. Experiments are then conducted on a realistic AFDX case-study to benchmark the proposal against two existing approaches.
Type de document :
Communication dans un congrès
First International Workshop on Worst-case Traversal Time (WCTT 2011), Nov 2011, Vienna, Austria. 2011
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00645119
Contributeur : Nicolas Navet <>
Soumis le : samedi 26 novembre 2011 - 10:46:19
Dernière modification le : mercredi 28 mars 2018 - 14:16:10
Document(s) archivé(s) le : vendredi 16 novembre 2012 - 12:06:02

Fichier

ShapedStairs_WCTT11.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00645119, version 1

Collections

Citation

Marc Boyer, Jörn Migge, Nicolas Navet. A simple and efficient class of functions to model arrival curve of packetised flows. First International Workshop on Worst-case Traversal Time (WCTT 2011), Nov 2011, Vienna, Austria. 2011. 〈hal-00645119〉

Partager

Métriques

Consultations de la notice

279

Téléchargements de fichiers

132