P4-enabled Network-assisted Congestion Feedback: A Case for NACKs

There exists an extensive body of work, spanning more than two decades, on congestion control schemes and signaling mechanisms. The majority of prior work does not, however, entertain the notion of network-assisted feedback for congestion control. The scope of the remaining work has also been, unfortunately, rather narrow: Some efforts limit themselves to using weak signals (involving a few bits in the header) and relying on receivers to reflect such signals to the sender; few others maintain per-flow statistics or explicitly set the rates the senders should use. Virtually all suggested network-assisted congestion feedback mechanisms are ineffective, not scalable, or limited to data-center contexts. In this proposal, we exploit data-plane programmability of P4 switches as well as hardware-supported priority classes to present a novel network-assisted congestion feedback (NCF) mechanism. The feedback entails NACKs that are directly sent to the sender, and does not involve the receiver; it is, hence, quick and efficient. We propose sending such NACKs during periods of congestion to senders of elephant flows and outline a scalable approach to identify elephant flows. Unlike prior work, NCF is applicable to both data-centers as well as Internet-wide.

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

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

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

[4]  Moses Charikar,et al.  Finding frequent items in data streams , 2002, Theor. Comput. Sci..

[5]  Frederick D. George,et al.  SNA Flow Control: Architecture and Implementation , 1982, IBM Syst. J..

[6]  Graham Cormode,et al.  An Improved Data Stream Summary: The Count-Min Sketch and Its Applications , 2004, LATIN.

[7]  Hari Balakrishnan,et al.  TCP ex machina: computer-generated congestion control , 2013, SIGCOMM.

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

[9]  Waleed Meleis,et al.  QTCP: Adaptive Congestion Control with Reinforcement Learning , 2019, IEEE Transactions on Network Science and Engineering.

[10]  S.E. Minzer,et al.  Broadband ISDN and asynchronous transfer mode (ATM) , 1989, IEEE Communications Magazine.

[11]  Injong Rhee,et al.  CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.

[12]  Hari Balakrishnan,et al.  Copa: Practical Delay-Based Congestion Control for the Internet , 2018, ANRW.

[13]  Peng Liu,et al.  Elastic sketch: adaptive and fast network-wide measurements , 2018, SIGCOMM.

[14]  George Varghese,et al.  New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice , 2003, TOCS.

[15]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Fernando Gont,et al.  Deprecation of ICMP Source Quench Messages , 2012, RFC.

[17]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[18]  Anja Feldmann,et al.  TCP/IP traffic dynamics and network performance: a lesson in workload modeling, flow control, and trace-driven simulations , 2001, CCRV.

[19]  George Varghese,et al.  P4: programming protocol-independent packet processors , 2013, CCRV.

[20]  Philip Levis,et al.  Pantheon: the training ground for Internet congestion-control research , 2018, USENIX Annual Technical Conference.

[21]  Robert N. M. Watson,et al.  Queues Don't Matter When You Can JUMP Them! , 2015, NSDI.

[22]  Nick McKeown,et al.  Processor Sharing Flows in the Internet , 2005, IWQoS.

[23]  Jean Walrand,et al.  Fair end-to-end window-based congestion control , 1998, TNET.

[24]  Fan Yang,et al.  The QUIC Transport Protocol: Design and Internet-Scale Deployment , 2017, SIGCOMM.

[25]  Vladimir Braverman,et al.  One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon , 2016, SIGCOMM.

[26]  Mo Dong,et al.  PCC Vivace: Online-Learning Congestion Control , 2018, NSDI.

[27]  Yongqiang Xiong,et al.  Congestion Control for High-speed Extremely Shallow-buffered Datacenter Networks , 2017, APNet.

[28]  Hiroyuki Ohsaki,et al.  Rate-based congestion control for ATM networks , 1995, CCRV.

[29]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[30]  Junda Liu,et al.  Multi-enterprise networking , 2000 .

[31]  Mo Dong,et al.  PCC: Re-architecting Congestion Control for Consistent High Performance , 2014, NSDI.

[32]  S. Muthukrishnan,et al.  Heavy-Hitter Detection Entirely in the Data Plane , 2016, SOSR.

[33]  Costin Raiciu,et al.  NDP: rethinking datacenter networks and stacks two years after , 2019, CCRV.

[34]  Van Jacobson,et al.  BBR: Congestion-Based Congestion Control , 2016, ACM Queue.

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

[36]  Minlan Yu,et al.  HPCC: high precision congestion control , 2019, SIGCOMM.

[37]  David L. Black,et al.  The Addition of Explicit Congestion Notification (ECN) to IP , 2001, RFC.

[38]  Rong Pan,et al.  Data center transport mechanisms: Congestion control theory and IEEE standardization , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

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

[40]  Liang Guo,et al.  The war between mice and elephants , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[41]  Anja Feldmann,et al.  Efficient policies for carrying Web traffic over flow-switched networks , 1998, TNET.

[42]  Dezun Dong,et al.  Congestion control in high-speed lossless data center networks: A survey , 2018, Future Gener. Comput. Syst..

[43]  Brahim Bensaou,et al.  Reconciling mice and elephants in data center networks , 2015, 2015 IEEE 4th International Conference on Cloud Networking (CloudNet).

[44]  Graham Cormode,et al.  An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.

[45]  Balaji Prabhakar,et al.  A stateless mechanism for providing Quality of Service in the Internet , 1999 .