中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 计算技术研究所
  3. 中国科学院计算技术研究所
  4. 中国科学院计算技术研究所期刊论文
  5. 英文
Minimizing datacenter flow completion times with server-based flow scheduling

文献类型：期刊论文

作者Zhang, Jie1; Zhang, Dafang1; Huang, Kun2; Qin, Zheng1
刊名COMPUTER NETWORKS
出版日期2016-01-15
卷号94页码:360-374
关键词Datacenter network Flow scheduling TCP
ISSN号1389-1286
DOI10.1016/j.comnet.2015.10.022
英文摘要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.
资助项目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记录号WOS:000369469600025
出版者ELSEVIER SCIENCE BV
源URL[http://119.78.100.204/handle/2XEOYT63/8892]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者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.

入库方式： OAI收割

来源：计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。