• Proceedings of the KAIS Fall Conference
• /
• 2004.11a
• /
• pp.199-202
• /
• 2004

본 논문에서는 유선망과 무선망이 혼재된 네트워크 환경에서 유선망에서 발생한 혼잡 상황을 송신측에 빨리 알려서 손실된 패킷에 대한 신속한 fast retransmission을 가능하도록 하는 기법을 제안한다. 제안된 기법은 유선망과 무선망의 경계에 있는 기지국에 구현되는데, 유선망으로부터 순서가 유지되지 않은 패킷이 3 개 연속해서 오게 되면 수신부로부터 3 개의 중복 ACK 세그먼트가 오기를 기다리지 말고 즉시 송신측에 3 개의 중복 ACK를 인위적으로 만들어 전송함으로써 송신측이 망의 혼잡 상황을 빨리 파악하여 대처할 수 있도록 한다. 특히 무선망 환경은 유선망에 비해 상대적으로 에러가 많이 발생하는 환경이므로 유선망의 혼잡 상황을 무선망의 수신부 측이 중복 ACK를 통해 알도록 하는 것은 상당한 지연을 야기 할 수 있으므로 제시된 기법은 이러한 환경에서 효과적으로 사용될 수 있다. 제안된 기법의 성능 향상 효과를 NS-2를 통한 시뮬레이션을 통해 확인하였다.

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

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.324-330
• /
• 2011

To avoid collisions, IEEE 802.11 medium access control (MAC) uses predetermined inter-frame spaces and the random back-off process. However, the retransmission strategy of IEEE 802.11 MAC results in considerable time wastage. The hidden node problem is well known in wireless networks; it aggravates the consequences of time wastage for retransmission. Many collision prevention and recovery approaches have been proposed to solve the hidden node problem, but all of them have complex control overhead. In this paper, we propose a fast retransmission scheme as a recovery approach. The proposed scheme identifies collisions caused by hidden nodes and then allows retransmission without collision. Analysis and simulations show that the proposed scheme has greater throughput than request-to-send and clear-to-send (RTS/CTS) and a shorter average waiting time.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.385-393
• /
• 2005

In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.

• 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.33 no.11B
• /
• pp.989-997
• /
• 2008

The reverse acknowledgment (RA) scheme supports a fast loss recovery for negative acknowledgment (NAK)-based selective repeat automatic repeat request (SR-ARQ) by detecting a retransmission failure quickly before a retransmission timer expires. In this paper, we evaluate the performance of a NAK-based SR-ARQ protocol with the RA scheme and compare it with the conventional NAK-based SR-ARQ protocol. Particularly, we propose a simple analysis model for the transport delay of the NAK-based SR-ARQ protocol considering the traffic condition, the retransmission persistence, the timer-based retransmissions and the RA scheme's behavior. Both NAK-based SR-ARQ protocols with and without the RA scheme are implemented by using the OPNET simulator. We verified the analysis model's accuracy through the simulation results. Also, we evaluate the performance of the NAK-based SR-ARQ protocol with the RA scheme based on analysis and simulation results.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.293-296
• /
• 2009

최근에 다양한 네트워크의 기술들이 존재하고 개발되어지고 있다. 이러한 네트워크 기술들을 효과적으로 사용하기위해서 버티컬 핸드오버가 다양한 측면에서 연구되어지고 있다. 버티컬 핸드오버는 단말기가 이종망에서 더 나은 성능을 가진 네트워크로 끊김없는 서비스를 제공하는 핸드오버 기술이다. 버티컬 핸드오버를 수행하는 동안에 라우터간 시그널링의 지연과 더불어 인증과 등록절차에 대한 시간지연으로 인하여 혼잡한 상황이 아님에도 불구하고 TCP에서는 혼잡한 상황으로 인식하여 성능이 낮아지는 문제가 발생한다. 또한, 버티컬 핸드오버를 수행하는 중에 링크의 특성이 다르고 대역폭이 달라서 패킷의 순서번호가 일치하지 않아서 잘못된 빠른 재전송(false fast retransmission:FFR) 발생하고 이러한 현상들은 TCP 처리량의 저하를 가져온다. 논문에서는 이러한 문제를 해결하기 위한 방법들에 대한 동향을 조사 해보았다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4662-4677
• /
• 2018

The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.396-405
• /
• 2005

Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem; it cannot perform local retransmission efficiently under the bursty-error prone wireless link. In this paper, we propose Enhanced Snoop(E-Snoop) protocol to solve this problem of Snoop protocol. With E-Snoop protocol, packet losses can be noticed by receiving new ACK packets as well as by receiving duplicate ACK packets or local retransmission timeout. Therefore, TCP throughput can be enhanced by fast recognition of bursty packet losses and fast local retransmissions. From the simulation results, E-Snoop protocol can improve TCP throughput more efficiently than Snoop protocol and can yield more TCP improvement especially in the channel with high packet loss rates.