• 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 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 Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.141-156
• /
• 2009

As the TCP is the protocol designed for the wired network that packet loss probability is very low, because TCP transmitter takes it for granted that the packet loss by the wireless network characteristics is occurred by the network congestion and lowers the transmitter's transmission rate, the performance is degraded. The Snoop Protocol was designed for the wired network by putting the Snoop agent module on the BS(Base Station) that connect the wire network to the wireless network to complement the TCP problem. The Snoop agent cash the packets being transferred to the wireless terminal and recover the loss by resending locally for the error occurred in the wireless link. The Snoop agent blocks the unnecessary congestion control by preventing the dupack (duplicate acknowledgement)for the retransmitted packet from sending to the sender and hiding the loss in the wireless link from the sender. We evaluated the performance in the wired/wireless network and in various TCP versions using the TCP designed for the wired network and the Snoop designed for the wireless network and evaluated the performance of the wired/wireless hybrid network in the wireless link environment that the continuous packet loss occur.

• 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.667-674
• /
• 2004

The performance of transmission control protocol (TCP) is largely dependent upon its loss recovery. Therefore, it is a very important issue whether the packet losses may be recovered without retransmission timeout (RTO) or not. Although TCP SACK can recover multiple packet losses in a window, it cannot avoid RTO if a retransmitted packet is lost again. In order to alleviate this problem, we propose a simple change to TCP SACK, which is called TCP SACK+ in simple. We use a stochastic model to evaluate the performance of TCP SACK+, and compare it with TCP SACK. Numerical results evaluated by simulations show that SACK+ can improve the loss recovery of TCP SACK significantly in presence of random losses.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.530-541
• /
• 2011

In this paper, we propose an effective network-adaptive ARQ based error control scheme to provide video streaming services through IP networks where packet error usually occurs. If time delay and feedback channel are allowed, client can request server to retransmit lost packets through IP networks. However, if retransmission is unconditionally requested without considering network condition and number of simultaneous feedback messages, retransmitted packets may not arrive in a timely manner so that decoding may not occur. In the proposed ARQ, a client conditionally requests retransmission based on assumed network condition, and it further determines valid retransmission time so that effective ARQ can be applied. In order to verify the performance of the proposed adaptive ARQ based error control, NIST-Net is used to emulate packet-loss network environment. It is shown by simulations that the proposed scheme provides noticeable error resilience with significantly reduced traffics required for ARQ.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.392-401
• /
• 2007

Wireless network has high BER characteristic because of path loss, fading, noise and interference. Many packet losses occur without any congestion in wireless network. Therefore, many wireless TCP algorithms have been proposed. SNOOP, one of wireless TCP algorithms, hides packet losses for Fixed Host and retransmits lost packets in wireless network. However, SNOOP has a weakness for bust errors in wireless network. This paper proposes the SACK-SNOOP to improve TCP performance based on SNOOP and Freeze-TCP that use ZWA messages in wireless network. This message makes FH stop sending packets to MH. BS could retransmit error packets to MH for this time. SACK-SNOOP use improved Selective ACK, thereby reducing the number of packet sequences according to error environment. This method reduces the processing time for generation, transmission, analysis of ACK. This time gain is enough to retransmit local burst errors in wireless link. Furthermore, SACK-SNOOP can manage the retransmitted error by extending delay time to FH. The simulation shows that our proposed protocol is more effective for packet losses in wireless networks.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.11
• /
• pp.1-6
• /
• 2019

Multicast is an efficient method for real-time transmission in many multimedia applications. It is important to recover lost packets and to manage multicast groups according to the network status in order to improve the reliability of multicast transmissions. In this paper, we propose a method that can efficiently recover lost packets in a large multicast group. In the proposed method, we create a recovery cluster (RC) using a multicast domain (MD) for recovery of lost packets. In the conventional methods, clusters send a request message for lost packets to the senders in order to recover the packets lost from many multicast applications. This increases packet delay time and overhead because of the feedback messages and retransmitted packets. In the proposed method, we improve these problems using the RC, which consists of many MDs (which have overlay multicast senders), and many cluster heads (CHs). We divide the message into blocks, and divide each block into many segments for packet recovery using the CHs. When packet loss occurs, all CHs share the segment information and recover the lost segments at the same time. Simulation results show that the proposed method could improve the packet recovery ratio by about 50% compared to the conventional methods.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1045-1054
• /
• 2020

In this paper, we designed a TCP/IP based ring buffer system that can stably transfer bulk data streams in the unstable network environments. In the scheme we proposed, The observation data stream generated and output by each radio observatory's backend system as a UDP frame is stored as a UDP packet in a large capacity ring buffer via a socket buffer in the client system. Thereafter, for stable transmission to the remote destination, the packets are processed in TCP and transmitted to the socket buffer of server system in the correlation center, which packets are stored in a large capacity ring buffer if there is no problem with the packets. In case of errors such as loss, duplication, and out of order delivery, the packets are retransmitted through TCP flow control, and we guaranteed that the reliability of data arriving at the correlation center. When congestion avoidance occurs due to network performance instability, we also suggest that performance degradation can be minimized by applying parallel streams.