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

@article{Bouillard2015ExactWD,
  title={Exact Worst-Case Delay in FIFO-Multiplexing Feed-Forward Networks},
  author={Anne Bouillard and Giovanni Stea},
  journal={IEEE/ACM Transactions on Networking},
  year={2015},
  volume={23},
  pages={1387-1400}
}
  • A. Bouillard, G. Stea
  • Published 1 October 2015
  • Mathematics, Computer Science
  • IEEE/ACM Transactions on Networking
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 piecewise-affine concave arrival curves, and service curves are piecewise affine and convex. We show that the worst-case delay problem can be formulated as a mixed integer linear programming problem, whose size grows exponentially with the number of nodes involved. Furthermore, we present approximate… 
Delay Bounds in Feed-Forward Networks - A Fast and Accurate Network Calculus Solution
TLDR
This article derives a novel, fast algebraic delay analysis that enables the analysis of large-scale networks by reducing the computation time by several orders of magnitude in contrast to the optimization analysis and stays within close range in networks where optimization is still feasible.
Trade-off between accuracy and tractability of network calculus in FIFO networks
TLDR
A new algorithm based on linear programming that presents a trade-off between accuracy and tractability is proposed for computing deterministic performance bounds in FIFO networks in the network calculus framework.
Quality and Cost of Deterministic Network Calculus
TLDR
A novel DNC algorithm is contributed that transfers the optimization's search for best attainable delay bounds to algebraic DNC and achieves a high degree of accuracy and the novel efficiency improvements reduce the cost of the analysis dramatically.
Worst-Case Performance Analysis of Feed-Forward Networks - An Efficient and Accurate Network Calculus
TLDR
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.
Quality and Cost of Deterministic Network Calculus: Design and Evaluation of an Accurate and Fast Analysis
TLDR
It is shown that: (1) no current optimization formulation scales well with the network size and (2) algebraic DNC can be considerably improved in both aspects, accuracy and computational cost and that the novel efficiency improvements reduce the cost of the analysis dramatically.
Graph-Based Deep Learning for Fast and Tight Network Calculus Analyses
TLDR
The ability to couple graph-based neural networks with NC is demonstrated by extending TMA with a prediction mechanism replacing the exhaustive search, and provably valid bounds are achieved that are very competitive with the exhaustive TMA.
A Theory of Traffic Regulators for Deterministic Networks With Application to Interleaved Regulators
We introduce Pi-regulation, a new definition of traffic regulation which extends both the arrival curves of network calculus and Chang’s max-plus g-regulation, and also includes new types of
Revisiting GPC and AND Connector in Real-Time Calculus
TLDR
This paper revisits GPC and AND in Real-Time Calculus and develops tighter output arrival curves to more precisely characterize the output event streams and conducts experiments to evaluate their performance.
Bounding Network-Induced Delays of Wireless PRP Infrastructure for Industrial Control Systems
  • Huan Yang, Liang Cheng
  • Computer Science
    ICC 2019 - 2019 IEEE International Conference on Communications (ICC)
  • 2019
TLDR
It is shown that the problem of worst-case delay bounding for a wireless PRP network can be solved by performing network-calculus-based analysis on its non-feedforward traffic pattern and closed-form expressions ofworst-case delays are derived, which has not been found previously and allows ICS architects/designers to compute worst- case delay bounds for ICS tasks in their respective application domains of interest.
Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks
TLDR
A network calculus formulation, designed to configure the NoC traffic limiters, that also computes guarantee upper bounds onThe NoC traversal latencies and can be solved using linear programming.
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
Exact worst-case delay for FIFO-multiplexing tandems
  • A. Bouillard, G. Stea
  • Computer Science, Mathematics
    6th International ICST Conference on Performance Evaluation Methodologies and Tools
  • 2012
This paper computes the actual worst-case end-to-end delay for a flow in a tandem of FIFO multiplexing service curve nodes, where flows are shaped by concave, piecewise linear arrival curves, and
Estimating the worst-case delay in FIFO tandems using network calculus
TLDR
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.
Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks
TLDR
This paper addresses the problem of computing end-to-end delay bounds for a traffic flow traversing a tandem of FIFO multiplexing network nodes using Network Calculus, and presents the methodology called the Least Upper Delay Bound, the most accurate among those based on NetworkCalculus.
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
TLDR
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.
Tight Performance Bounds in the Worst-Case Analysis of Feed-Forward Networks
TLDR
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.
Worst-case delay bounds with fixed priorities using network calculus
TLDR
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.
Tight performance bounds in the worst-case analysis of feed-forward networks
TLDR
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 piecewise affine concave arrival curves and piecewiseAffine convex service curves is described.
DEBORAH: A Tool for Worst-Case Analysis of FIFO Tandems
TLDR
This paper presents DEBORAH (Delay Bound Rating AlgoritHm), a tool for computing upper and lower bounds to the worst-case delay in FIFO tandem networks and overview the various algorithms used to perform the various steps of the computations.
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
TLDR
This paper derives per-flow end-to-end delay bounds in aggregate scheduling networks in which per-egress (or sink-tree) aggregation is in place, and flows traffic is aggregated according to a FIFO policy based on Network Calculus.
Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...
TLDR
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.
...
1
2
3
4
...