• 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 Korea Multimedia Society
• /
• v.18 no.1
• /
• pp.25-34
• /
• 2015

Recently, in distribution market, demand for electronic shelf label system is increasing gradually to provide the accurate price immediately and detailed product information to consumers and reduce operation costs. Most of electronic shelf label system companies develop the full-graphic display device to display a wide variety of product information as well as the exact price. Our system had introduced Go-Back-N retransmission method in the early. However, we encountered performance problems that it delayed updating of the electronic shelf label system and exhausted the battery life time. Proposed adaptive image retransmission technique based on the selective scheme is that tags of electronic shelf label system recognize idle time of transmission cycle and require partial image retransmission to sever by itself. As a result, it can acquire much more opportunities of partial image retransmission within the same period and increase reception rate of full image for each tags. The experimental result shows that adaptive image retransmission technique's reception rate of full image for each tags is approximately 4% higher than existing previous works. And total battery life time increases 30 hours because tag reduce wake-up time as it receive only lost data instead of whole data.

• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.1355-1358
• /
• 2004

This paper describes a modification to the SACK (Selective Acknowledgement) Transmission Control Protocol's (TCP), called SACK TCP with Probing Device, SACK works in conjunction with Probing Device, for improving SACK TCP performance when more than half a window of data lost that is typical in handoff as well as unreliable media. It shows that by slightly modifying the congestion control mechanism of the SACK TCP, it can be made to better performance to multiple packets lost from one window of data.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3449-3467
• /
• 2015

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P_e, an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

• 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 Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.54-63
• /
• 2004

This paper describes a hybrid QoS guarantee scheme for high quality audio streaming services on the Internet. The continuous playback of the audio data requires the isochronous transmission of the audio data packet through the Internet. In order to retain the QoS at the ultimate destination (client) as the same as servers provide, the transmission protocols should consider the error conditions such as packet loss, and out of order delivery. Generally, the protocols supporting the transmission of continuous media data do not try to recover the errors. The protocols are working somehow for the toll quality multimedia streaming services, but rot for the high quality streaming services, such as the DVD sound/music payback. The hybrid QoS guarantee scheme includes the three mechanisms to overcome the problem. The selective retransmission for the lost packet, the adaptive buffering at client-side, and the adaptive transmission rate at server-side are totally adopted to recover the packet loss with the minimal overhead, to prevent from the buffer starvation during the retransmission, and to maintain the isochronous transmission even after the retransmission. The experiments have shown good results for the high Quality audio streaming services on the Internet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.896-905
• /
• 2005

In this paper, we propose a SPD(Selective Packet Delay) scheme to improve the performance of High-Speed Downlink Shared Channel(HS-DSCH) employing N-Channel Stop and Wait retransmission scheme in High Speed Downlink Packet Access(HSDPA) system. The proposed SPD coordinates packet transmissions according to the channel condition. When the channel condition is bad, packet transmission is forcedly delayed, and the designated time slot is set over to other users in good channel condition. Hence, the SPD is able to reduce the average transmission delay for packet transmission under the burst error environments. In addition, we propose two packet scheduling schemes called SPD-LDPF(Long Delayed Packet First) and SPD-DCRR(Deficit Compensated Round Robin) that are effectively combined with the SPD scheme. Simulation results show that the proposed scheme has better performance in terms of delay, throughput and fairness.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.451-458
• /
• 2010

To detect and recover packet losses over wireless links is very important in terms of reliability in packet transmission. Most wireless communication systems adopt an automatic repeat request (ARQ) protocol operating at link layer. However, it has been constantly addressed that the interaction not harmonized sufficiently between ARQ and TCP rather degrades TCP performance. In this paper, therefore, we propose an improved scheme from the aspect of the interaction with TCP loss recovery mechanism that can be applied to selective repeat ARQ (SR-ARQ) protocol and prove that the proposed scheme improves TCP performance significantly by OPNET simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.6
• /
• pp.535-544
• /
• 1988

In this paper, the hybrid ARQ scheme, which is incorporated the selective-repeat ARQ system with the finite receiver buffer and the single-error-correcting and double-error-detecting(63.56) cyclic Hamming code system, has been investigated. As a result of simulation, the proposed hybrid ARQ scheme shows that that throughput efficiencies are improved by one error correction, and that the reversed codewords due to retransmission are delivered to the user in order by means of detecting two errors. The hybrid ARQ scheme significantly outperforms the FEC or the ideal selective-repeat ARQ system in the respect of throughput and reliability, especially when the channel error rate is approximately in the range from $10^{-2}$~$10^{-3}$.