• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.930-937
• /
• 2004

In this paper, we analyze the delay performance for a Markovian source transported over a wireless channel with time-varying error characteristics. To improve the reliability of the channel, the end points of the wireless link implement a selective-repeat (SR) ARQ error control protocol. We provide an approximate discrete-time analysis of the end-to-end mean packet delay, which consists of transport and resequencing delays. Numerical results and simulations indicate that our approximate analysis is sufficiently accurate for a wide range of parameter values.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.894-897
• /
• 2008

This paper analyzes the throughput performance of a selective repeat (SR)/automatic repeat request (ARQ) scheme to transmit packet data in burst home network channel. To combat the high degree of error caused by transmission of home network data a robust error control scheme is a necessity. Basically, error control schemes can be divided in two categories: ARQ schemes and forward error correction (FEC) schemes. ARQ schemes are often used for reliable data transmission. The performance of packet transmission using SR-ARQ schemes for bursty channels is analyzed and simple analytical expressions of its throughput are presented. Theoretic analysis and numerical results indicate that a small number of packet sizes can get good performance in bursty home network channel.

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

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.523-530
• /
• 2008

In this paper, we analyze the mean queuing delay of selective-repeat automatic repeat request (SR-ARQ) protocol with the finite retransmission persistence. The retransmission persistence means the willingness of the protocol to retransmit a lost (or corrupted) packet to ensure reliable packet delivery across a lossy link. According to the retransmission persistence, SR-ARQ protocols have a different performance in terms of both packet delay and link reliability. So far, however, there is no serious study in the effect of the retransmission persistence on the SR-ARQ performance. We present a simple M/G/1 queuing model for the SR-ARQ protocol with the finite retransmission persistence by using the ideal SR-ARQ approximation. The mean queuing delay is obtained from the queuing model and verified its accuracy through the simulation results using the OPNET simulator. Both the analytical predictions and simulation results clearly show the effect of retransmission persistence on the queuing delay of the SR-ARQ protocol in various network conditions: packet loss rate and traffic condition over a wireless link.

• Journal of IKEEE
• /
• v.9 no.2 s.17
• /
• pp.123-135
• /
• 2005

3GPP RLC protocol specification adopted a window-controlled selective-repeat ARQ scheme for provisioning reliable data transmission. Inevitably, the re-ordering issue arises in the 3GPP's ARQ since it belongs to the selective-repeat ARQ clan. A long re-ordering time results in the degradation of throughput and delay performance, and may invoke the overflow of the re-ordering buffer. Also, the re-ordering time must be regulated to meet the requirements of some services which are both loss-sensitive and delay-sensitive. In the 3GPP's ARQ, we may deflate the occupancy of the re-ordering buffer by reducing the window size and/or length of the status report period. Such a decrease, however, deteriorates the throughput and delay performance and encroaches the resource of the reverse channel. Aiming at reducing the occupancy at the re-ordering buffer while suppressing the degradation of throughput and delay performance, we propose threshold-dependent occupancy control schemes, identified as post-threshold and pre-threshold schemes, as supplements to the 3GPP's ARQ. For judging the effectiveness of the proposed schemes, we investigate peak occupancy, maximum throughput and average delay in the practical environment involving fading channels. From the simulation results, we observe that the proposed schemes invoke the performance trade-off between occupancy and throughput in general. Also, we reveal that the post-threshold scheme is able to improve the throughput and delay performance of the ordinary 3GPP's ARQ without inflating the occupancy of the re-ordering buffer.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.8
• /
• pp.51-61
• /
• 2007

For provisioning reliable data transmission, the 3GPP RLC specification adopted a selective-repeat ARQ scheme assisted by a window-based admission control scheme. In the 3GPP ARQ, which is a member of the selective-repeat ARQ clan, inheres the reordering problem A long and irregular reordering time results in the degradation of throughput and delay performance, and may incur the overflow of the reordering buffer. Furthermore, the reordering time must be regulated to meet the requirements of some services which are loss-sensitive and delay-sensitive as well. Perceiving the reordering hazard, we propose an alternative, identified as snowball scheme, to the original admission control scheme of the 3GPP ARQ with aiming at deflating the occupancy of the reordering buffer. A unique feature of the snowball scheme is to reject a new DATA PDU if it is non-adjacent to any DATA PDU sojourning at the reordering buffer. Such an intentional rejection apparently reduces the occupancy of the reordering buffer while it may deteriorate the throughput and delay performance. Developing an analytical approximation method, we investigate the effect of snowball scheme on the saturated occupancy and throughput. Also, we, using a simulation method, evaluate the peak occupancy, normalized throughput and average delay in the practical environment. From the simulation results, we reveal that the snowball scheme is able to enhance occupancy performance as well as throughput performance compared with the original admission control scheme of the 3GPP ARQ.

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

• Journal of IKEEE
• /
• v.7 no.2 s.13
• /
• pp.288-298
• /
• 2003

We consider a window-controlled selective-repeat ARQ scheme for error control between two adjacent nodes lying on a communication path. In this scheme, each packet to be transmitted is endowed with a serial number in a cyclic and sequential fashion. In turn, the transmitting node is not allowed to transmit a packet belonging to a window before every packet in the previous window is positively acknowledged. Such postponement of packet transmission incurs a degradation in throughput and delay performance. In this paper, aiming at improving packet delay performance, we employs a supplement scheme in which a serial number is duplicated within a frame. Classifying duplication rules into fixed, random and adaptive categories, we present candidate rules in each category and evaluate the packet delay performance induced by each duplication rule. From numerical examples, we observe that duplicating serial numbers, especially ADR-T2 effectively reduces mean packet delay for the forward channel characterized by a low packet error rate. We also reveal that such delay enhancement is achieved by a high probability of hitting local optimal window size.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.212-219
• /
• 2006

In this paper, a new turbo codes-based hybrid automatic repeat request (TC-HARQ) scheme with segment selective repeat (SSR) is proposed. The main strategy is, upon retransmission, to repeat the data that are most important for the next round of decoding based on the distribution of residual errors after current decoding. The performance in terms of reliability and throughput is analyzed. To adapt to correlated fading channels where an inter-leaver is always employed before transmission, we further modify the SSR strategy so that data having experienced correlated deep fading are selected for retransmission. Finally, this proposed scheme is applied to the wideband code division multiple access (WCDMA) system under frequency selective fading channels. Simulation results demonstrate that in all single and multiple user cases, SSR-based TC-HARQ leads to significant throughput improvement with similar bit error rate (BER) performance as compared to type-I TC-HARQ.