Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
From MaRDI portal
(Redirected from Publication:438224)
Recommendations
- Tight performance bounds in the worst-case analysis of feed-forward networks
- Network calculus for bounding delays in feedforward networks of FIFO queueing systems
- Scaling properties of statistical end-to-end bounds in the network calculus.
- A Min-Plus Calculus for End-to-End Statistical Service Guarantees
- Integrated end-to-end delay analysis for regulated ATM networks
Cites work
- scientific article; zbMATH DE number 1393308 (Why is no real title available?)
- A calculus for network delay. I. Network elements in isolation
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- An algorithmic toolbox for network calculus
- Network calculus. A theory of deterministic queueing systems for the Internet
- Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
- Performance evaluation of network processor architectures: Combining simulation with analytical estimation.
Cited in
(7)- Network calculus for bounding delays in feedforward networks of FIFO queueing systems
- Determining the worst-case synchronous message response time in FDDI networks
- 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
- Integrated end-to-end delay analysis for regulated ATM networks
- Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks
- On the stochastic end-to-end delay analysis in sink trees under independent and dependent arrivals
This page was built for publication: Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438224)
