PP Presentation
- Case 2: The window is not big enough to allow acks to return before it is full. The sender must stop-and-wait for the first ack. It may then send one more frame, at which time the next ack arrives. Each cycle takes F/C+2I (which uses up F+2CI bits of bandwidth) and is carries WD data bits. Therefore:
- if W< 1+2CI /F then (small window, no errors)
(prove for ec)