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.
DOI:
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. DOI: 10.3969/j.issn.0372-2112.2019.10.006.
Slack Time and Accumulation-Based Mix-flow Scheduling in Data Center Networks
数据中心网络中同时存在截止时间流(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.