Selective Repeat - ARQ
Duration: 6 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
The lecture covers the Selective Repeat Automatic Repeat Request (ARQ) protocol, contrasting it with Go-Back-N to highlight efficiency improvements on noisy links. It details the protocol mechanics using a sequence diagram and explains the mathematical constraints on window sizes and sequence numbers to ensure correct operation. The instructor derives formulas for window size and sequence number bits based on transmission efficiency.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a slide titled 'Selective Repeat Automatic Repeat Request'. The instructor explains that Go-Back-N ARQ simplifies the receiver process but is inefficient for noisy links because it resends multiple frames when just one is damaged. He introduces Selective Repeat ARQ as a mechanism that resends only the damaged frame, thereby saving bandwidth. The slide text explicitly states, 'For noisy links, there is another mechanism that does not resend N frames when just one frame is damaged; only the damaged frame is resent.' He emphasizes that this mechanism is called Selective Repeat ARQ. He contrasts this with the previous protocol where the receiver keeps track of only one variable.
2:00 – 5:00 02:00-05:00
The lecture transitions to a detailed sequence diagram illustrating the Selective Repeat ARQ protocol. The slide text notes, 'In Selective Repeat ARQ, the size of the sender and receiver window must be at most one-half of 2^m'. The instructor draws a tree diagram to visualize the sequence number space, labeling the root as 2^m and the branches as 2^(m-1). He points to the diagram showing Frame 0, Frame 1 (marked as Lost), Frame 2, and Frame 3. He explains the arrival event, noting that an ACK or NAK frame may arrive. He highlights the NAK frame sent by the receiver for Frame 1 and the subsequent retransmission of Frame 1. He also points to the 'Arrival' of Frame 1 (resend) and the final ACK 4. He explains that if a valid NAK frame arrives, the corresponding frame is just resent.
5:00 – 5:45 05:00-05:45
The final segment focuses on 'Sequence and Acknowledgement Numbers'. The instructor writes formulas on the whiteboard to maximize transmission efficiency. He writes 'Window size (Ws) = (1 + 2a)' and 'Number of bits required for sequence numbers = ceil(log2(1 + 2a))'. He works through a numerical example where the efficiency calculation leads to a window size of 76 (75 + 1). He calculates powers of 2, writing '2^6 = 64' and '2^7 = 128', concluding that 7 bits are required to accommodate the window size of 76. He also writes '2^8 = 256' as a reference for larger windows. He discusses the relationship between utilization, transmission time, and propagation time, writing 'U = (T_T x Ws) / (T_T + 2 x T_P)'.
The lecture progresses from a conceptual comparison of ARQ protocols to a detailed technical breakdown of Selective Repeat ARQ. It starts by identifying the inefficiency of Go-Back-N on noisy links, then moves to the specific mechanics of Selective Repeat, including window size constraints and sequence number handling. Finally, it applies mathematical formulas to determine the necessary sequence number bits for a given efficiency target, bridging theoretical protocol design with practical numerical constraints. The instructor uses visual aids like sequence diagrams and tree structures to clarify complex concepts like window sizing and sequence number space. He also derives the formula for utilization to show how window size impacts efficiency.