Transmission Efficiency of ARQ

Protocols

Prakasam P
School of Electronics Engineering
Vellore Institute of Technology
 n f  no
no
t0 1
Reff 1  Pf nf
 SW    (1  Pf )
R R na 2(t prop  t proc ) R
1 
nf nf

Ws t f Delay BW
tGBN  t f  Pf and
1  Pf Product
n f  no no
1 1- Pf =(1-p)nf
tGBN nf
GBN   (1  Pf )
R 1  (Ws  1) Pf

n f  no
t f /(1  Pf ) no
 SR   (1  )(1  Pf )
R nf
6/8/2023 Prakasam P/BECE401L/Fall 2023-24 2
 Problem
Let frame length nf is 1250 bytes, na & no is 25
bytes.

Compute and compare the transmission

efficiency of S&W, GBN & SR ARQ for
random bit errors with p=10-6, 10-5, 10-4 and
Bandwidth is 1 Mbps & reacting time is 100
ms.

6/8/2023 Prakasam P/BECE401L/Fall 2023-24 3

 Solution
nf = 1250 bytes = 10000 bits
na=no=25 bytes = 200 bits

Delay x Bandwidth = 100 ms x 1 Mbps = 1,00,000

For GBN, Window Size = (1,00,000/10,000) +1 = 11

6/8/2023 Prakasam P/BECE401L/Fall 2023-24 4

Impact Bit Error Rate on Selective
Repeat

Error Rate 0 10-6 10-5 10-4

S&W 8.9% 8.8% 8.0% 3.3%

GBN 98% 88.2% 45.4% 4.9%

SR 98% 97% 89% 36%

Selective Repeat outperforms GBN and S&W, especially at high

error rates. The efficiency decrease of SR at high error rates is
inevitable for any ARQ protocol.

6/8/2023 Prakasam P/BECE401L/Fall 2023-24 5