Deadline-Aware Datacenter TCP (D2TCP)

被引:308
作者
Vamanan, Balajee [1 ]
Hasan, Jahangir
Vijaykumar, T. N. [1 ]
机构
[1] Purdue Univ, W Lafayette, IN 47907 USA
关键词
Algorithms; Design; Performance; Datacenter; Deadline; SLA; TCP; OLDI; ECN; Cloud Services;
D O I
10.1145/2377677.2377709
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An important class of datacenter applications, called Online Data-Intensive (OLDI) applications, includes Web search, online retail, and advertisement. To achieve good user experience, OLDI applications operate under soft-real-time constraints (e.g., 300 ms latency) which imply deadlines for network communication within the applications. Further, OLDI applications typically employ tree-based algorithms which, in the common case, result in bursts of children-to-parent traffic with tight deadlines. Recent work on datacenter network protocols is either deadline-agnostic (DCTCP) or is deadline-aware (D-3) but suffers under bursts due to race conditions. Further, D-3 has the practical drawbacks of requiring changes to the switch hardware and not being able to coexist with legacy TCP. We propose Deadline-Aware Datacenter TCP ((DTCP)-T-2), a novel transport protocol, which handles bursts, is deadline-aware, and is readily deployable. In designing (DTCP)-T-2, we make two contributions: (1) (DTCP)-T-2 uses a distributed and reactive approach for bandwidth allocation which fundamentally enables (DTCP)-T-2's properties. (2) (DTCP)-T-2 employs a novel congestion avoidance algorithm, which uses ECN feedback and deadlines to modulate the congestion window via a gamma-correction function. Using a small-scale implementation and at-scale simulations, we show that (DTCP)-T-2 reduces the fraction of missed deadlines compared to DCTCP and D-3 by 75% and 50%, respectively.
引用
收藏
页码:115 / 126
页数:12
相关论文
共 26 条
[1]  
Alizadeh M., 2010, P SIGCOMM
[2]  
[Anonymous], P SIGCOMM
[3]  
[Anonymous], P SIGCOMM
[4]  
[Anonymous], 2009, Latency Is Everywhere And It Costs You Sales-How To Crush It
[5]  
[Anonymous], NS 3 DISCRETE EVENT
[6]  
Briscoe B., P SIGCOMM 2005
[7]  
Dukkipati N., 2006, THESIS STANFORD U ST
[8]  
Ferrari D., 1994, P COMP NETW ISDN SYS
[9]   THE SYNCHRONIZATION OF PERIODIC ROUTING MESSAGES [J].
FLOYD, S ;
JACOBSON, V .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1994, 2 (02) :122-136
[10]  
Floyd S., 2003, 3649 RFC