确定性网络的流量调节器理论及其在交织调节器中的应用
A Theory of Traffic Regulators for Deterministic Networks with Application to Interleaved Regulators
摘要：
我们定义了最小的交错调节器，它概括了紧急基于整形器，最近提出的Specht和Samii作为一个更简单的替代，以确定性网络中的每流整形与聚合调度。使用此调节器，多个流的数据包在一个FIFO队列中处理;队列头部的数据包根据其流的调节约束进行检查;在不违反约束的情况下，在可能的最早时间释放数据包。不在队列头的数据包在到达队列头之前不会被检查。因此，该调节器可能延迟队列头部的分组，但也延迟通常属于其他流的所有后续分组。然而，我们表明，当它被放置在一个任意的FIFO系统后，最坏情况下的组合延迟不会增加。这种免费整形的特性在每个流整形器中是众所周知的;令人惊讶的是，它在这里仍然成立。为了得到这个属性，我们引入了一个新的定义的流量调节器，最小的PI调节器，它扩展了贪婪的网络演算和张的最大加调节器，也包括新类型的监管机构，如包速率限制器。顺便说一句，我们提供了一个新的见解之间的等价性最小加和最大加制剂的监管机构和整形。
英文摘要：
We define the minimal interleaved regulator, which generalizes the Urgency Based Shaper that was recently proposed by Specht and Samii as a simpler alternative to per-flow reshaping in deterministic networks with aggregate scheduling. With this regulator, packets of multiple flows are processed in one FIFO queue; the packet at the head of the queue is examined against the regulation constraints of its flow; it is released at the earliest time at which this is possible without violating the constraints. Packets that are not at the head of the queue are not examined until they reach the head of the queue. This regulator thus possibly delays the packet at the head of the queue but also all following packets, which typically belong to other flows. However, we show that, when it is placed after an arbitrary FIFO system, the worst case delay of the combination is not increased. This shaping-for-free property is well-known with per-flow shapers; surprisingly, it continues to hold here. To derive this property, we introduce a new definition of traffic regulator, the minimal Pi-regulator, which extends both the greedy shaper of network calculus and Chang's max-plus regulator and also includes new types of regulators such as packet rate limiters. Incidentally, we provide a new insight on the equivalence between min-plus and max-plus formulations of regulators and shapers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
