Tight performance bounds in the worst-case analysis of feed-forward networks
DOI10.1007/S10626-015-0213-2zbMATH Open1345.90026DBLPjournals/deds/BouillardT16OpenAlexW895546470WikidataQ57310976 ScholiaQ57310976MaRDI QIDQ312640FDOQ312640
Authors: Anne Bouillard, Eric Thierry 
Publication date: 16 September 2016
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01583622/file/jdeds-lp.pdf
Recommendations
- Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
- Network calculus for bounding delays in feedforward networks of FIFO queueing systems
- Should network calculus relocate? An assessment of current algebraic and optimization-based analyses
- An algorithmic toolbox for network calculus
- Scaling properties of statistical end-to-end bounds in the network calculus.
Linear programming (90C05) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- A calculus for network delay. I. Network elements in isolation
- Generating Linear Extensions Fast
- A calculus for network delay. II. Network analysis
- An algorithmic toolbox for network calculus
- Performance evaluation of network processor architectures: Combining simulation with analytical estimation.
- Title not available (Why is that?)
- Adversarial queuing theory
- Stochastic network calculus.
- Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
- Title not available (Why is that?)
- Linear programming. Foundations and extensions
Cited In (7)
- A tight upper bound on the generalization error of feedforward neural networks
- Network calculus for bounding delays in feedforward networks of FIFO queueing systems
- Tight arrival curve at the output of a work-conserving blind multiplexing server
- 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
- Should network calculus relocate? An assessment of current algebraic and optimization-based analyses
- On the stochastic end-to-end delay analysis in sink trees under independent and dependent arrivals
Uses Software
This page was built for publication: Tight performance bounds in the worst-case analysis of feed-forward networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312640)
