Minimizing datacenter flow completion times with server-based flow scheduling

doi:10.1016/j.comnet.2015.10.022

	Minimizing datacenter flow completion times with server-based flow scheduling
	Zhang, Jie 1; Zhang, Dafang 1; Huang, Kun 2; Qin, Zheng 1
	2016-01-15
发表期刊	COMPUTER NETWORKS
ISSN	1389-1286
卷号	94 页码:360-374
摘要	Minimizing flow completion times (FCT) is a critical issue in datacenter networks. Existing approaches either cannot minimize FCT (i.e., DCTCP) or are costly to deploy with hardware modification on switches (i.e., pFabric). This paper presents a server-based flow scheduling (SFS) scheme for enabling easy and rapid deployment in servers while almost retaining the same minimal FCT as state-of-the-art pFabric. SFS combines traffic control and flow scheduling to keep in-switch queue very short, hence switches do not need to schedule flows and such function can be moved to servers. With SFS, each server keeps its highest-priority flow active and pauses the other low-priority ones. Then flows are completed one by one for minimizing FCT. We propose two novel techniques to achieve SFS. First, the bidirectional flow scheduling technique is used for each server to locally schedule sent or received flows. Second, the most recently seen flow coordination technique is used to coordinate senders and receivers to address the priority disagreement problem. We show that SFS scales to thousands of senders in Incast scenario and achieves zero-queue in the entire networks. Experimental results on NS2 show that SFS outperforms DCTCP and pFabric in Incast scenario. On real workloads in FatTree, SFS achieves 4 x faster than DCTCP and closely approaches pFabric in tail FCT of short flows. (C) 2015 Elsevier B.V. All rights reserved.
关键词	Datacenter network Flow scheduling TCP
DOI	10.1016/j.comnet.2015.10.022
收录类别	SCI
语种	英语
资助项目	National Basic Research Program of China (973)[2012CB315805] ; National Science Foundation of China[61173167] ; National Science Foundation of China[61472130] ; National Science Foundation of China[61133015] ; National Science Foundation of China[61272546]
WOS研究方向	Computer Science ; Engineering ; Telecommunications
WOS类目	Computer Science, Hardware & Architecture ; Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications
WOS记录号	WOS:000369469600025
出版者	ELSEVIER SCIENCE BV
引用统计	被引频次：4[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/8893
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Zhang, Dafang
作者单位	1.Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China 2.Chinese Acad Sci, Inst Comp Technol, Beijing 100864, Peoples R China
推荐引用方式 GB/T 7714	Zhang, Jie,Zhang, Dafang,Huang, Kun,et al. Minimizing datacenter flow completion times with server-based flow scheduling[J]. COMPUTER NETWORKS,2016,94:360-374.
APA	Zhang, Jie,Zhang, Dafang,Huang, Kun,&Qin, Zheng.(2016).Minimizing datacenter flow completion times with server-based flow scheduling.COMPUTER NETWORKS,94,360-374.
MLA	Zhang, Jie,et al."Minimizing datacenter flow completion times with server-based flow scheduling".COMPUTER NETWORKS 94(2016):360-374.