论文标题
dcoflow：数据中心网络中的Coflows的截止时间安排算法
DCoflow: Deadline-Aware Scheduling Algorithm for Coflows in Datacenter Networks
论文作者
论文摘要
数据中心网络通常以Coflows的形式（即与共同任务相关的并发流量集）通常支持分布式计算框架的数据传输。绝大多数文献都集中在调度COFLOWS以最小化完成Coflows的问题上，即，以最大程度地提高网络结构中Coflows的平均速率。但是，现代应用程序可能会生成专门用于在线服务和关键任务计算任务的Coflows，这些任务必须遵守特定的完成截止日期。在本文中，我们介绍了$ \ mathtt {dcoflow} $，这是数据中心网络中时间关键时期Coflows的轻量级截止日期的调度程序。该算法结合了在线联合入学控制和计划逻辑，并返回$σ$ - 订单的时间表，该计划最大程度地提高了达到其截止日期的Coflows数量。广泛的数值结果表明，所提出的解决方案的表现优于现有解决方案。
Datacenter networks routinely support the data transfers of distributed computing frameworks in the form of coflows, i.e., sets of concurrent flows related to a common task. The vast majority of the literature has focused on the problem of scheduling coflows for completion time minimization, i.e., to maximize the average rate at which coflows are dispatched in the network fabric. Modern applications, though, may generate coflows dedicated to online services and mission-critical computing tasks which have to comply with specific completion deadlines. In this paper, we introduce $\mathtt{DCoflow}$, a lightweight deadline-aware scheduler for time-critical coflows in datacenter networks. The algorithm combines an online joint admission control and scheduling logic and returns a $σ$-order schedule which maximizes the number of coflows that attain their deadlines. Extensive numerical results demonstrate that the proposed solution outperforms existing ones.
