论文标题
基于尺寸的调度与数据中心流的公平性：排队的观点
Size-based scheduling vs fairness for datacenter flows: a queuing perspective
论文作者
论文摘要
与最近的工作体系的结论相反，该工作的左右处理时间（SRPT）流量调度是为数据中心网络提倡的，本文旨在证明每流公平性仍然是一个可取的目标。我们通过分析和仿真评估抽象的排队模型，以说明在合理的假设中，即数据中心流在批处理和爆发中出现，而不是通常在泊松过程的瞬间单独假设。这些模型的结果对数据中心网络的带宽共享策略的设计具有重要意义。特别是，我们提出了一种新颖的“虚拟公平调度”算法，该算法在批处理之间实现公平性，并且可以说是足够简单的，可以在高速设备中实现。
Contrary to the conclusions of a recent body of work where approximate shortest remaining processing time first (SRPT) flow scheduling is advocated for datacenter networks, this paper aims to demonstrate that per-flow fairness remains a preferable objective. We evaluate abstract queuing models by analysis and simulation to illustrate the non-optimality of SRPT under the reasonable assumptions that datacenter flows occur in batches and bursts and not, as usually assumed, individually at the instants of a Poisson process. Results for these models have significant implications for the design of bandwidth sharing strategies for datacenter networks. In particular, we propose a novel "virtual fair scheduling" algorithm that enforces fairness between batches and is arguably simple enough to be implemented in high speed devices.
