Adaptive AIMD Congestion Control

AbstractThe main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in a changing environment. However, these objectives are contradicting in particular situations since the algorithm constantly has to probe available bandwidth, which may affect its stability. This paper proposes a novel congestion control algorithm that achieves high bandwidth utilization providing fairness among competing connections and, on the other hand, is sufficiently responsive to changes of available bandwidth. The main idea of the algorithm is to use adaptive setting for the additive increase/multiplicative decrease (AIMD) congestion control scheme, where parameters may change dynamically, with respect to the current network conditions.

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

[2]  Scott Shenker,et al.  A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.

[3]  V. Jacobson Congestion avoidance and control , 1988, CCRV.

[4]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

[5]  J. Mahdavi,et al.  Tcp-friendly unicast rate-based flow control , 1997 .

[6]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[7]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[8]  Anurag Kumar,et al.  Comparative performance analysis of versions of TCP in a local network with a lossy link , 1998, TNET.

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

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

[11]  Baruch Schieber,et al.  Competitive dynamic bandwidth allocation , 1998, PODC '98.

[12]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

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

[14]  Richard M. Karp,et al.  Optimization problems in congestion control , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[16]  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).

[17]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .

[18]  Deepak Bansal,et al.  Dynamic behavior of slowly-responsive congestion control algorithms , 2001, SIGCOMM 2001.

[19]  Christian Schindelhauer,et al.  Discrete Prediction Games with Arbitrary Feedback and Loss , 2001, COLT/EuroCOLT.

[20]  Liang Guo,et al.  TCP-friendly SIMD congestion control and its convergence behavior , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[21]  Fernando Paganini,et al.  Internet congestion control , 2002 .

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

[23]  Naveen Garg,et al.  On-line end-to-end congestion control , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[24]  Modifying TCP's Congestion Control for High Speeds , 2002 .

[25]  Steven H. Low,et al.  Understanding TCP Vegas: a duality model , 2002 .

[26]  S. Low,et al.  Understanding Vegas: a duality model , 2002 .

[27]  Sanjeev Arora,et al.  A Randomized Online Algorithm for Bandwidth Utilization , 2002, SODA '02.

[28]  Yishay Mansour,et al.  AdaVegas: adaptive control for TCP Vegas , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).