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

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 <i>arrival curves</i> and <i>service curves</i>. 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.

DOI: 10.1145/2071589.2071595

13 Figures and Tables

Cite this paper

@inproceedings{Boyer2011AnEA, title={An efficient and simple class of functions to model arrival curve of packetised flows}, author={Marc Boyer and J246rn Migge and Nicolas Navet}, booktitle={WCTT '11}, year={2011} }