Queuing analysis of the selective repeat ARQ scheme

Lee, H.; Ngo, Binh

doi:10.1049/ip-i-2.1991.0065

Cited by 5 publications

(4 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All the non-zero delay values are decreased by 1, which is represented by d transiting to d − . Identical reasonings apply to (4) and (5), which assume instead no packet arrival, therefore λ is replaced by 1−λ. Either q > 0, as in (4), then the queue is decreased by 1 and the new feedback delay is placed in position ζ, or the queue is empty, so all non-zero delays in d are just decreased by 1, which is described by (5).…”

Section: Discussionmentioning

confidence: 99%

“…The assumption of ideal ARQ [5], [13] implies that p M [m]=δ[m−1], i.e., equal to 1 for m=1 and 0 elsewhere. A larger, but still constant, rtt is considered by [1], [3], [4], [7]- [10], which means that p M is still a delta-function, i.e., p M [m] = δ[m−m], centered onm > 1. The present analysis instead can be adapted to any p M of choice.…”

Section: Notations and Assumptionsmentioning

confidence: 99%

See 1 more Smart Citation

A Markov Analysis of Selective Repeat ARQ with Variable Round Trip Time

Badia

2013

IEEE Commun. Lett.

View full text Add to dashboard Cite

Many papers analyze selective repeat automatic repeat request schemes by means of a Markov chain representation for the channel and, by extension, the whole transmission system. This Markov approach precisely characterizes the queueing behavior and the statistics of several delay terms. In the vast majority of the investigations, the round-trip time of the channel, which determines the instant of reception of the feedback from the receiver, is taken as a fixed value. This letter explores the relaxation of this assumption, still framing the system within a Markov chain. The main conclusion is that the impact of a variable round trip time on the delay statistics is rather limited. The used approach can be promptly applied to any similar analysis of retransmission-based error control systems.Index Terms-Queueing analysis, automatic repeat request, Markov processes, error analysis.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Notations and Assumptionsmentioning

confidence: 99%

A Markov Analysis of Selective Repeat ARQ with Variable Round Trip Time

Badia

2013

IEEE Commun. Lett.

View full text Add to dashboard Cite

show abstract

“…Several papers dealing with ARQ (Automatic Repeat Request) schemes have appeared in the literature. Performance analysis of ARQ protocols is presented in [2], [3], [4]. In [5], the authors study the trade-off between energy constraints and average traffic delay that can be achieved by dynamically adapting ARQ schemes to channel characteristics and traffic QoS (Quality of Service).…”

Section: Introductionmentioning

confidence: 99%

Impact of ARQ protocols on QoS in 3GPP systems

Chiasserini

Meo

2003

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Traffic transmission over the radio channel requires appropriate techniques to preserve information integrity while maintaining the desired QoS and energy constraints. In this paper, we focus on a possible configuration of the ARQ protocol defined in 3GPP (Third Generation Partnership Project) technical specifications. A Markov model is developed in order to study the protocol behavior as channel characteristics change. Through this model, we evaluate the impact of the 3GPP ARQ scheme on the QoS of traffic services such as data file transfer and IP telephony. In the case of data transfer, a trade-off between loss probability and energy efficiency is derived. In the case of IP telephony, we investigate the possibility to guarantee low maximum delay and low jitter by adopting the ARQ protocol as error-recovery scheme. t tx t tx t tx t tx t tx t tx t rx

show abstract

“…For the SR scheme, Lee and others [5] presented an approximate analysis using a Markovian error model and determined the queue length distribution for the frames. The average waiting time from arrival to the start of transmission for a frame can then be determined.…”

Section: Introductionmentioning

confidence: 99%