Fairness Comparison Based on Queue Schedule between Fast and Reno

In the current TCP congestion control algorithm, TCP Reno and its variants in the high-speed networks, has encountered many constraints. It is difficult to meet the higher requirements of QoS guarantee. The emergence of the Fast TCP may be used as the alternative TCP in congestion control in high-speed network environment. So it is necessary to make a comparison between TCP Reno and FAST TCP on the fairness. This paper puts the focus on considering a number of TCP Reno and FAST TCP sharing a bottleneck link. By comparing the TCP Reno and FAST TCP based on queue management with the two typical scheduling algorithms Drop-Tail and RED, the throughput analysis of the two versions of TCP can show fairness between the TCP Reno and FAST TCP. The numerical analysis and NS2 simulation results can give the guidance for deploying of FAST TCP.