An algorithmic toolbox for network calculus

DOI10.1007/s10626-007-0028-xzbMath1162.90364MaRDI 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 complexity; network calculus; algorithmics; functional (min,\(+\)) algebra

Mathematics Subject Classification ID

90B18: Communication networks in operations research

90B22: Queues and service in operations research

65Y20: Complexity and performance of numerical algorithms

Related Items

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

Uses Software

• RTC toolbox
• DISCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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