限时点到多点跨数据中心传输的多源树调度算法  

Multi-source Tree-based Scheduling Algorithm for Deadline-aware P2MP Inter-datacenter Transfers

作　　者：庄奕 杨家海 ZHUANG Yi;YANG Jia-hai(Institute for Network Sciences and Cyberspace,Tsinghua University,Beijing 100084,China;Beijing National Research Center for Information Science and Technology,Beijing 100084,China)

机构地区：[1]清华大学网络科学与网络空间研究院,北京100084 [2]北京信息科学与技术国家研究中心,北京100084

出　　处：《计算机科学》2020年第7期213-219,共7页Computer Science

基　　金：国家自然科学基金(61432009,61462009)。

摘　　要：随着各种云应用的数据规模的增大,越来越多的云服务提供商开始关注跨数据中心的大数据块传输(bulk transfer)。跨数据中心的大数据块传输面临的主要挑战是:如何找到最佳的资源调度算法,在用户指定的时限内,用最少的传输资源将用户的数据传输到指定的地点。文中设计了一种有效的带传输时限(transfer deadlines)的、点到多点(Point-to-MultiPoint,P2MP)的跨数据中心数据传输调度算法MSTB(Multi-Source Tree-Based algorithm)。在多源机制和多播转发树的帮助下,MSTB表现得比现有的最优方法更好。仿真实验结果表明,MSTB可以在保证低传输完成时间和低计算复杂度的同时,增加最高达91%的传输请求接受数,增加最高达54%的有效吞吐量。With the growth of the data volume for cloud applications,more and more cloud service providers pay attention to inter-datacenter bulk transfer.The main challenge of inter-datacenter bulk transfer is how to find the best resource scheduling algorithm,which uses the least resources to transfer the user’s data to the specified destinations before the specified deadline.This paper proposes MSTB(Multi-Source Tree-Based)algorithm,an effective scheduling solution for deadline-aware P2MP inter-da-tacenter transfers.With the help of multi-source mechanism and multicast forwarding tree,MSTB outperforms the state-of-the-art method.Simulation experiments show that MSTB can increase the number of transfer requests accepted by up to 91%and increase effective throughput by up to 54%with short transfer completion time and low computation complexity.

关 键 词：数据中心 调度算法 带传输时限 点到多点 多源点 

分 类 号：TP302[自动化与计算机技术—计算机系统结构]