Throughput analysis for TCP NewReno

Today's Internet suffers from a very complex problem-congestion. It is one of the top-ten listed fundamentally important problems in networking. It causes many important data to be lost. Wastage of network resources results from this. It makes the network easily become gridlocked, with little or no data being transported end-to-end. To protect data transfer from this problem various models of TCP are proposed. These variants differ from each other based on the congestion control algorithm and segment loss recovery techniques they use. One of the techniques is TCP NewReno. In this paper throughput analysis of a simple stochastic model for TCP NewReno is described as a mathematical relation of time that it takes for a signal to be sent plus the length of time it takes for an acknowledgment of that signal to be received and also loss behavior which is based on some previous work done over TCP Reno. It has dissimilarity in three characteristics: model for fast recovery, formulation of timeout behavior, and use of loss event. Here a two-parameter loss model is used that can better represent the diverse packet loss framework encountered by TCP on the Internet. The significant performance advantages of TCP NewReno over TCP Reno are shown using the ns-2 simulator. This performance evaluation is considered in case of two queue management mechanisms-DropTail and RED. The main outcomes from the experiments are: 1) In a wide range of network conditions for TCP NewReno there is an analysis of proposed model which can exactly forecast the stable state throughput 2) At the time of congestion TCP NewReno perform better than the Reno and 3) The packet loss against time during data transmission suffers from less loss rate than the existing Reno model.