• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.10
• /
• pp.18-25
• /
• 2000

In this paper, we analyze TCP congestion control algorithm over ATM-UBR network. TCP congestion control algorithm consists of slow start, congestion avoidance, fast recovery, fast retransmit. We analyze the ATM-UBR network service using the BSD 4.3 TCP Reno, Vanilla. However we found the fact that the characteristic of fast retransmit, recovery algorithm makes a serious degradation of Performance in multiple losses of packets. We propose new fast retransmit, recovery algorithm to improve the problem. The results of performance analysis improve the multiple losses of packets using a proposed fast retransmit, recovery algorithm.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.98-107
• /
• 2008

In mobile ad hoc networks, packet loss is unavoidable due to MAC contention, link failure or the inherent characteristics of wireless link. Since TCP relies on the timely reception of TCP ACK packets to progress the transmission of the TCP DATA packets, ACK loss obviously affects the performance due to two main problems: (a) Frequent occurrence of spurious retransmissions caused by timeout events and (b) impairment of the fast retransmit mechanism caused by the lack of a sufficient number of duplicate ACK packets. In particular, since most reactive routing protocols force the packets buffered over a path to be discarded while performing a route recovery, the performance degradation becomes more serious due to such ACK loss. In this paper, therefore, TCP with two piggybacking schemes (called TCP-pgy) is proposed in order to resolve the above-mentioned problems over reactive routing protocols. Through extensive simulations using the ns-2 simulator, we prove that our proposed schemes contribute to TCP performance improvements.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.235-244
• /
• 2004

There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) performance in a numerical way. Especially, under the recent advance in wireless transmission technology, the issue of TCP performance over wireless links has come to surface. It is because TCP responds to all packet losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. By several previous works, although it has been already proved that overall TCP performance is largely dependent on its loss recovery performance, there have been few works to try to analyze TCP loss recovery performance with thoroughness. In this paper, therefore, we focus on analyzing TCP's loss recovery performance and have developed a simple model that facilitates to capture the TCP sender's behaviors during loss recovery period. Based on the developed model, we can derive the conditions that packet losses may be recovered without retransmission timeout (RTO). Especially, we have found that TCP Reno can retransmit three packet losses by fast retransmits in a specific situation. In addition, we have proved that successive three packet losses and more than four packet losses in a window always invoke RTO easily, which is not considered or approximated in the previous works. Through probabilistic works with the conditions derived, the loss recovery performance of TCP Reno can be quantified in terms of the number of packet losses in a window.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.741-746
• /
• 2012

Transmission control protocol(TCP) widely used as a transport protocol in the Internet includes a loss recovery function that detects and recovers packet losses by retransmissions. The loss recovery function consists of the two algorithms; fast retransmit and fast recovery. There have been researches to avoid nonnecessary retransmission timeouts (RTOs), which leads to selective acknowledgement (SACK) option and limited transmit scheme that are standardized by IETF (Internet Engineering Task Force). Recently, a method that covers the case in which a retransmitted packet is lost again has been propsed. The method, however, is not proved in terms of the additive increase multiplicative decrease (AIMD) principle of TCP congestion control. In this paper, therefore, we analyzed the method in terms of the principle by ns-simulations.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.197-212
• /
• 2002

Transmission Control Protocol (TCP) [1] has been tuned as a reliable transfer protocol for traditional networks comprising wired links and stationary hosts with same link characteristics. TCP assumes that congestion in the network be a primary cause for packet losses and unusual delays. TCP performs welt over such networks adapting to end-to-end delays and congestion losses, by standard congestion control mechanisms, such as slow-start, congestion avoidance, fast retransmit and recovery. However, networks with wireless and other lossy links suffer from significant losses due to bit errors and handoffs. An asymmetry network such as ADSL has different bandwidth for both directions. As a result, TCP's standard mechanisms incur end-to-end performance degradation in various links. In this paper, we analyze the TCP problems in wireless, satellite, and asymmetry links, and measure the new TCP mechanisms that are recommended by IETF Performance Implications of Link Characteristics (PILC) WG[2], by using Network Simulator 2 (NS-2).

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.474-476
• /
• 1998

전송 프로토콜은 응용 프로그램과 네트워크의 인터페이스로서, 응용 프로그램에서 요구한 QoS(Quality of Service)를 제공하는 역할을 한다. 이 중 TCP는 인터넷의 전송 흐름 제어를 위해서 사용되는 프로토콜이다. TCP의 흐름 제어를 위해서 수신된 데이터의 ACK(acknowledgement)에 따라 허가된 윈도크기만큼의 데이터를 보내는 크레디트 할당 밀집 윈도(congestion window)를 사용한 slow-start 알고리즘을 사용하며, 손실된 데이터를 재전송하기 위한 방법으로 빠른 재전송 및 회복 알고리즘을 사용한다. 본 논문에서는 빠른 재전송 알고리즘에서 나타나는 문제점을 알아보고, 이 알고리즘이 빠른 시간에 데이터 손실을 회복하고 데이터를 보낼 수 있도록 수정한 알고리즘을 소개한다. 또한 수정된 알고리즘을 확장하여 네트워크의 상태에 따라 더 많은 데이터를 보낼 수 있도록 개선한 알고리즘을 제안한다.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.382-390
• /
• 2005

As today's networks evolve towards an If-based integrated network, the role of transmission control protocol(TCP) has been increasing as well. As a well-known issue, the performance of TCP is affected by its loss recovery mechanism that is comprised of two algorithms; fast retransmit and fast recovery. Although retransmission timeout(RTO) caused by multiple packet losses can be avoided by using selective acknowledgement(SACK) option, RTO cannot be avoided if a retransmitted packet is lost. Therefore, we propose a simple modification to make it possible for a TCP sender using SACK option to detect a lost retransmission. In order to evaluate the proposed algorithm, simulations have been performed for two scenarios where packet losses are random and correlated. Simulation results show that the proposed algorithm can improve TCP performance significantly.

• 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.