Is Minimizing Flow Completion Time the Optimal Way in Meeting Flow's Deadline in Datacenter Networks

被引:3
作者
XU Yakun [1 ]
LUO Hongbin [1 ]
REN Fei [1 ]
机构
[1] National Engineering Laboratory for Next Generation Internet Technologies School of Electronic and Information Engineering Beijing Jiaotong University
基金
中国博士后科学基金; 中央高校基本科研业务费专项资金资助;
关键词
datacenter networks; deadline; preemptive scheduling; flow completion time;
D O I
暂无
中图分类号
TP308 [机房];
学科分类号
0812 ;
摘要
In modern datacenters, the most common method to solve the network latency problem is to minimize flow completion time during the transmission process. Following the soft real-time nature, the optimization of transport latency is relaxed to meet a flow’s deadline in deadline-sensitive services. However, none of existing deadline-sensitive protocols consider deadline as a constraint condition of transmission.They can only simplify the objective of meeting a flow’s deadline as a deadline-aware mechanism by assigning a higher priority for tight-deadline constrained flows to finish the transmission as soon as possible, which results in an unsatisfactory effect in the condition of high fan-in degree. It drives us to take a step back and rethink whether minimizing flow completion time is the optimal way in meeting flow’s deadline. In this paper, we focus on the design of a soft real-time transport protocol with deadline constraint in datacenters and present a flow-based deadline scheduling scheme for datacenter networks(FBDS).FBDS makes the unilateral deadline-aware flow transmission with priority transform into a compound centralized single-machine deadlinebased flow scheduling decision. In addition, FBDS blocks the flow sets and postpones some flows with extra time until their deadlines to make room for the new arriving flows in order to improve the deadline meeting rate. Our simulation resultson flow completion time and deadline meeting rate reveal the potential of FBDS in terms of a considerable deadline-sensitive transport protocol for deadline-sensitive interactive services.
引用
收藏
页码:6 / 15
页数:10
相关论文
共 8 条
[1]   Delay-Differentiated Scheduling in Optical Packet Switches for Cloud Data Centers [J].
LI Yaofang ;
XIAO Jie ;
WU Bin ;
WEN Hong ;
YU Hongfang ;
YANG Shu ;
XIN Shanshan ;
GUO Jianing .
中国通信, 2015, 12 (08) :22-32
[2]   Allocation and Scheduling of Network Resource for Multiple Control Applications in SDN [J].
FENG Tao ;
BI Jun ;
WANG Ke .
中国通信, 2015, 12 (06) :85-95
[3]  
On Meeting Deadlines in Datacenter Networks[J]. Li Chen,Baochun Li,Bo Li. Tsinghua Science and Technology. 2013(03)
[4]   Finishing Flows Quickly with Preemptive Scheduling [J].
Hong, Chi-Yao ;
Caesar, Matthew ;
Godfrey, P. Brighten .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) :127-138
[5]  
Better never than late[J] . Christo Wilson,Hitesh Ballani,Thomas Karagiannis,Ant Rowtron. ACM SIGCOMM Computer Communication Review . 2011 (4)
[6]   Why flow-completion time is the right metric for congestion control [J].
Dukkipati, N ;
McKeown, N .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2006, 36 (01) :59-62
[7]  
Resource intensity aware job scheduling in a distributed cloud .2 HUANG D,ZHU C,ZHANG H,et al. Communications,China . 2014
[8]  
A survey of software-defined networking:Past,present,and future of programmable networks .2 Nunes BAA,Mendonca M,Nguyen XN,Obraczka K,Turletti T. IEEE Communications Surveys and Tutorials . 2014