An algorithmic toolbox for network calculus

DOI10.1007/s10626-007-0028-xzbMath1162.90364OpenAlexW2101112998MaRDI QIDQ1020549

Éric Thierry, Anne Bouillard

Publication date: 29 May 2009

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00123643v2/file/RR-6094.pdf

zbMATH Keywords

computational complexitynetwork calculusalgorithmicsfunctional (min,\(+\)) algebra

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22) Complexity and performance of numerical algorithms (65Y20)

Related Items (10)

Network calculus for bounding delays in feedforward networks of FIFO queueing systems ⋮ Fast weak–KAM integrators for separable Hamiltonian systems ⋮ Tight performance bounds in the worst-case analysis of feed-forward networks ⋮ Causality problem in real-time calculus ⋮ Analysis and control of max-plus linear discrete-event systems: an introduction ⋮ Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition ⋮ Modelling and control of periodic time-variant event graphs in dioids ⋮ Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks ⋮ Container of (min,+)-linear systems ⋮ An algorithmic toolbox for network calculus

Uses Software

• RTC toolbox
• DISCO

Cites Work

• Finding the upper envelope of n line segments in O(n log n) time
• An algorithmic toolbox for network calculus
• Some dynamic computational geometry problems
• Conjugate network calculus: A dual approach applying the Legendre transform
• An Output-Sensitive Convex Hull Algorithm for Planar Objects
• Network calculus. A theory of deterministic queueing systems for the Internet
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithmic toolbox for network calculus