Analysis of Dampers in Time-Sensitive Networks with Non-ideal Clocks

09/06/2021
by   Ehsan Mohammadpour, et al.
0

Dampers are devices that reduce delay jitter in the context of time-sensitive networks, by delaying packets for the amount written in packet headers. Jitter reduction is required by some real-time applications; beyond this, dampers have the potential to solve the burstiness cascade problem of deterministic networks in a scalable way, as they can be stateless. Dampers exist in several variants: some apply only to earliest-deadline-first schedulers, whereas others can be associated with any packet schedulers; some enforce FIFO ordering whereas some others do not. Existing analyses of dampers are specific to some implementations and some network configurations; also, they assume ideal, non-realistic clocks. In this paper, we provide a taxonomy of all existing dampers in general network settings and analyze their timing properties in presence of non-ideal clocks. In particular, we give formulas for computing residual jitter bounds of networks with dampers of any kind. We show that non-FIFO dampers may cause reordering due to clock non-idealities and that the combination of FIFO dampers with non-FIFO network elements may very negatively affect the performance bounds. Our results can be used to analyze timing properties and burstiness increase in any time-sensitive network, as we illustrate on an industrial case-study.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2021

Worst-case Delay Bounds in Time-Sensitive Networks with Packet Replication and Elimination

Packet replication and elimination functions are used by time-sensitive ...
research
02/11/2020

On Time Synchronization Issues in Time-Sensitive Networks with Regulators and Nonideal Clocks

Flow reshaping is used in time-sensitive networks (as in the context of ...
research
04/12/2011

Deterministic Real-time Thread Scheduling

Race condition is a timing sensitive problem. A significant source of ti...
research
08/23/2016

Delay Evaluation of OpenFlow Network Based on Queueing Model

As one of the most popular south-bound protocol of software-defined netw...
research
11/06/2019

Graph-based Approach for Buffer-aware Timing Analysis of Heterogeneous Wormhole NoCs under Bursty Traffic

This paper addresses the problem of worst-case timing analysis of hetero...
research
03/27/2013

Ideal Reformulation of Belief Networks

The intelligent reformulation or restructuring of a belief network can g...

Please sign up or login with your details

Forgot password? Click here to reset