Question

Consider a 128×103128 \times 10^3 bits/second satellite communication link with one way propagation delay of 150 milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgement. The minimum number of bits required for the sequence number field to achieve 100% utilization is _____.

Official answer and solution
Official answer
4
From
Official GATE 2016 answer key

Solution

Determine the required sender window size for 100% channel utilization and compute sequence number bits for Selective Repeat.

Given parameters:

  • Bandwidth B=128×103 bits/secondB = 128 \times 10^3\text{ bits/second}
  • One-way propagation delay Tp=150 ms=0.15 sT_p = 150\text{ ms} = 0.15\text{ s}
  • Frame size L=1 KB=1024 bytes=8192 bitsL = 1\text{ KB} = 1024\text{ bytes} = 8192\text{ bits} (or 1000 bytes=8000 bits1000\text{ bytes} = 8000\text{ bits})
  • Acknowledgement transmission time Tack=0T_{\text{ack}} = 0

Compute frame transmission time TtT_t:

Tt=8192128×103=0.064 s=64 msT_t = \frac{8192}{128 \times 10^3} = 0.064\text{ s} = 64\text{ ms}

(Using 8000 bits gives Tt=62.5 msT_t = 62.5\text{ ms}).

For 100% link utilization (η=1\eta = 1):

Ws≥1+2a=1+2TpTt=1+300 ms64 ms=1+4.6875=5.6875W_s \ge 1 + 2a = 1 + \frac{2 T_p}{T_t} = 1 + \frac{300\text{ ms}}{64\text{ ms}} = 1 + 4.6875 = 5.6875

(Using 62.5 ms62.5\text{ ms} gives 1+4.8=5.81 + 4.8 = 5.8).
Since window size must be an integer, the minimum sender window size is:

Ws=⌈5.6875⌉=6W_s = \lceil 5.6875 \rceil = 6

In Selective Repeat protocol, the sender window size WsW_s and receiver window size WrW_r are equal: Ws=Wr=6W_s = W_r = 6. To prevent overlap between sequence number spaces of new and retransmitted frames:

Available sequence numbers N≥Ws+Wr=2Ws≥2×6=12\text{Available sequence numbers } N \ge W_s + W_r = 2 W_s \ge 2 \times 6 = 12

If kk bits are allocated for the sequence number field:

2k≥122^k \ge 12

For k=3k = 3: 23=8<122^3 = 8 < 12 (insufficient).
For k=4k = 4: 24=16≥122^4 = 16 \ge 12 (sufficient).
Therefore, the minimum number of bits required is 4.

Final answer

4

Common trap

Using the Go-Back-N formula N≥Ws+1=7N \ge W_s + 1 = 7, which requires only 3 bits, instead of the Selective Repeat formula N≥2Ws=12N \ge 2 W_s = 12.

The answer is the one in the official GATE answer key. The solution is this site's own explanation.

Source

Paper
GATE 2016 Computer Science and Information Technology (CS) Session 2
Question
65 of 65, printed as CS Q.55
Section
Computer Science and Information Technology

Report an error in this question

GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.