当前位置: X-MOL 学术IEEE Trans. Serv. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Deadline Flow Scheduling in Datacenters with Time-Varying Bandwidth Allocations
IEEE Transactions on Services Computing ( IF 5.5 ) Pub Date : 2020-05-01 , DOI: 10.1109/tsc.2017.2701363
Jiann-Min Ho , Pi-Cheng Hsiu , Ming-Syan Chen

Many production datacenters nowadays service multiple applications with dynamically allocated network bandwidth, and some applications are time-critical so their data transfers or flows are constrained by deadlines. To meet deadlines, several flow scheduling schemes for datacenter networks are proposed, but most of them are unaware of bandwidth variations, leading to suboptimal throughputs. In this paper, we present a flow scheduling scheme, called UBAS, to improve deadline-meeting throughputs for time-critical applications with uncertain time-varying bandwidth allocations. First, we model an optimization problem of scheduling deadline-constrained flows under uncertain time-varying bandwidth allocations to maximize the expected deadline-meeting throughput. The problem is NP-hard. Then, we propose an approximation algorithm under a mild condition for the problem in a special case, where bandwidth allocations are certain, as well as a conditional approximation algorithm for the problem in general. To adapt to practice, scalable and online variants of the algorithm are also presented. In evaluation, we conduct simulations based on a real traffic trace in a production datacenter. The results demonstrate that, with severe practical settings, UBAS still achieves nearly optimal deadline-meeting throughputs. Moreover, the throughput improvements of UBAS against existing bandwidth-agnostic schemes are more substantial when the variance of bandwidth allocations over time increases.

中文翻译:

具有时变带宽分配的数据中心的截止日期流调度

如今,许多生产数据中心通过动态分配的网络带宽为多个应用程序提供服务,并且一些应用程序对时间要求严格,因此它们的数据传输或流量受到截止日期的限制。为了满足最后期限,提出了几种数据中心网络的流量调度方案,但大多数方案都没有意识到带宽变化,导致吞吐量不理想。在本文中,我们提出了一种称为 UBAS 的流调度方案,以提高具有不确定时变带宽分配的时间关键应用程序的截止日期满足吞吐量。首先,我们对在不确定的时变带宽分配下调度截止日期约束流的优化问题进行建模,以最大化预期截止日期会议吞吐量。问题是NP难的。然后,在带宽分配确定的特殊情况下,我们针对该问题提出了一种温和条件下的近似算法,以及针对一般问题的条件近似算法。为了适应实践,还介绍了该算法的可扩展和在线变体。在评估中,我们根据生产数据中心中的真实流量跟踪进行模拟。结果表明,在严苛的实际设置下,UBAS 仍然实现了接近最佳的截止日期会议吞吐量。此外,当带宽分配随时间的变化增加时,UBAS 相对于现有带宽不可知方案的吞吐量改进更为显着。为了适应实践,还介绍了该算法的可扩展和在线变体。在评估中,我们根据生产数据中心中的真实流量跟踪进行模拟。结果表明,在严苛的实际设置下,UBAS 仍然实现了接近最佳的截止日期会议吞吐量。此外,当带宽分配随时间的变化增加时,UBAS 相对于现有带宽不可知方案的吞吐量改进更为显着。为了适应实践,还介绍了该算法的可扩展和在线变体。在评估中,我们根据生产数据中心中的真实流量跟踪进行模拟。结果表明,在严苛的实际设置下,UBAS 仍然实现了接近最佳的截止日期会议吞吐量。此外,当带宽分配随时间的变化增加时,UBAS 相对于现有带宽不可知方案的吞吐量改进更为显着。
更新日期:2020-05-01
down
wechat
bug