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.
[1]
Romano Fantacci.
Queuing analysis of the selective repeat automatic repeat request protocol wireless packet networks
,
1996
.
[2]
Jim Freeman,et al.
Stochastic Processes (Second Edition)
,
1996
.
[3]
Godred Fairhurst,et al.
Advice to link designers on link Automatic Repeat reQuest (ARQ)
,
2002,
RFC.
[4]
Kim Young Soo,et al.
Delay Analysis of Selective Repeat ARQ for a Markovian Source Over a Wireless Channel
,
2004
.
[5]
Leonardo Badia,et al.
SR ARQ delay statistics on N-state Markov channels with non-instantaneous feedback
,
2006,
IEEE Transactions on Wireless Communications.
[6]
Zvi Rosberg,et al.
Resequencing delay and buffer occupancy under the selective-repeat ARQ
,
1989,
IEEE Trans. Inf. Theory.
[7]
Gorry Fairhurst,et al.
Advice for Internet Subnetwork Designers
,
2004,
RFC.
[8]
Leonard Kleinrock,et al.
Queueing Systems: Volume I-Theory
,
1975
.