3.4Window size, utilisation and sequence-number bits
The idea
To keep the pipe full the window must cover the bandwidth-delay product: W ≥ 1 + 2a. For a given target utilisation U the window is U × (Tt + 2Tp) / Tt, rounded up, and then you pick the sequence-number bits.
Think of it like this: Enough taxis to cover the round trip: if the trip takes 20 minutes and a taxi leaves every 2, you need 10 taxis on the road to keep the stand busy.
Why it exists
This is the 2-mark numerical: "minimum bits for the sequence number to reach 60% utilisation".
How it works
- Compute Tt and the cycle Tt + 2Tp.
- Window W = ⌈U × cycle / Tt⌉ (U = 1 for full speed).
- Then bits: GBN ⌈log₂(W + 1)⌉, SR ⌈log₂ 2W⌉.
- Piggybacking lets the ack ride on a data frame going the other way.
Worked example: 1 KB frames, 1.5 Mbps, 50 ms one way, 60% utilisation, SR.
Tt = 5.46 ms, cycle = 105.46 ms, W = 0.6 × 105.46 / 5.46 = 11.6 → 12. 2W = 24 → 5 bits (GATE 2014).
Now play with it
- →Enter the default numbers and read the window and bits.
- →Slide the window in the plot: utilisation rises linearly and saturates at 1.
Default is GATE 2014: 1 KB frame, 1.5 Mbps, 50 ms one way, 60 % utilisation, selective repeat: W = 12, so 24 numbers, so 5 bits.
Check yourself
The sender window is 12 and Selective Repeat is used. The minimum number of sequence-number bits is
Exam notes (the dense version)
To reach 100% utilisation the window must cover the pipe: W ≥ 1 + 2a = (Tt + 2Tp) / Tt. For a target utilisation U: W = U · (Tt + 2Tp) / Tt, rounded up. Then pick the sequence-number bits from the protocol: stop-and-wait 1 bit, GBN ⌈log₂(W + 1)⌉, SR ⌈log₂(2W)⌉. Piggybacking puts the ack inside a data frame going the other way.
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.