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

05/13/2019
by   Ehsan Mohammadpour, et al.
0

In deterministic and time-sensitive networking, it is important to bound delays of network elements in the worst case. Network calculus is often used to formally prove such delay bounds, based on arrival and service curves characterizations. In this letter, we provide a delay bound for a FIFO system with rate-latency service curve. Our delay bound improves on the network calculus one by exploiting information on the transmission rate. We prove that our bound is tight.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2022

Improved Network Calculus Delay Bounds in Time-Sensitive Networks

In time-sensitive networks, bounds on worst-case delays are typically ob...
research
05/29/2023

Network-Calculus Service Curves of the Interleaved Regulator

The interleaved regulator (implemented by IEEE TSN Asynchronous Traffic ...
research
05/06/2022

Latency Guarantee for Ubiquitous Intelligence in 6G: A Network Calculus Approach

With the gradual deployment of 5G and the continuous popularization of e...
research
01/15/2019

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

In Time Sensitive Networking (TSN), it is important to formally prove pe...
research
04/29/2018

A Basic Result on the Superposition of Arrival Processes in Deterministic Networks

Time-Sensitive Networking (TSN) and Deterministic Networking (DetNet) ar...
research
07/11/2021

Some Properties of Length Rate Quotient Shapers

Length Rate Quotient (LRQ) is the first algorithm of interleaved shaping...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset