Performance Analysis of TCP Variants
Performance Analysis of TCP Variants
Sanjay Rajashekhar (91sanjay@ccs.neu.edu)
Tiantong Deng (dtt@ccs.neu.edu)
Ganesh Aithal Parampalli Narayana (ganeshpn@ccs.neu.edu)
Abstract— TCP is the main and most widely used transport protocol for reliable communication. Because of its widespread need, researchers have been studying and proposing new TCP variants trying to improve its behavior towards queuing and congestion to make it use the most available bandwidth while preserving a logical level of fairness towards other protocols. This paper aims at evaluating and comparing the performance of the
TCP variants (Tahoe, Reno, NewReno and Vegas) based on congestion, queuing and fairness. We carefully choose scenarios to investigate the throughput, intra- and inter-protocol fairness of these TCP variants. We argue through analysis that TCP Vegas, with its better bandwidth estimation scheme, uses the network resources more efficiently and fairly than other TCP variants.
Simulation results are given that support the results of the analysis. Key Words — TCP Tahoe, Reno, NewReno, Vegas, Constant Bit rate (CBR), Congestion, NS-2, TTL, SACK, RTT, SACK, RED,
UDP and DropTail.
I. INTRODUCTION
In networking, data and information are most important in real life scenario. The clear comparative ideas in different perspectives of congestion windowing mechanism plays a big role. To have a correct comparison between different mechanisms of congestion windowing, simulation of data transfer and drop with different protocols & variants and the correct mathematical analysis of data transfer are must.
Transmission Control Protocol is a widely used connection oriented transport layer protocol that provides a reliable packet delivery over an unreliable network. Several different variants have been developed in order to refine congestion control.
In this paper we analyze the performance of various TCP variants (TCP Tahoe, TCP Reno, TCP NewReno, and TCP
Vegas).
Sanjay Rajashekhar (91sanjay@ccs.neu.edu)
Tiantong Deng (dtt@ccs.neu.edu)
Ganesh Aithal Parampalli Narayana (ganeshpn@ccs.neu.edu)
Abstract— TCP is the main and most widely used transport protocol for reliable communication. Because of its widespread need, researchers have been studying and proposing new TCP variants trying to improve its behavior towards queuing and congestion to make it use the most available bandwidth while preserving a logical level of fairness towards other protocols. This paper aims at evaluating and comparing the performance of the
TCP variants (Tahoe, Reno, NewReno and Vegas) based on congestion, queuing and fairness. We carefully choose scenarios to investigate the throughput, intra- and inter-protocol fairness of these TCP variants. We argue through analysis that TCP Vegas, with its better bandwidth estimation scheme, uses the network resources more efficiently and fairly than other TCP variants.
Simulation results are given that support the results of the analysis. Key Words — TCP Tahoe, Reno, NewReno, Vegas, Constant Bit rate (CBR), Congestion, NS-2, TTL, SACK, RTT, SACK, RED,
UDP and DropTail.
I. INTRODUCTION
In networking, data and information are most important in real life scenario. The clear comparative ideas in different perspectives of congestion windowing mechanism plays a big role. To have a correct comparison between different mechanisms of congestion windowing, simulation of data transfer and drop with different protocols & variants and the correct mathematical analysis of data transfer are must.
Transmission Control Protocol is a widely used connection oriented transport layer protocol that provides a reliable packet delivery over an unreliable network. Several different variants have been developed in order to refine congestion control.
In this paper we analyze the performance of various TCP variants (TCP Tahoe, TCP Reno, TCP NewReno, and TCP
Vegas).
References: [1] Sally Floyd and Van Jacobson, "Random early detection gateways for congestion avoidance," IEEE/ACM Transactions on Networking, vol.1, pp. 397-413, August 1993. [2] W. Richard Stevens, TCP/IP Illustrated, Volume 1: The Protocols. Reading, Massachusetts: Addison-Wesley, 1994. [3] Kevin Fall and Sally Floyd, “Simulation-based Comparisons of Tahoe, Reno, and SACK TCP” [4] http://www.iaeng.org/publication/IMECS2009/IMECS200 9_pp351-353.pdf