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

DOI10.1007/s10626-015-0213-2zbMath1345.90026OpenAlexW895546470WikidataQ57310976 ScholiaQ57310976MaRDI QIDQ312640

Éric Thierry, Anne Bouillard

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

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

Related Items (1)

On the Stochastic End-to-End Delay Analysis in Sink Trees Under Independent and Dependent Arrivals

Uses Software

• DISCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• Adversarial queuing theory
• A calculus for network delay. I. Network elements in isolation
• A calculus for network delay. II. Network analysis
• Generating Linear Extensions Fast
• Linear programming. Foundations and extensions

This page was built for publication: Tight performance bounds in the worst-case analysis of feed-forward networks