Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks

DOI10.1007/s11241-012-9153-1zbMath1243.68100OpenAlexW2000292643MaRDI QIDQ438224

Luca Bisti, Enzo Mingozzi, Giovanni Stea, Luciano Lenzini

Publication date: 30 July 2012

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11241-012-9153-1

zbMATH Keywords

FIFOnumerical analysisnetwork calculusdelay bounds

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Network calculus for bounding delays in feedforward networks of FIFO queueing systems ⋮ Tight performance bounds in the worst-case analysis of feed-forward networks ⋮ Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks

Cites Work

• Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
• An algorithmic toolbox for network calculus
• Performance evaluation of network processor architectures: Combining simulation with analytical estimation.
• A calculus for network delay. I. Network elements in isolation
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Network calculus. A theory of deterministic queueing systems for the Internet
• Unnamed Item

This page was built for publication: Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks