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

@article{Bouillard2016TightPB, title={Tight performance bounds in the worst-case analysis of feed-forward networks}, author={Anne Bouillard and Eric Thierry}, journal={Discrete Event Dynamic Systems}, year={2016}, volume={26}, pages={383-411} }

Network Calculus theory aims at evaluating worst-case performances in communication networks. It provides methods to analyze models where the traffic and the services are constrained by some minimum and/or maximum envelopes (arrival/service curves). While new applications come forward, a challenging and inescapable issue remains open: achieving tight analyzes of networks with aggregate multiplexing. The theory offers efficient methods to bound maximum end-to-end delays or local backlogs…

## Topics from this paper

## 29 Citations

Enhancing Performance Bounds of Multiple-Ring Networks with Cyclic Dependencies based on Network Calculus.

- Computer Science
- 2016

The efficiency of the PMOC approach to provide timing guarantees is confirmed in the case of a realistic avionics application, and a noticeable enhancement of the delay bounds, thus network resource efficiency and scalability is highlighted under this proposal with reference to conventional approaches.

Analysis of worst-case backlog bounds for Networks-on-Chip

- Computer ScienceJ. Syst. Archit.
- 2014

This paper proposes a method called DiGB (DIrected-contention-Graph-based Backlog bound derivation) to analyze worst-case backlog bounds, and presents the derivation of closed-form formulas to compute the worst- case backlog bounds under all-to-one gather communication.

Exact Worst-Case Delay in FIFO-Multiplexing Feed-Forward Networks

- Mathematics, Computer ScienceIEEE/ACM Transactions on Networking
- 2015

In this paper, we compute the actual worst-case end-to-end delay for a flow in a feed-forward network of first-in-first-out (FIFO)-multiplexing service curve nodes, where flows are shaped by…

Calculating Accurate End-to-End Delay Bounds - You Better Know Your Cross-Traffic

- Computer ScienceEAI Endorsed Trans. Ubiquitous Environ.
- 2016

By replacing the currently used procedure to bound cross-traffic arrivals with a new method, this work can improve network calculus accuracy considerably and demonstrate improvements that reduce the worst-case delay bound by more than factor 6.

The Case for a Network Calculus Heuristic: Using Insights from Data for Tighter Bounds

- Computer Science2018 30th International Teletraffic Congress (ITC 30)
- 2018

This paper makes the case for a network calculus heuristic based on graph-based deep learning in order to predict the bounds produced by a given network analysis method, and shows that the computational cost of the heuristic makes it of practical use.

Worst-Case Performance Analysis of Feed-Forward Networks - An Efficient and Accurate Network Calculus

- Computer Science
- 2016

This thesis presents the first NC analysis that is both accurate and computationally feasible at the same time, and allows NC to scale to larger, more complex systems that require formal verification of their real-time capabilities.

Algorithms and efficiency of Network calculus

- Mathematics, Computer Science
- 2014

This document presents some results obtained in the field of network calculus, a theory based on the (min,plus) algebra and whose aim is to compute worst-case performance bounds in communication networks, and improves the performance bounds computed using this theory.

Iterative design space exploration for networks requiring performance guarantees

- Computer Science2017 IEEE/AIAA 36th Digital Avionics Systems Conference (DASC)
- 2017

This paper provides detailed insight on the aspect preceding the DNC analysis: the network modeling step and contributes multiple algorithms for iterative design space exploration within the limits of modeling that employ the most accurate DNC analysis.

Advances in Theory and Applicability of Stochastic Network Calculus

- Mathematics
- 2016

Stochastic Network Calculus (SNC) emerged from two branches in the late 90s:
the theory of effective bandwidths and its predecessor the Deterministic Network
Calculus (DNC). As such SNC’s goal is…

Improving Delay Bounds in the Stochastic Network Calculus by Using less Stochastic Inequalities

- Computer ScienceVALUETOOLS
- 2020

This work shows that two simple, yet effective techniques related to the deterministic network calculus are able to improve the delay analysis in many scenarios, while at the same time enabling a considerably faster computation.

## References

SHOWING 1-10 OF 34 REFERENCES

Tight Performance Bounds in the Worst-Case Analysis of Feed-Forward Networks

- Computer Science2010 Proceedings IEEE INFOCOM
- 2010

The first algorithm which computes the maximum end-to-end delay for a given flow, as well as the maximum backlog at a server, for any feed-forward network under blind multiplexing, with concave arrival curves and convex service curves is described.

Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...

- Computer ScienceIEEE INFOCOM 2008 - The 27th Conference on Computer Communications
- 2008

This paper addresses the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing and finds that direct application of network calculus results in loose bounds even in seemingly simple scenarios.

Delay Bounds under Arbitrary Multiplexing

- Computer Science
- 2007

It is found that direct application of network calculus results in loose bounds even in seemingly simple scenarios, and a method to arrive at tight delay bounds for arbitrary (aggregate) multiplexing is presented based on the solution of an optimization problem.

Optimal routing for end-to-end guarantees using Network Calculus

- Mathematics, Computer SciencePerform. Evaluation
- 2008

It is shown how Network Calculus can be used to compute the optimal route for a flow in a network in the presence of cross-traffic and how to adapt routing algorithms to have optimal end-to-end guarantees for these new bounds on delays and backlogs which take into account PMOO.

Estimating the worst-case delay in FIFO tandems using network calculus

- Mathematics, Computer ScienceVALUETOOLS
- 2008

This paper addresses the problem of estimating the worst-case end-to-end delay for a flow in a tandem of FIFO multiplexing nodes by devise a method to compute improved delay bounds and shows that the gap between the upper and lower bounds is quite small in many practical cases, which implicitly validates the upper bounds themselves.

Worst-case delay bounds with fixed priorities using network calculus

- Mathematics, Computer ScienceVALUETOOLS
- 2011

This article focuses on networks with a fixed priority service policy and provides methods to analyze systems where the traffic and the services are constrained by some minimum and/or maximum functions: arrival/service curves.

Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers

- Computer ScienceIEEE INFOCOM 2008 - The 27th Conference on Computer Communications
- 2008

A nonlinear operator on a vector space of finite (but large) dimension is identified, and a first sufficient condition for stability is derived, based on the super-additive closure of this operator, which is valid in an heterogeneous environment and without any of the restrictions of existing results.

Stochastic Network Calculus

- Computer Science
- 2004

A stochastic network calculus is proposed to systematically analyze the end-to-end Stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastics servers.

Tightening end to end delay upper bound for AFDX network calculus with rate latency FIFO servers using network calculus

- Computer Science2008 IEEE International Workshop on Factory Communication Systems
- 2008

Two new results are presented when a sum of some shaped flows crosses one single network element: the first one considers the global aggregated flow, and the second one considers each individual flow, assuming FIFO policy.

A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems

- Mathematics, Computer SciencePerform. Evaluation
- 2008

This paper addresses the problem of finding end-to-end delay bounds for single leaky-bucket shaped flows subject to FIFO multiplexing in tandems of rate-latency nodes with a methodology, called the Least Upper Delay Bound (LUDB) method, which is based on Network Calculus.