Throughput Analysis of TCP SACK in comparison to TCP Tahoe, Reno, and New Reno against Constant Rate Assignment (CRA) of 2500 and 4500 bps

This paper illustrates comparative analysis of TCP-SACK against three different TCP variants namely TCP-Reno, TCP-New Reno, and TCP-Tahoe. The comparison is conducted with the help of simulations, which corroborate the reliability of TCP-SACK as a stream-based, connection-oriented, and most reliable end-to-end data transfer protocol amongst other TCP variants. The performances of TCP variants have been evaluated against constant rate assignment for the values of 2500bps and 4500bps. The selected parameter provides different results in terms of TCP throughput for all of the TCP variants. In each case, the values of the congestion window (cwnd) are recorded and plotted against regular intervals of time. The behaviour of TCP variants is studied by observing the simulated graph results provided for each case. The results prove TCP-SACK to be efficient wireless, heterogeneous networks.

[1]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[2]  José Roberto Boisson de Marca,et al.  A comparative analysis of paging and location update strategies for PCS networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[3]  Jaakko J. Sauvola,et al.  Mobility and mobility management: a conceptual framework , 2002, Proceedings 10th IEEE International Conference on Networks (ICON 2002). Towards Network Superiority (Cat. No.02EX588).

[4]  Jiang Xie.  User Independent Paging Scheme for Mobile IP , 2006, Wirel. Networks.

[5]  John S. Sobolewski,et al.  SideCar: building programmable datacenter networks without programmable switches , 2010, Hotnets-IX.

[6]  Yuan-Cheng Lai,et al.  TCP congestion control algorithms and a performance comparison , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).