Tight performance bounds in the worst-case analysis of feed-forward networks

DOI10.1007/S10626-015-0213-2MaRDI QIDQ312640zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

linear programmingblind multiplexingfeed-forward networksnetwork calculus

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

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.

Cites work

• scientific article; zbMATH DE number 6381648 (Why is no real title available?)
• scientific article; zbMATH DE number 627763 (Why is no real title available?)
• scientific article; zbMATH DE number 2080775 (Why is no real title available?)
• A calculus for network delay. I. Network elements in isolation
• A calculus for network delay. II. Network analysis
• Adversarial queuing theory
• An algorithmic toolbox for network calculus
• Generating Linear Extensions Fast
• Linear programming. Foundations and extensions
• 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.
• Stochastic network calculus.

Cited in

(7)

• Worst-case end-to-end delays evaluation for \texttt{SpaceWire} networks
• Should network calculus relocate? An assessment of current algebraic and optimization-based analyses
• Network calculus for bounding delays in feedforward networks of FIFO queueing systems
• A tight upper bound on the generalization error of feedforward neural networks
• 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
• On the stochastic end-to-end delay analysis in sink trees under independent and dependent arrivals

Describes a project that uses

Uses Software

• DISCO

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)