gen-define-the-sliding-window-protocol-and-give-one-short-worked-e169

Define the sliding window protocol and give one short worked example.

# Sliding Window Protocol ## Definition The **sliding window protocol** is a flow control mechanism used in data communication where the sender can transmit multiple frames before requiring an acknowledgment. It maintains a "window" of frames that can be sent or received at any given time. **Key characteristics:** - Sender has a window of size W (maximum unacknowledged frames allowed) - Each frame is numbered sequentially - Window "slides" forward as acknowledgments are received - Improves efficiency over stop-and-wait protocols --- ## Short Worked Example **Setup:** Window size = 3, Sequence numbers = 0-7 (3-bit) **Transmission sequence:** ``` Time | Sender Window | Action ------|-----------------|--------------------------- T0 | [0,1,2] | Send frames 0,1,2 T1 | [0,1,2] | Waiting for ACK T2 | [1,2,3] | ACK 0 received → slide window | | Send frame 3 T3 | [2,3,4] | ACK 1 received → slide window | | Send frame 4 T4 | [3,4,5] | ACK 2 received → slide window | | Send frame 5 ``` **Visualization:** ``` Initial: [0 1 2] 3 4 5 6 7 After ACK 0: 0[1 2 3]4 5 6 7 After ACK 1: 0 1[2 3 4]5 6 7 ``` The window continuously slides forward as acknowledgments arrive, allowing continuous transmission without waiting for each individual ACK.