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

• 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 Institute of Information and Communication Engineering
• /
• v.7 no.6
• /
• pp.1194-1201
• /
• 2003

Measurements of network traffic have shown that self-similarity is a ubiquitous phenomenon spanning across diverse network environments. We have advance the framework of multiple time scale congestion control and show its effectiveness at enhancing performance for fast TCP prototype control. In this paper, we extend the fast TCP prototype control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of fast TCP prototype is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. We explicate out methodology for discerning and evaluating the impact of changes in transport protocols in the protocol stack under self-similar traffic conditions. We discuss issues arising in comparative performance evaluation under heavy-tailed workload. workload.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1352-1355
• /
• 2009

TCP에서 사용되는 혼잡제어(Congestion control)는 많은 이점이 있지만 그에 상응하는 단점이 존재한다. 가장 널리 사용되고 있는 TCP-Reno는 혼잡이 발생되면 혼잡 윈도우(Congestion Window)크기를 절반으로 줄이고 빠른 회복(fast recovery), 빠른 재전송(fast transmit)을 수행한다. 하지만 네트워크가 고속 네트워크로 접어들면서 효율적인 측면에서 이러한 기법들을 적용하기에는 문제가 따른다. 현재 사용되고 있는 TCP는 혼잡이 발생하면 선형적으로 점진적으로 증가 하기 때문에 많은 대역폭을 지원하는 고속 네트워크에서는 이러한 TCP의 혼잡 제어가 오히려 비 효율적이다. 본 논문에서는 이러한 문제점을 해결하기 위해 혼잡 윈도우 증가율을 추가한 혼잡제어 기법인 TCP-FBA(Fast Bandwidth Acquisition)를 제안한다.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.275-284
• /
• 2010

The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delaybased, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols.

• Journal of information and communication convergence engineering
• /
• v.2 no.4
• /
• pp.214-218
• /
• 2004

In this paper, we have analyzed TCP performance over wireless correlated fading links with and without Snoop protocol. For a given value of the packet error rate, TCP performance without Snoop protocol is degraded as the fading is getting fast (i.e. the user moves fast). When Snoop protocol is introduced in the base station, TCP performance is enhanced in most wireless environments. Especially the performance enhancement derived from using Snoop protocol is large in fast fading channel. This is because packet errors become random and sporadic in fast fading channel and these random packet errors (mostly single packet errors) can be compensated efficiently by Snoop protocol's local packet retransmissions. But Snoop protocol can't give a large performance improvement in slow fading environments where long bursts of packet errors occur. Concerning to packet error rate, Snoop protocol results in the highest performance enhancement in the channel with mid-high values of packet error rate. This means Snoop protocol cannot fully fulfill its ability under too low or too high packet error rate environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.130-137
• /
• 2005

Wireless communication environment is changing rapidly as we use new wireless communication technology such as WiBro to access high speed Internet. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired network, TCP suffers significant performance degradation over wireless network where packet losses are related to non-congestion loss. Especially RTO imposes a great performance degradation of TCP. In this paper, we analyze the loss recovery probabilities based on previous researches, and use simulation results of our algorithm to show that it prevents performance degradation by quickly detecting and recovery losses without RTO during fast recovery.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10B
• /
• pp.638-643
• /
• 2007

Interconnecting wireless local area networks (WLANs) with third generation (3G) cellular networks has become an issue of great interest. However, a Vertical Handover (VHO) causes an abrupt change in link bandwidth. Due to such a change, TCP triggers unnecessary fast retransmission during a Downward VHO (DVHO) from a cellular network to a WLAN, causing throughput degradation. Thus, we propose a new reordering mechanism for DVHO that suppresses unnecessary retransmission due to the spurious duplicate acknowledgments. We analytically investigate the throughput of TCP in the literature and our proposed scheme. Through the numerical and simulation results, it is shown that our proposed TCP achieves better performance in terms of throughput, compared with Nodupack with SACK.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.399-403
• /
• 2004

In this paper, we have analyzed the TCP throughput of Portable Internet system in 2.3GHz wireless environment with considering user's mobility speed. As the Portable Internet uses large cells compared to wireless LAM and supports user's nobility, we have adapted different wireless channel model to derive the TCP throughput of the system. We have assumed wireless channel is Rayleigh fading channel and the channel is modeled as two-state Markov model with which user's nobility speed can be considered by varying transition matrix of the model. from the simulation results, we have known that higher TCP throughput under the slow fading than under the fast fading. Because the TCP throughput is closely related to the sender's congestion control, the more congestion control is done by the sender, the lower TCP throughput we have. The more congestion control is caused in the sender under the fast fading than the slow fading so the lower TCP throughput is resulted in the fast fading environment.