2007Jisuanji fangzhenRequires access

Research on TCP Congestion Control Algorithms Based on Simulation

Rong Chen

Open publisher page 0 citations

Abstract

This paper discusses several different TCP Congestion Control Algorithms such as Tahoe,Reno,Newreno,SACK in the level of the packet and also explores the benefits of adding selective acknowledgments(SACK) and selective repeat to TCP.Simulation results are used to compare the performance of TCP protocol under the same network conditions.In particular,when multiple packages are dropped from a window of data,TCP Reno without selective acknowledgments achieves badly ultimate performance.A conservative extension of TCP Reno is modified to use the selective acknowledgments option,highlight performance is achieved by TCP SACK.The SACK implementation could be improved in its robustness to reordered packages and retransmission efficiency and channel utilization.

About this research paper

What this paper is about

This paper discusses several different TCP Congestion Control Algorithms such as Tahoe,Reno,Newreno,SACK in the level of the packet and also explores the benefits of adding selective acknowledgments(SACK) and selective repeat to TCP.Simulation results are used to compare the performance of TCP protocol under the same network conditions.In particular,when multiple packages are dropped from a window of data,TCP Reno without selective acknowledgments achieves badly ultimate performance.A conservative extension of TCP Reno is modified to use the selective acknowledgments option,highlight performance is achieved by TCP SACK.The SACK implementation could be improved in its robustness to reordered packages and retransmission efficiency and channel utilization.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper discusses several different TCP Congestion Control Algorithms such as Tahoe,Reno,Newreno,SACK in the level of the packet and also explores the benefits of adding selective acknowledgments(SACK) and selective repeat to TCP.Simulation results are used to compare the performance of TCP protocol under the same network conditions.In particular,when multiple packages are dropped from a window of data,TCP Reno without selective acknowledgments achieves badly ultimate performance.A conservative extension of TCP Reno is modified to use the selective acknowledgments option,highlight performance is achieved by TCP SACK.The SACK implementation could be improved in its robustness to reordered packages and retransmission efficiency and channel utilization.

Key concepts: Sack, TCP Westwood plus, TCP global synchronization, TCP Friendly Rate Control, TCP acceleration, Computer science, Compound TCP, TCP Westwood

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on TCP Congestion Control Algorithms Based on Simulation — Research Paper | ScholarLens