if N > 1 + 2a then receive an ACK before window exhausted, can xmit continuously
=> U = 1
if N< 1 + 2a window exhausted at t0 + N, must wait till t0 + 2a + 1 to send again, thus get N time units busy during 2a + 1
=> U = N/ (1 + 2a)
| Previous slide | Next slide | Back to first slide | View graphic version |