HPCC: high precision congestion control

Congestion control (CC) is the key to achieving ultra-low latency, high bandwidth and network stability in high-speed networks. From years of experience operating large-scale and high-speed RDMA networks, we find the existing high-speed CC schemes have inherent limitations for reaching these goals. In this paper, we present HPCC (High Precision Congestion Control), a new high-speed CC mechanism which achieves the three goals simultaneously. HPCC leverages in-network telemetry (INT) to obtain precise link load information and controls traffic precisely. By addressing challenges such as delayed INT information during congestion and overreac-tion to INT information, HPCC can quickly converge to utilize free bandwidth while avoiding congestion, and can maintain near-zero in-network queues for ultra-low latency. HPCC is also fair and easy to deploy in hardware. We implement HPCC with commodity programmable NICs and switches. In our evaluation, compared to DCQCN and TIMELY, HPCC shortens flow completion times by up to 95%, causing little congestion even under large-scale incasts.

[1]  Dongsu Han,et al.  Credit-Scheduled Delay-Bounded Congestion Control for Datacenters , 2017, SIGCOMM.

[2]  Csaba Simon,et al.  Performance Evaluation of Low Latency Communication Alternatives in a Containerized Cloud Environment , 2018, 2018 IEEE 11th International Conference on Cloud Computing (CLOUD).

[3]  Scott Shenker,et al.  Revisiting network support for RDMA , 2018, SIGCOMM.

[4]  D. Zats,et al.  DeTail: reducing the flow completion time tail in datacenter networks , 2012, CCRV.

[5]  Wei Bai,et al.  Information-Agnostic Flow Scheduling for Commodity Data Centers , 2015, NSDI.

[6]  Hari Balakrishnan,et al.  ABC: A Simple Explicit Congestion Control Protocol for Wireless Networks , 2019, ArXiv.

[7]  Amin Vahdat,et al.  TIMELY: RTT-based Congestion Control for the Datacenter , 2015, Comput. Commun. Rev..

[8]  Ming Zhang,et al.  Congestion Control for Large-Scale RDMA Deployments , 2015, Comput. Commun. Rev..

[9]  Nick McKeown,et al.  pFabric: minimal near-optimal datacenter transport , 2013, SIGCOMM.

[10]  Hong Liu,et al.  Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network , 2015, Comput. Commun. Rev..

[11]  John K. Ousterhout,et al.  Homa: a receiver-driven low-latency transport protocol using network priorities , 2018, SIGCOMM.

[12]  Mark Handley,et al.  Re-architecting datacenter networks and stacks for low latency and high performance , 2017, SIGCOMM.

[13]  Nick McKeown,et al.  A Distributed Algorithm to Calculate Max-Min Fair Rates Without Per-Flow State , 2019, Proc. ACM Meas. Anal. Comput. Syst..

[14]  Glenn Judd,et al.  Attaining the Promise and Avoiding the Pitfalls of TCP in the Datacenter , 2015, NSDI.

[15]  Renato Recio,et al.  A Remote Direct Memory Access Protocol Specification , 2007, RFC.

[16]  Amin Vahdat,et al.  Less Is More: Trading a Little Bandwidth for Ultra-Low Latency in the Data Center , 2012, NSDI.

[17]  Thomas Voice,et al.  Stability Analysis of a Max-Min Fair Rate Control Protocol (RCP) in a Small Buffer Regime , 2007, IEEE Transactions on Automatic Control.

[18]  Gautam Kumar,et al.  pHost: distributed near-optimal datacenter transport over commodity network fabric , 2015, CoNEXT.

[19]  Laurent Massoulié,et al.  A queueing analysis of max-min fairness, proportional fairness and balanced fairness , 2006, Queueing Syst. Theory Appl..

[20]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[21]  Amar Phanishayee,et al.  Safe and effective fine-grained TCP retransmissions for datacenter communication , 2009, SIGCOMM '09.

[22]  Nick McKeown,et al.  Stability Analysis of Explicit Congestion Control Protocols , 2007, IEEE Communications Letters.

[23]  Alex C. Snoeren,et al.  Inside the Social Network's (Datacenter) Network , 2015, Comput. Commun. Rev..

[24]  D. W. Davies,et al.  The control of congestion in packet switching networks , 1971, Symposium on Problems in the Optimizations of Data Communications Systems.

[25]  Haitao Wu,et al.  RDMA over Commodity Ethernet at Scale , 2016, SIGCOMM.

[26]  Elena Yudovina,et al.  Stochastic networks , 1995, Physics Subject Headings (PhySH).

[27]  Jitendra Padhye,et al.  Tagger: Practical PFC Deadlock Prevention in Data Center Networks , 2019, TNET.

[28]  Nick McKeown,et al.  RCP-AC: Congestion Control to Make Flows Complete Quickly in Any Environment , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[29]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[30]  Vishal Misra,et al.  ECN or Delay: Lessons Learnt from Analysis of DCQCN and TIMELY , 2016, CoNEXT.

[31]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[32]  Albert G. Greenberg,et al.  Data center TCP (DCTCP) , 2010, SIGCOMM '10.

[33]  Thomas Voice,et al.  Stability and fairness of explicit congestion control with small buffers , 2008, CCRV.

[34]  Jorma T. Virtamo,et al.  The Superposition of Variable Bit Rate Sources in an ATM Multiplexer , 1991, IEEE J. Sel. Areas Commun..

[35]  Scott Shenker,et al.  Network Requirements for Resource Disaggregation , 2016, OSDI.

[36]  Alexander Shpiner,et al.  Unlocking Credit Loop Deadlocks , 2016, HotNets.

[37]  Enhong Chen,et al.  Memory Efficient Loss Recovery for Hardware-based Transport in Datacenter , 2017, APNet.

[38]  Nick McKeown,et al.  Rate control protocol (rcp): congestion control to make flows complete quickly , 2008 .