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.
翻译:在时间敏感的网络中,水坝是减少拖延的装置,通过推迟包装信头写成的数量的包包,减少延误的紧张状态。一些实时应用程序要求减少垃圾;除此之外,水坝人有可能以可扩缩的方式解决确定性网络的爆发性连锁问题,因为他们可能是无国籍者。 水坝人存在于几种变式中:有些只适用于最早死线排程器,而另一些则可能与任何封装调度器相关联;一些执行FIFO订购,而另一些则不这样做。现有对水坝人的分析是某些执行和网络配置所特有的;还有,它们假定理想的、不现实的时钟。在本文中,我们提供对一般网络环境中所有现有水坝人进行分类,并在非理想的时钟面前分析其时间特性。特别是,我们给出公式,计算与任何类型的水坝的网络的残余弹道捆绑。我们显示,非FIFO水坝人可能会因不理想的时钟和某些网络配置而导致重新排序;他们还假定理想的、不现实的时钟;他们采用理想的、不现实的时钟;在一般的网络中,我们提供现有所有现有拖动性能分析的时空的时段,可以对我们的工业性分析结果产生反分析结果。