论文标题
改善时间敏感网络中的网络演算延迟界限
Improved Network Calculus Delay Bounds in Time-Sensitive Networks
论文作者
论文摘要
在时间敏感的网络中，通常通过使用网络演算来获得最坏情况延迟的边界，并假设流量受到比特级到达曲线的约束。但是，在IEEE TSN或IETF DETNET中，源流对数据包的数量而不是位限制。获得延迟绑定的一种常见方法是从数据包级到达曲线得出比特级到达曲线。但是，这种方法并不紧密：我们表明，可以通过直接利用在数据包级别表达的到达曲线来获得更好的界限。当流量受到G-调节的约束时，例如最近提出的长度率商规则，我们的分析方法还获得了更好的界限。它还可以用来概括一些最近提出的网络钙符号延迟限制，用于具有已知传输速率的服务曲线元件。
In time-sensitive networks, bounds on worst-case delays are typically obtained by using network calculus and assuming that flows are constrained by bit-level arrival curves. However, in IEEE TSN or IETF DetNet, source flows are constrained on the number of packets rather than bits. A common approach to obtain a delay bound is to derive a bit-level arrival curve from a packet-level arrival curve. However, such a method is not tight: we show that better bounds can be obtained by directly exploiting the arrival curves expressed at the packet level. Our analysis method also obtains better bounds when flows are constrained with g-regulation, such as the recently proposed Length-Rate Quotient rule. It can also be used to generalize some recently proposed network-calculus delay-bounds for a service curve element with known transmission rate.
