Analysis on adjustment-based TCP-friendly congestion control: fairness and stability

In this paper, we focus on understanding the binomial congestion control algorithms (Bansal et al., 2001) and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We discuss their global fairness and stability. We prove that such congestion control algorithms can achieve (p, k+l+1)-proportional fairness globally no matter what the network topology is and how many users there are. We also study their dynamical behavior through a control theoretical approach. The smoothness of the congestion control results in a less stable system and slower convergence to fair bandwidth allocation. The modeling and discussion in this paper are quite general and can be easily applied to equation-based TCP-friendly congestion control schemes, another category of TCP-friendly transport protocols.

[1]  Injong Rhee,et al.  TEAR: TCP emulation at receivers – flow control for multimedia streaming , 2000 .

[2]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  Henning Schulzrinne,et al.  The Loss-Delay Based Adjustment Algorithm: A TCP-Friendly Adaptation Scheme , 1998 .

[4]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[5]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[6]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[8]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM 2000.

[9]  Deepak Bansal,et al.  Binomial congestion control algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[11]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM.

[12]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[13]  B. Barden Recommendations on queue management and congestion avoidance in the Internet , 1998 .

[14]  Yang Richard Yang,et al.  General AIMD congestion control , 2000, Proceedings 2000 International Conference on Network Protocols.

[15]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[16]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[17]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[18]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

[19]  Sridhar Ramesh,et al.  Issues in Model-Based Flow Control , 1999 .

[20]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.