- 1-Rate Based Congestion Control over High Bandwidth / Delay Links 1

As the network bandwidth and delay increase, traditional dominant transfer protocols on the Internet like TCP have shown inefficiency and instability to many applications involved in huge amounts of data transfer. We present in this paper a rate based congestion control algorithm as an application level solution. This algorithm is deployed in our SABUL high performance data transfer protocol, which uses UDP to transfer data and TCP to transfer control information. SABUL sends data packet strictly based a smooth rate, and this rate is tuned to avoid congestion by the algorithm discussed in this paper. Such a rate based congestion control is TCP friendly and it has better bandwidth utilization than TCP. SABUL is a proposed for huge amounts of data transfer in high bandwidth long delay networks.

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

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

[3]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[4]  Mario Gerla,et al.  TCP Westwood: congestion control with faster recovery , 2001 .

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

[6]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of routing and management enhancements , 2001, IEEE Commun. Mag..

[7]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 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).

[8]  Robert L. Grossman,et al.  Experiences in Design and Implementation of a High Performance Transport Protocol , 2004, Proceedings of the ACM/IEEE SC2004 Conference.

[9]  TCP Westwood : congestion control with faster recovery UCLA CSD TR # 200017 , 2000 .

[10]  Vern Paxson,et al.  On estimating end-to-end network path properties , 2001, SIGCOMM LA '01.

[11]  Srinivasan Seshan,et al.  Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP , 2002, SIGCOMM '02.

[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]  Matthew Mathis,et al.  Forward acknowledgement: refining TCP congestion control , 1996, SIGCOMM '96.

[14]  H. Balakrishnan,et al.  Dynamic behavior of slowly-responsive congestion control algorithms , 2001, SIGCOMM '01.

[15]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[16]  Robert L. Grossman,et al.  Merging Multiple Data Streams on Common Keys over High Performance Networks , 2002, ACM/IEEE SC 2002 Conference (SC'02).

[17]  A. Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM '01.

[18]  Biswajit Nandy,et al.  THE DYNAMICS OF TCP AND UDP INTERACTION IN IP- QOS DIFFERENTIATED SERVICES NETWORKS , 1999 .

[19]  Paul Barford,et al.  Characteristics of network traffic flow anomalies , 2001, IMW '01.

[20]  Vern Paxson,et al.  On estimating end-to-end network path properties , 2001, SIGCOMM LA '01.