Network calculus for bounding delays in feedforward networks of FIFO queueing systems

DOI10.1007/978-3-030-85172-9_8zbMATH Open1491.68031OpenAlexW3195513487MaRDI QIDQ832064FDOQ832064

Authors: Alexander Scheffler, Steffen Bondorf 

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85172-9_8

Recommendations

• 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
• A calculus for network delay. I. Network elements in isolation
• Should network calculus relocate? An assessment of current algebraic and optimization-based analyses
• Towards Certifying Network Calculus

Mathematics Subject Classification ID

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

Cites Work

• A calculus for network delay. I. Network elements in isolation
• An algorithmic toolbox for network calculus
• Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
• Network calculus. A theory of deterministic queueing systems for the Internet
• Stability and performance bounds in cyclic networks using network calculus
• Title not available (Why is that?)

Cited In (4)

• 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
• Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks
• A calculus for network delay. II. Network analysis

Uses Software

• DeepTMA
• DiscoDNC

This page was built for publication: Network calculus for bounding delays in feedforward networks of FIFO queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832064)