An Algorithmic Toolbox for Network Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

An Algorithmic Toolbox for Network Calculus


Network Calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathematical ground, notably by the use of (min,+) algebra. However the algorithmic aspects of this theory have not been much addressed yet. This paper is an attempt to provide some efficient algorithms implementing Network Calculus operations for some classical functions. Some functions which are often used are the piecewise affine functions which ultimately have a constant growth. As a first step towards algorithmic design, we present a class containing these functions and closed under the Network Calculus operations: the piecewise affine functions which are ultimately pseudo-periodic. They can be finitely described which enables us to propose some algorithms for each of the Network Calculus operations. We finally analyze their computational complexity.
Fichier principal
Vignette du fichier
RR-6094.pdf (464.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00123643 , version 1 (10-01-2007)
inria-00123643 , version 2 (11-01-2007)


  • HAL Id : inria-00123643 , version 2


Anne Bouillard, Eric Thierry. An Algorithmic Toolbox for Network Calculus. [Research Report] RR-6094, INRIA. 2007, pp.44. ⟨inria-00123643v2⟩
534 View
403 Download


Gmail Facebook X LinkedIn More