1.3Bandwidth-delay product and channel capacity
The idea
The bandwidth-delay product is bandwidth × delay: the number of bits that fit on the wire at once. Nyquist and Shannon give the maximum rate a channel can carry.
Think of it like this: A water pipe: bandwidth is how wide it is, delay is how long it is, and the product is how much water sits inside it.
Why it exists
It tells you how big a window must be to keep a link busy, and it appears directly as a numerical question.
How it works
- Compute bits in flight = B × RTT (or B × Tp one way).
- Nyquist (no noise): C = 2 H log₂ V.
- Shannon (noise): C = H log₂(1 + S/N), converting dB to a ratio with 10dB/10.
- Take the smaller of the two if both are given.
Worked example: H = 3 kHz, S/N = 30 dB.
S/N = 1000, so C = 3000 × log₂(1001) ≈ 29.9 kbps.
Now play with it
- →Use the calculator: change dB from 30 to 40 and see Shannon move.
- →Raise the signal levels V and see Nyquist climb but Shannon stay.
The usable data rate is the smaller of the Nyquist and Shannon limits.
Check yourself
A 20 dB signal-to-noise ratio is a ratio of
Exam notes (the dense version)
The bandwidth-delay product B × RTT (or B × Tp for one way) is the number of bits "in flight" on a full pipe: it is the window size you need to keep the link busy. Capacity limits: Nyquist (noiseless) C = 2 · H · log₂ V bits/s for bandwidth H Hz and V signal levels; Shannon (noisy) C = H · log₂(1 + S/N), with S/N as a ratio (convert from dB: ratio = 10^(dB/10)). The smaller of the two bounds applies.
Previous year questions: Layering, Delays & Switching (7)
PYQs are grouped by topic, so this is the full set for Layering, Delays & Switching; try the ones that match this subtopic. Open all 7 on the topic page.