Improved Credit Bounds for the Credit-Based Shaper in Time-Sensitive Networking

01/15/2019
by   Ehsan Mohammadpour, et al.
0

In Time Sensitive Networking (TSN), it is important to formally prove per flow latency and backlog bounds. To this end, recent works apply network calculus and obtain latency bounds from service curves. The latency component of such service curves is directly derived from upper bounds on the values of the credit counters used by the Credit-Based Shaper (CBS), an essential building block of TSN. In this paper, we derive and formally prove credit upper bounds for CBS, which improve on existing bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2018

End-to-End Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping

We compute bounds on end-to-end worst-case latency and on nodal backlog ...
research
05/13/2019

Improved Delay Bound for a Service Curve Element with Known Transmission Rate

In deterministic and time-sensitive networking, it is important to bound...
research
08/26/2019

DoS Protection through Credit Based Metering – Simulation Based Evaluation for Time-Sensitive Networking in Cars

Ethernet is the most promising solution to reduce complexity and enhance...
research
05/29/2023

Network-Calculus Service Curves of the Interleaved Regulator

The interleaved regulator (implemented by IEEE TSN Asynchronous Traffic ...
research
03/04/2021

The Effect of Network Topology on Credit Network Throughput

Credit networks rely on decentralized, pairwise trust relationships (cha...
research
12/06/2019

Non-asymptotic error bounds for scaled underdamped Langevin MCMC

Recent works have derived non-asymptotic upper bounds for convergence of...
research
07/30/2020

A Core Calculus for Static Latency Tracking with Placement Types

Developing efficient geo-distributed applications is challenging as prog...

Please sign up or login with your details

Forgot password? Click here to reset