7.4Throughput, sequence-number wrap and timers
The idea
TCP throughput is limited by min(cwnd, rwnd)/RTT. The sequence-number field must be large enough that numbers are not reused while an old copy could still be in the network (the maximum segment lifetime).
Think of it like this: Ticket numbers at a bakery: the counter must not wrap around while someone with an old ticket is still waiting.
Why it exists
GATE asks for the number of sequence bits or the wrap-around time at a given bandwidth.
How it works
- Bytes per second = bandwidth / 8.
- Bytes sent in one MSL = rate × MSL.
- Sequence bits ≥ log₂(bytes in MSL).
- Wrap time for b bits = 2b bytes / rate.
Worked example: 1 Gbps, MSL 60 s.
125 × 10⁶ × 60 = 7.5 × 10⁹ bytes, log₂ ≈ 32.8: 33 bits (GATE 2022). 32 bits wrap in 34 s at 1 Gbps (GATE 2018).
Now play with it
- →Use the calculator with 100 Mbps and an MSL of 120 s.
- →Raise the RTT and see the window cap throughput.
GATE 2022: 1 Gbps and MSL 60 s gives 7.5 × 10⁹ bytes, so 33 bits. GATE 2018: the 32-bit field wraps after about 34 s at 1 Gbps.
Check yourself
The time for a 32-bit TCP sequence number to wrap at 1 Gbps is about
Exam notes (the dense version)
Throughput ≤ min(cwnd, rwnd) / RTT. To keep a pipe full, rwnd ≥ bandwidth × RTT. The sequence-number field must not wrap within the maximum segment lifetime (MSL): 2ᵇⁱᵗˢ bytes ≥ bandwidth (bytes/s) × MSL. Wrap-around time for 32 bits at 1 Gbps: 2³² × 8 / 10⁹ ≈ 34 s. RTT estimation uses an exponential average and the retransmission timeout is set from the estimate plus a safety margin (Karn's algorithm ignores retransmitted segments).
Previous year questions: Transport Layer: UDP & TCP (11)
PYQs are grouped by topic, so this is the full set for Transport Layer: UDP & TCP; try the ones that match this subtopic. Open all 11 on the topic page.