Adaptive AIMD congestion control

The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in changing environment. However, these objectives are contradicting in particular situations since the algorithm has to constantly 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]  Naveen Garg,et al.  On-line end-to-end congestion control , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

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

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

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

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

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

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

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

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

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

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

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

[14]  Sally Floyd,et al.  2 What ’ s the Problem ? 2 . 1 Basics TCP uses the following algorithm to adjust its congestion window , 2002 .

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

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

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

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

[19]  Larry L. Peterson,et al.  Understanding TCP Vegas: a duality model , 2001, JACM.

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

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

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

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