• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.311-315
• /
• 2003

Recently, there is asymmetrical transmission in Internet data stream. The asymmetrical transmission has much more downstream than upstream. Owing to this point, it needs to reduce the acknowledgement as element of the obsrtuction in downstream. In this paper, according to simulation's result, we know that Sack has good performance than New Reno in bottleneck environment Comparing two protocols in packet loss rate, NewReno is lower than Sack. And also comparing two protocols in throughput of ack packet, not only NewReno processes ack packet more quickly than Sack, but also NewReno processes more ack packet than Sack protocol during ten seconds in simulation. As a result, NewReno is batter than Sack in throughput of asymmetrical link.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.288-297
• /
• 2003

The fast retransmit and fast recovery algorithm of TCP Reno, when multiple packets in the same window are lost, cannot recover them without RTO (Retransmission Timeout). TCP New-Reno can recover multiple lost packets by extending fast recovery using partial acknowledgement. If the retransmitted packet is lost again during fast recovery, however, RTO cannot be avoided. In this paper, we propose an algorithm called "Duplicate Acknowledgement Counting(DAC)" to alleviate this problem. DAC can detect the retransmitted packet loss by counting duplicate ACKs. Conditions that a lost packet can be recovered by loss recovery of TCP Reno, TCP New-Reno and TCP New-Reno using DAC are derived by modeling loss recovery behavior of each TCP. We calculate the loss recovery probability for random packet loss probability numerically, and show that DAC can improve loss recovery behavior of TCP New-Reno.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.4
• /
• pp.148-154
• /
• 1999

TCP has improved by many papers which suggest the new algorithms and modify the previous algorithms. This paper compares Tahoe, Reno, New-Reno, Vegas, and SACK. The first version is Tahoe and is globally used. Reno has optimal performance during occurring one packet loss within a window of data, but can suffer from performance when multiple packets are dropped from a window of data. New-Reno avoids some of the performance problems of Reno TCP when multiple packets are dropped from a window of data. but is occurring the problem of the necessary retransmission. SACK resolves the all above problems and is used in bandwidth delay product environment. Vegas uses network bandwidth more efficiently and is a new implementation of TCP that achieves between 40 and 70 better throughput, with one-fifth to one-half the losses, as compared to the implementation of Reno TCP.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.583-592
• /
• 2005

An important factor influencing the robustness of the Internet is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes the network congestion worse. Brakmo and Peterson proposed a congestion control algorithm, TCP Vegas, by modifying the congestion avoidance scheme of TCP Reno. Many studies indicate that Vegas is able to achieve better throughput and higher stability than Reno. But there are three unfairness problems in Vegas. These problems hinder the spread of Vegas in the current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP NewVegas. The proposed NewVegas is able to solve these unfairness problems effectively by using the variation of the number of queued packets in a bottleneck router. To evaluate the proposed approach, we compare the performance among NewVegas, Reno and Vegas. Through the simulation, NewVegas is shown to be able to achieve throughput and better fairness than Vegas.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.269-279
• /
• 2004

The most important factor influencing the robustness of the Internet Is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes worse the network congestion. Recently, Brakmo and Peterson have proposed a new version of TCP, which is named TCP Vegas, with a fundamentally different congestion control scheme from that of the Reno. Many studies indicate that the Vegas is able to achieve better throughput and higher stability than the Reno. But there are two unfairness problems in Vegas. These problems hinder the spread of the Vegas in current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP PowerVegas. The existing Vegas depends mainly only on the rtt(round trip time), but the proposed PowerVegas use the new congestion control scheme combined the Information on the rtt with the information on the packet loss. Therefore the PowerVegas performs the congestion control more competitively than the Vegas. Thus, the PowerVegas is able to solve effectively these unfairness problems which the Vegas has experienced. To evaluate the proposed approach, we compare the performance among PowerVegas, Reno and Vegas under same network environment. Using simulation, the PowerVegas is able to achieve better throughput and higher stability than the Reno and is shown to achieve much better fairness than the existing Vegas.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.650-659
• /
• 2004

Domestic wireless network environment is changing rapidly while adapting to meet service requirements of users and growth of market. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired networt TCP suffers significant performance degradation over wireless network where packet losses are not always result of network congestion. Especially RTO imposes a great performance degradation of TCP. In this paper, we propose DAC$^{＋}$ and EFR in order to prevent performance degradation by quickly detecting and recovering loss without RTO during fast recovery. Compared with TCP NewReno, proposed scheme shows improvements in steady-state in terms of higher fast recovery Probability and reduced response time.

• Journal of Advanced Navigation Technology
• /
• v.12 no.3
• /
• pp.233-238
• /
• 2008

Recently, network component become to follow wireless and mobile network from wired network proposed that many TCP algorithm optimized in variety environment. When TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. Transmission errors are more frequent and may be incorrectly regarded as indications of network congestion. In this paper, it conduct how effect congestion control algorithm in Mobile ad-hoc network and compare traffic of TCP-Tahoe, TCP-Reno, TCP-New-Reno and TCP-Vegas in Mobile ad-hoc environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.675-684
• /
• 2004

There have been several efforts to avoid unnecessary retransmission timeouts (RTOs), which is the main cause for TCP throughput degradation. Unnecessary RTOs can be classified into three groups according to their cause. RTOs due to multiple packet losses in the same window for TCP Reno, the most prevalent TCP version, can be avoided by TCP NewReno or using selective acknowledgement (SACK) option. RTOs occurring when a packet is lost in a window that is not large enough to trigger fast retransmit can be avoided by using the Limited Transmit algorithm. In this Paper, we comparatively analyze these schemes to cope with unnecessary RTOs by numerical analysis and simulations. On the basis of the results in this paper, TCP performance can be quantitatively predicted from the aspect of loss recovery probability. Considering that overall performance of TCP is largely dependent upon the loss recovery performance, the results shown in this paper are of great importance.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.21-27
• /
• 2008

TCP receivers deliver ACK packets to senders for reliable end-to-end transfer. When ACK packets are not transferred properly because of network congestion, the performance of TCP degrades. This paper proposes a reverse congestion warning mechanism and a congestion handling mechanism in heterogeneous networks with heavy background traffic in the backward direction. Help from TCP receivers or hardware such as routers and gateways other than the ACK packets themselves is not necessary. TCP senders compare the arrival intervals of ACK data passed from receivers and the difference in t imestamp values echoed by receivers. According to the simulation results using the NS-2 network simulator, the proposed scheme shows a performance elevation of 20% greater than Reno, 150% greater than New Reno, and 450% greater than Westwood, respectively, under heterogeneous networks and that the error rate of the radio link is 1% when the backward network is congested.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.235-244
• /
• 2004

TCP Vegas version provides better performance and more stable services than TCP Tahoe and Reno versions, which are widely used in the current Internet. However, in the situation where TCP Vegas and Reno share the bottleneck link, the performance of TCP Vegas is much smaller than that of TCP Reno. This unfairness is due to the difference of congestion control mechanisms of each TCP use. Several studies have been executed in order to solve this unfairness problem. In this paper, we analyze the minimum window size to maintain the maximum TCP performance of link bandwidth. In addition, we propose an algorithm which maintains the TCP performance and improves fairness by selective packet drops in order to allocate proper window size of each TCP connections. To evaluate the performance of the proposed algorithm, we have measured the number of data bytes transmitted between end-to-end systems by each TCP connections. The simulation results show that the proposed algorithm maintains the maximum TCP performance and improves the fairness.