QTCP: An Optimized and Improved Congestion Control Algorithm of High-Speed TCP Networks

TCP researchers evaluated the performance and fairness of different TCP protocols on the basis of new algorithms. The new High-Speed Transport Control Protocols (HS-TCP) were developed but there are still many problems regarding to bandwidth utilization, throughput and packet loss rate. To overcome these problems Quick Transport Control Protocol (QTCP) algorithm based on optimizations of HS-TCP slow start algorithm and Additive Increase and Multiplicative Decrease (AIMD) algorithm have been proposed. A modified algorithm has been developed by using an additive increase approach to grow window with normal speed and to increase scalability by putting constant value of stability of timeline in congestion avoidance phase. This constant timeline gives long stability time; it provides many benefits as compared to other high-speed TCP protocols. The improved algorithm increased throughput and decreased packet loss rate and fairly share link utilization. In this regards several experiment of simulations were observed the fairness. The results show best bandwidth utilization, improved throughput and less packet loss rate as compared to other high speed TCP variants.

[1]  Evandro de Souza,et al.  A HighSpeed TCP Study : Characteristics and Deployment Issues , 2003 .

[2]  吕勇,et al.  CW-HSTCP： Fair TCP in high-speed networks , 2006 .

[3]  Injong Rhee,et al.  CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.

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

[5]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[6]  Sally Floyd.  Limited Slow-Start for TCP with Large Congestion Windows , 2004, RFC.

[7]  Rachid Mbarek,et al.  Performance Evaluation of Competing High-Speed TCP Protocols. , 2008 .

[8]  Mohamed Othman,et al.  Progress in Various TCP Variants: Issues, Enhancements and Solutions , 2009 .

[9]  Injong Rhee,et al.  Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

[10]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[11]  Xuezeng Pan,et al.  An algorithm for reducing loss rate of high-speed TCP , 2006 .

[12]  Balázs Sonkoly,et al.  Understanding highspeed TCP: A control-theoretic perspective , 2005, Communications and Computer Networks.

[13]  Michele C. Weigle,et al.  Performance of Competing High-Speed TCP Flows , 2006, Networking.

[14]  Richard Hughes-Jones,et al.  Evaluation of Advanced TCP Stacks on Fast Long-Distance Production Networks , 2003, Journal of Grid Computing.

[15]  Jason Lee,et al.  Microscopic examination of TCP flows over transatlantic links , 2003, Future Gener. Comput. Syst..

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

[17]  Go HASEGAWA,et al.  Performance Analysis of HighSpeed TCP and its Improvement for High Throughput and Fairness against TCP Reno Connections , 2003 .

[18]  Douglas J. Leith,et al.  H-TCP : TCP for high-speed and long-distance networks , 2004 .

[19]  Ali Hamlili.  Performance evaluation for competing high-speed TCP protocols , 2009, 2009 Global Information Infrastructure Symposium.