TCP-friendly SIMD congestion control and its convergence behavior

The increased diversity of Internet application requirements has spurred interest in flexible congestion control mechanisms. Window-based congestion control schemes use increase rules to probe available bandwidth, and decrease rules to back off when congestion is detected. The control rules are parameterized so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and packet loss rate. We propose a novel window-based congestion control algorithm called SIMD (Square-Increase/Multiplicative-Decrease). Contrary to previous memoryless controls, SIMD utilizes history information in its control rules. It uses multiplicative decrease but the increase in window size is in proportion to the square of the time elapsed since the detection of the last loss event. Thus, SIMD can efficiently probe available bandwidth. Nevertheless, SIMD is TCP-friendly as well as TCP-compatible through RED routers. Furthermore, SIMD has much better convergence behavior than TCP-friendly AIMD and binomial algorithms proposed previously.

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

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

[3]  Liang Guo,et al.  A spectrum of TCP-friendly window-based congestion control algorithms , 2003, TNET.

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

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

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

[7]  Matthew Mathis,et al.  The stationary behavior of ideal TCP congestion avoidance , 1996 .

[8]  Min Sik Kim,et al.  Transient behaviors of TCP-friendly congestion control protocols , 2003, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  H. Vin,et al.  Additive Increase Appears Inferior , 2000 .

[10]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[11]  Sally Floyd,et al.  Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic , 1991, CCRV.

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

[13]  S. Floyd,et al.  Tcp-friendly unicast rate-based flow control , 1997 .

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

[15]  SemkeJeffrey,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .

[16]  Kevin Jeffay,et al.  Tuning RED for Web traffic , 2000, TNET.

[17]  Chadi Barakat,et al.  A stochastic model of TCP/IP with stationary random losses , 2000, TNET.

[18]  Deborah Estrin,et al.  RAP: An end-to-end rate-based congestion control mechanism for realtime streams in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[19]  Henning Schulzrinne,et al.  RTP: A Transport Protocol for Real-Time Applications , 1996, RFC.

[20]  Avideh Zakhor,et al.  Real-Time Internet Video Using Error Resilient Scalable Compression and TCP-Friendly Transport Protocol , 1999, IEEE Trans. Multim..

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

[22]  Mark Handley,et al.  A Comparison of Equation-Based and AIMD Congestion Control , 2000 .

[23]  Henning Schulzrinne,et al.  The Loss-delay Based Adjustment Algorithm: a Tcp-friendly Adaptation Scheme , 1998 .

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

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

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

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