基于松弛时间与累计发送量的数据中心网络混合流调度机制

doi:10.3969/j.issn.0372-2112.2019.10.006

电子学报 ›› 2019, Vol. 47 ›› Issue (10): 2061-2068.DOI: 10.3969/j.issn.0372-2112.2019.10.006

基于松弛时间与累计发送量的数据中心网络混合流调度机制

臧韦菲, 兰巨龙, 胡宇翔

国家数字交换系统工程技术研究中心, 河南郑州 450002

收稿日期:2017-12-27 修回日期:2019-02-28 出版日期:2019-10-25
- 作者简介:
- 臧韦菲 女,1993年出生,河南郑州人.国家数字交换系统工程技术研究中心博士研究生.主要研究方向为新型网络体系结构.E-mail:zwfndsc@163.com;兰巨龙 男,1962年出生,河北张北人.国家数据交换系统工程技术研究中心教授、博士生导师.主要从事新一代信息网络关键理论与技术的研究工作.
- 基金资助:
- 国家网络空间安全专项课题 (No.2017YFB0803204）; 国家863高技术研究发展计划 (No.2015AA016102）; 国家自然科学基金创新研究群体科学基金 (No.61521003）

Slack Time and Accumulation-Based Mix-flow Scheduling in Data Center Networks

ZANG Wei-fei, LAN Ju-long, HU Yu-xiang

National Digital Switching System Engineering & Technological Research Center, Zhengzhou, Henan 450002, China

Received:2017-12-27 Revised:2019-02-28 Online:2019-10-25 Published:2019-10-25
- Supported by:
- National Cyber Space Security Project of China (No.2017YFB0803204); National High-tech R&D Program of China (863 Program) (No.2015AA016102); NSFC Innovation Research Group (No.61521003)

摘要/Abstract

摘要： 数据中心网络中同时存在截止时间流（deadline flow）和非截止时间流（non-deadline flow），为降低非截止时间流的平均完成时间（Average Flow Complete Time，AFCT）同时维持低截止时间错失率（Deadline Miss Rate，DMR），本文提出了一种基于松弛时间与累计发送量的混合流调度机制（Slack Time and Accumulation based Mix-flow Scheduling，STAM）.首先通过引入松弛时间的概念，衡量截止时间流对非截止时间流在传输时延上的宽容度；然后根据松弛时间，通过使截止时间流尽可能接近其规定截止时间完成，降低非截止时间流的完成时间；最后，利用最小累计发送量优先策略进一步降低非截止时间流的平均完成时间.仿真结果表明，该机制能有效降低非截止时间流的平均完成时间，同时保证较低的截止时间错失率.

关键词: 数据中心网络, 流量调度, 截止时间, 松弛时间

Abstract: Applications deployed in data center networks generate a mix of flows with and without deadlines.To reduce the average flow complete time (AFCT) while maintain a low deadline miss rate (DMR),a slack time and accumulation-based mix-flow scheduling mechanism (STAM) is proposed in this paper.Firstly,the delay tolerance of deadline flows on non-deadline flows is measured with the introduction of Slack Time.Then the cost of complete time of non-deadline flows is reduced by completing deadline flows barely before their deadlines.Lastly,non-deadline flow is scheduled according to the number of bytes it has sent to reduce the average flow completion time.Experiment results show that the proposed mechanism can effectively reduce the average flow completion time of non-deadline flows while maintaining low deadline miss rate.

Key words: data center network, flow scheduling, deadline, slack time

中图分类号:

TP393

臧韦菲, 兰巨龙, 胡宇翔. 基于松弛时间与累计发送量的数据中心网络混合流调度机制[J]. 电子学报, 2019, 47(10): 2061-2068.

ZANG Wei-fei, LAN Ju-long, HU Yu-xiang . Slack Time and Accumulation-Based Mix-flow Scheduling in Data Center Networks[J]. Acta Electronica Sinica, 2019, 47(10): 2061-2068.

参考文献

[1] CHEN L,CHEN K,BAI W.Scheduling mix-flows in commodity datacenters with karuna[A].Proceedings of the 2016 ACM SIGCOMM Conference[C].New York,USA:ACM,2016.174-187.
[2] 黄建洋,兰巨龙,胡宇翔.一种基于分段路由的多路径流传输机制[J].电子学报,2018,46(6):1488-1495. HUANG Jian-yang,LAN Ju-long,HU Yu-xiang.Asegment routing based multipath flow transmission mechanism[J].Acta Electronica Sinica,2018,46(6):1488-1495.(in Chinese)
[3] XIA W,ZHAO P,WEN Y,et al.A survey on data center networking(DCN):Infrastructure and operations[J].IEEE Communications Surveys & Tutorials,2017,19(1):640-656.
[4] Alizadeh Mohammad,Greenberg Albert,Maltz David A,et al.Data center TCP (DCTCP)[J].ACM SIGCOMM Computer Communication Review,2010,40(4):63-74.
[5] VAMANAN B,HASAN J,VIJAYKUMAR T N.Deadline-aware datacenter tcp (D2TCP)[A].Proceedings of the ACM SIGCOMM 2012 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communication[C].New York,USA:ACM,2012.115-126.
[6] MUNIR A,QAZI I A,UZMI Z A.Minimizing flow completion times in data centers[A].Proceedings of the 32nd IEEE International Conference on Computer Communications[C].Piscataway,NJ:IEEE,2013.2157-2165.
[7] Chi-Yao HONG,Matthew CAESAR,P Brighten GODFREY.Finishing flows quickly with preemptive scheduling[J].ACM SIGCOMM Computer Communication Review,2012,42(4):127-138.
[8] BAI W,CHEN L,CHEN K.PIAS:Practical information-agnostic flow scheduling for data center networks[A].Proceedings of the 13th ACM Workshop on Hot Topics in Networks[C].New York,USA:ACM,2014.25.
[9] WANG T,XU H,LIU F.Aemon:Information-agnostic mix-flow scheduling in data center networks[A].Proceedings of the First Asia-Pacific Workshop on Networking[C].New York,USA:ACM,2017.106-112.
[10] CHEN L,CUI W.Optimizing coflow completion times with utility max-min fairness[A].Proceedings of the 35th IEEE International Conference on Computer Communications[C].Piscataway,NJ:IEEE,2016.1-9.
[11] BAI W,CHEN K,WU H.PAC:Taming TCP incast congestion using proactive ACK control[A].Proceedings of the 22nd International Conference on Network Protocols[C].Washington,DC,USA:IEEE Computer Society,2014.385-396.
[12] BAI W,CHEN L.Enabling ECN in multi-service multi-queue data centers[A].Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation[C].Berkeley,CA,USA:USENIX Association,2016.537-549.
[13] 马腾,胡宇翔,张校辉.基于深度增强学习的数据中心网络coflow调度机制[J].电子学报,2018,46(7):1617-1624. MA Teng,HU Yu-xiang,ZHANG Xiao-hui.Deepreinforcement learning based coflow scheduling in data center networks[J].Acta Electronica Sinica,2018,46(7):1617-1624.(in Chinese)

基于松弛时间与累计发送量的数据中心网络混合流调度机制

Slack Time and Accumulation-Based Mix-flow Scheduling in Data Center Networks

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

[1]	崔子熙, 胡宇翔, 兰巨龙, 王雨. 基于流分类的数据中心网络负载均衡机制[J]. 电子学报, 2021, 49(3): 559-565.
[2]	马腾, 胡宇翔, 张校辉. 基于深度增强学习的数据中心网络coflow调度机制[J]. 电子学报, 2018, 46(7): 1617-1624.
[3]	林智华, 高文, 吴春明, 李勇燕. 基于离散粒子群算法的数据中心网络流量调度研究[J]. 电子学报, 2016, 44(9): 2197-2202.
[4]	宣恒农, 张润驰, 左苗, 刘田田. 面向数据中心网络的分层式故障诊断算法[J]. 电子学报, 2014, 42(12): 2536-2542.
[5]	商云飞, 徐明伟, 李丹. 互联网路由设备与协议节能研究综述[J]. 电子学报, 2012, 40(11): 2290-2297.
[6]	肖鹏;胡志刚. 截止时间约束下独立网格任务的协同调度模型[J]. 电子学报, 2011, 39(8): 1852-1857.