2015 · 69 citations · 27 references
ComputingComputer EngineeringComputer ScienceComputer NetworksDistributed SystemsMessage PassingCommunication NetworksCongestion ControlCongestion ManagementFlow ControlNetwork Flow AlgorithmsNetwork Performance AnalysisCongestion Control ProtocolsConvergenceDatacenter Congestion ControlGradient DescentLow-density Parity-check CodesMessage-passing AlgorithmsRate-based Congestion ControlUser Performance Metrics
As datacenter speeds scale to 100 Gb/s and beyond, traditional congestion control algorithms like TCP and RCP converge slowly to steady sending rates, which leads to poorer and less predictable user performance. These reactive algorithms use congestion signals to perform gradient descent to approach ideal sending rates, causing poor convergence times. In this paper, we propose a proactive congestion control algorithm called PERC, which explicitly computes rates independently of congestion signals in a decentralized fashion. Inspired by message-passing algorithms with traction in other fields (e.g., modern Low Density Parity Check decoding algorithms), PERC improves convergence times by a factor of 7 compared to reactive explicit rate control protocols such as RCP. This fast convergence reduces tail flow completion time (FCT) significantly in high speed networks; for example, simulations of a realistic workloads in a 100 Gb/s network show that PERC achieves up to 4x lower 99th percentile FCT compared to RCP.
27
Information theory, inference, and learning algorithms
Choice Reviews Online · 2004 · 6.6K citations
Congestion avoidance and control
Van Jacobson · ACM SIGCOMM Computer Communication Review · 1995 · 5.3K citations
Pat Bosshart, Dan Daly, Glen Gibb et al. · ACM SIGCOMM Computer Communication Review · 2014 · 2.8K citations