2016 · 26 citations · 18 references
ComputingComputer EngineeringComputer ScienceComputer NetworksDistributed SystemsQueuing TheoryCongestion ControlFlow ControlResource SchedulingTransport LayerCongestion AvoidanceCongestion CollapseCongestion Control ProtocolsCongestion ResilienceCross-layer DesignDatacenter Congestion ControlPacket SchedulingTransport Layer Protocols
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.
18
Albert Greenberg, James R. Hamilton, Navendu Jain et al. · 2009 · 2.1K citations
Mohammad Alizadeh, Albert Greenberg, David A. Maltz et al. · 2010 · 1.8K citations · Full text
Hedera: dynamic flow scheduling for data center networks
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan et al. · 2010 · 1.5K citations
Matei Zaharia, Dhruba Borthakur, Joydeep Sen Sarma et al. · 2010 · 1.4K citations
Towards predictable datacenter networks
Hitesh Ballani, Paolo Costa, Thomas Karagiannis et al. · 2011 · 752 citations · Full text