Stability and performance guarantees in networks with cyclic dependencies

10/05/2018
by   Anne Bouillard, et al.
0

With the development of real-time networks such as reactive embedded systems, there is a need to compute deterministic performance bounds. This paper focuses on the performance guarantees and stability conditions in networks with cyclic dependencies in the network calculus framework. We first propose an algorithm that computes tight backlog bounds in tree networks for any set of flows crossing a server. Then, we show how this algorithm can be applied to improve bounds from the literature fir any topology, including cyclic networks. In particular, we show that the ring is stable in the network calculus framework.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/19/2020

Trade-off between accuracy and tractability of network calculus in FIFO networks

Computing accurate deterministic performance bounds is a strong need for...
04/29/2021

Fully Unleashing the Power of Paying Multiplexing Only Once in Stochastic Network Calculus

The stochastic network calculus (SNC) holds promise as a framework to ca...
11/02/2021

Equivalent Versions of Total Flow Analysis

Total Flow Analysis (TFA) is a method for conducting the worst-case anal...
06/20/2018

Hulls of Cyclic Codes over Z_4

The hulls of linear and cyclic codes over finite fields have been of int...
07/23/2018

The largest number of weights in cyclic codes

Upper and lower bounds on the largest number of weights in a cyclic code...
03/03/2021

A Survey for Real-Time Network Performance Measurement via Machine Learning

Real-Time Networks (RTNs) provide latency guarantees for time-critical a...
02/07/2022

Network Calculus with Flow Prolongation – A Feedforward FIFO Analysis enabled by ML

The derivation of upper bounds on data flows' worst-case traversal times...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.