论文标题
在受限的跨交通中，改善加权循环调度程序的性能界限
Improving Performance Bounds for Weighted Round-Robin Schedulers under Constrained Cross-Traffic
论文作者
论文摘要
加权循环（WRR）是一种有效但尤其易于实施的数据包调度程序。已经提出了对WRR的实施，交错的加权循环的稍微修改，以增强初始版本的增强，并最近进行了研究。网络演算是一个多功能框架，用于建模和分析此类网络调度程序。通过这种情况，可以在网络性能指标（例如延迟或积压的网络性能指标）上得出理论上的上限。在我们以前的工作中，我们通过证明两个圆形旋转变体都属于称为带宽共享策略的类，从而得出了性能界限。但是，证明是不完整的，因此，我们无法得出结论，圆形旋转调度程序是带宽共享策略（在可变的数据包大小下）。为此，在此目的中，在随后的勘误表中，我们介绍了所谓的资源式策略，并展示了该课程的圆形枪支计划者。 我们首先介绍了[CNS22-1]中发表的原始作品，然后介绍了纠正前面提到的缺点的错误。与[CNS22-1]相比，在我们的信中，我们提供的延迟范围稍差。但是，在我们所有的实验中，它们的表现都大大优于艺术状态。
Weighted round robin (WRR) is an effective, yet particularly easy-to-implement packet scheduler. A slight modification in the implementation of WRR, interleaved weighted round robin, has been proposed as an enhancement of the initial version and has been recently investigated. Network calculus is a versatile framework to model and analyze such network schedulers. By means of this, one can derive theoretical upper bounds on network performance metrics, such as delay or backlog. In our previous work, we derive performance bounds by showing that both round-robin variants belong to a class called bandwidth-sharing policy; however, the proofs are incomplete and thus, we cannot conclude that the round-robin schedulers are bandwidth-sharing policies (under variable packet sizes).To that end, in the subsequent erratum, we introduce so-called resource-segregating policies and show the round-robin schedulers to be members of this class. We first present our original work, as published in [CNS22-1], and then the erratum correcting the previously mentioned shortcoming. In our erratum, we provide slightly worse delay bounds compared to [CNS22-1]; yet, across all our experiments, they significantly outperform the state of the art.
