交叉业务受限下加权轮询调度器性能界的改进
Improving Performance Bounds for Weighted Round-Robin Schedulers under Constrained Cross-Traffic
摘要：
加权轮询（WRR）是一种有效的，但特别容易实现的数据包调度器。在WRR的实施，交织加权轮循，略有修改，已被提出作为一个增强的初始版本，并已在最近进行了调查。网络演算是一个通用的框架来建模和分析这样的网络路由器。通过这种方式，可以推导出网络性能指标的理论上限，如延迟或积压。在我们以前的工作中，我们推导出的性能界限表明，这两个循环的变种属于一类称为带宽共享政策;然而，由于证明是不完全的，因此我们不能得出循环调度器是带宽共享策略的结论（在可变数据包大小下）。为此，在随后的勘误表中，我们引入所谓的资源隔离策略，并将循环调度器示为该类的成员。我们首先介绍我们在[CNS 22 -1]中发表的原创作品，然后是更正之前提到的缺点的错误。在我们的勘误表中，与[CNS 22 -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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
