3.3Selective Repeat
The idea
Selective Repeat gives the receiver a window too. It buffers out-of-order frames and acknowledges each one individually, so only the lost frame is resent.
Think of it like this: The friend this time keeps a scratch sheet: they note numbers 4 and 5 even though 3 is missing, and you only repeat 3.
Why it exists
It saves bandwidth on lossy links; GATE tests the sequence-number size and the maximum window.
How it works
- Sender and receiver both have window N.
- Each frame is acknowledged; out-of-order frames are buffered.
- Only the missing frame is retransmitted.
- Sequence space must be at least 2N (so ⌈log₂ 2N⌉ bits), otherwise old and new frames are confused.
Worked example: k = 4 sequence bits.
16 numbers, so the largest SR window is 8, and the largest GBN window is 15.
Now play with it
- →In the lab pick Selective Repeat and lose frame 2: only frame 2 is resent.
- →Increase the window to 8 and compare the number of rounds.
| round | frames sent | what happens |
|---|---|---|
| 1 | 0123 | Frame 2 lost. Others are buffered and acknowledged. Only 2 is retransmitted. |
| 2 | 245 | All acknowledged. |
| 3 | 67 | All acknowledged. |
Selective Repeat: the receiver buffers out-of-order frames, so only the lost frame is re-sent.
Check yourself
With 3-bit sequence numbers, the largest window for Selective Repeat is
Exam notes (the dense version)
Both sender and receiver have a window of size N. The receiver buffers out-of-order frames and acknowledges each one; the sender retransmits only the lost frame. To avoid confusing old and new frames the sequence space must be at least 2N, so ⌈log₂(2N)⌉ bits and N ≤ 2k − 1. It uses the same utilisation formula as GBN but wastes less on errors.
Previous year questions: Flow Control & Sliding Window (6)
PYQs are grouped by topic, so this is the full set for Flow Control & Sliding Window; try the ones that match this subtopic. Open all 6 on the topic page.