In data center networks, many network-intensive applications typically suffer TCP incast throughput collapse when bursty concurrent TCP flows share a single bottleneck link. To address the TCP incast problem, we first reveal theoretically and empirically that controlling the number of concurrent flows is much more effective in reducing the incast probability than controlling the congestion window. We further propose a novel cross-layer design called Adaptive Request Schedule (ARS), which dynamically adjusts the number of concurrent TCP flows by batching application requests according to the congestion state acquired from transport layer. ARS is deployed only at the aggregator-side, while making no modification on hundreds or thousands of workers. Broad applicability is another advantage of ARS. We integrated ARS transparently (i.e., without modification) with DCTCP and TCP NewReno on NS2 simulation and a physical testbed, respectively. The experimental results show that ARS significantly reduces the incast probability across different TCP protocols and that the network goodput can be increased consistently by on average 6x under severe congestion.
|Original language||English (US)|
|Title of host publication||IEEE INFOCOM 2016 - 35th Annual IEEE International Conference on Computer Communications|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|State||Published - Jul 27 2016|
|Event||35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016 - San Francisco, United States|
Duration: Apr 10 2016 → Apr 14 2016
|Name||Proceedings - IEEE INFOCOM|
|Other||35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016|
|Period||4/10/16 → 4/14/16|
Bibliographical noteFunding Information:
This work is supported by the National Natural Science Foundation of China (61572530, 61502539, 61462007, 61420106009).
© 2016 IEEE.
Copyright 2017 Elsevier B.V., All rights reserved.
- Congestion control
- Data center