Improved Algorithm of TCP Congestion Control
Xie Hua
Abstract
Xie Hua
Abstract
TCP Reno congestion control mechanism based on the algorithm of Additive Increase Multiplicative Decrease(AIMD) is mainly used in the Internet in the present.Aiming at the drawback of this algorithm in dealing with the detection of available bandwidth utilization rate due to AIMD factors too arbitrary,traditional AIMD algorithm is researched and a smooth channel capacity detection algorithm based on the growth of a congestion window is proposed,its throughput,fairness and friendliness are evaluated by NS simulation.Simulation results show that the throughput of modification algorithm of TCP outperforms TCP Reno by 10%.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
TCP Reno congestion control mechanism based on the algorithm of Additive Increase Multiplicative Decrease(AIMD) is mainly used in the Internet in the present.Aiming at the drawback of this algorithm in dealing with the detection of available bandwidth utilization rate due to AIMD factors too arbitrary,traditional AIMD algorithm is researched and a smooth channel capacity detection algorithm based on the growth of a congestion window is proposed,its throughput,fairness and friendliness are evaluated by NS simulation.Simulation results show that the throughput of modification algorithm of TCP outperforms TCP Reno by 10%.
Key concepts: Computer science, CUBIC TCP, Network congestion, TCP Westwood plus, TCP Friendly Rate Control, H-TCP, Algorithm, Throughput