Data center transport mechanisms: Congestion control theory and IEEE standardization

Data Center Networks present a novel, unique and rich environment for algorithm development and deployment. Projects are underway in the IEEE 802.1 standards body, especially in the Data Center Bridging Task Group, to define new switched Ethernet functions for data center use. One such project is IEEE 802.1Qau, the Congestion Notification project, whose aim is to develop an Ethernet congestion control algorithm for hardware implementation. A major contribution of this paper is the description and analysis of the congestion control algorithm - QCN, for Quantized Congestion Notification- which has been developed for this purpose. A second contribution of the paper is an articulation of the Averaging Principle: a simple method for making congestion control loops stable in the face of increasing lags. This contrasts with two well-known methods of stabilizing control loops as lags increase; namely, (i) increasing the order of the system by sensing and feeding back higher-order derivatives of the state, and (ii) determining the lag and then choosing appropriate loop gains. Both methods have been applied in the congestion control literature to obtain stable algorithms for high bandwidth-delay product paths in the Internet. However, these methods are either undesirable or infeasible in the Ethernet context. The Averaging Principle provides a simple alternative, one which we are able to theoretically characterize.

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

[2]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Netw..

[3]  Frank Kelly,et al.  Fairness and Stability of End-to-End Congestion Control , 2003, Eur. J. Control.

[4]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Injong Rhee,et al.  Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

[6]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[7]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications) , 2004 .

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

[9]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[10]  A. Varga,et al.  THE OMNET++ DISCRETE EVENT SIMULATION SYSTEM , 2003 .

[11]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[12]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

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

[14]  A. Varga,et al.  Using the OMNeT++ discrete event simulation system in education , 1999 .

[15]  Rong Pan,et al.  Congestion control in networks with no congestion drops , 2006 .

[16]  Fernando Paganini,et al.  Dynamics of TCP/RED and a scalable control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, and Performance , 2004, INFOCOM.