30 Nov - CN -Sliding window protocols part-2
Duration: 2 hr 22 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
This educational video is a comprehensive lecture on computer networking, focusing on data link layer protocols and performance calculations. The instructor, Sanchit Jain, systematically explains key concepts such as transmission delay (Tt), propagation delay (Pd), and queuing delay, and their role in calculating end-to-end delay. The core of the lecture is a detailed analysis of reliable data transfer protocols, including Stop-and-Wait, Go-Back-N ARQ, and Selective Repeat ARQ. The instructor uses a whiteboard to draw diagrams of network paths, sender-receiver interactions, and window mechanisms, and works through numerous GATE exam questions to demonstrate how to calculate parameters like channel utilization, maximum window size, and the minimum number of sequence bits required for different protocols. The video progresses from fundamental definitions to complex problem-solving, providing a thorough review of essential networking topics.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a title card displaying the name 'Sanchit Jain' on a black screen, indicating the instructor. This is followed by a blank white screen, which then transitions to the start of the lecture.
2:00 – 5:00 02:00-05:00
The lecture begins with a discussion on network delays. The instructor writes on a whiteboard, defining transmission delay (Tt) as the time to push a packet onto the link, with the formula Tt = Message Size / Bandwidth. Propagation delay (Pd) is defined as the time for a signal to travel the distance, with the formula Pd = Distance / Signal Speed. The instructor then introduces queuing delay and processing delay as components of end-to-end delay.
5:00 – 10:00 05:00-10:00
The instructor presents a problem (Q23) involving a network path P-Q-R. The task is to calculate the time for a file of 10^6 bytes to be received at R, with chunks of 10^3 bytes. The instructor calculates the transmission delay (Tt) for a chunk as 10^3 bytes / 10^6 bits/sec = 0.001 sec. The diagram shows a sender (P), a router (Q), and a receiver (R), illustrating the path for the data transmission.
10:00 – 15:00 10:00-15:00
The instructor continues the problem, calculating the total transmission time for the file. The number of chunks is 10^6 / 10^3 = 1000. The total transmission time is 1000 * 0.001 sec = 1 sec. The instructor then discusses the end-to-end delay, which includes transmission and propagation delays at each link. The formula for end-to-end delay is given as Tt + Pd + Tt + Pd + Tt + Pd, which simplifies to 3*Tt + 3*Pd.
15:00 – 20:00 15:00-20:00
The instructor explains the concept of Round Trip Time (RTT) for a sender-receiver pair. The formula for RTT is given as Tt + Pd + Qd + Pt + Tack + Pdack, where Tack is the transmission time of the acknowledgment and Pdack is its propagation delay. The instructor notes that if queuing and processing delays are negligible, the formula simplifies to RTT = Tt + Pd. This is illustrated with a diagram showing the time taken for a packet to travel from sender to receiver and back.
20:00 – 25:00 20:00-25:00
The instructor presents a GATE 2004 question about a 20 Kbps satellite link with a 400 ms propagation delay. The question asks for the maximum data rate possible using the Go-Back-N ARQ scheme with a window size of 10. The instructor calculates the transmission time (Tt) for a 100-byte frame as 100*8 / 20*10^3 = 0.04 sec. The formula for maximum data rate is given as N * Tt / (Tt + 2*Pd), which is used to find the answer.
25:00 – 30:00 25:00-30:00
The instructor discusses a GATE 2007 question on calculating the minimum number of sequence bits for a sliding window protocol. The problem involves two stations M and N, a distance L km, a frame size K bits, and a propagation delay of t seconds per km. The instructor derives the formula for the window size as (Tt + 2*Pd) / Tt, which simplifies to (K + 2*L*t) / K. The minimum number of sequence bits is then log2 of this value.
30:00 – 35:00 30:00-35:00
The instructor explains the concept of a sliding window protocol. A diagram shows a sender's window with sequence numbers 0, 1, 2, 3, 4, 5, 6, 7. The sender transmits frames, and the receiver acknowledges them. The window slides as acknowledgments are received. The instructor explains that the window size is the number of frames that can be in transit at any time.
35:00 – 40:00 35:00-40:00
The instructor discusses the Go-Back-N ARQ protocol. The key idea is that the sender can send multiple frames before receiving an acknowledgment. If a frame is lost, the sender must retransmit all frames from the lost one onwards. The instructor explains that the window size (N) must be less than or equal to 2^m - 1, where m is the number of sequence bits.
40:00 – 45:00 40:00-45:00
The instructor presents a GATE 2006 question about a sliding window protocol with N=3. The task is to find the total number of packets transmitted when every 5th packet is lost. The instructor draws a timeline showing the transmission of packets 0, 1, 2, 3, 4, 5, 6, 7, 8. When packet 5 is lost, the sender retransmits packets 5, 6, 7, 8. This process repeats, and the total number of transmissions is calculated to be 18.
45:00 – 50:00 45:00-50:00
The instructor continues the GATE 2006 problem. The diagram shows the sender's window sliding as acknowledgments are received. The instructor explains that when packet 5 is lost, the sender retransmits packets 5, 6, 7, 8. When packet 10 is lost, the sender retransmits packets 10, 11, 12, 13, 14, 15, 16, 17, 18. The total number of packets transmitted is 18.
50:00 – 55:00 50:00-55:00
The instructor discusses the Selective Repeat ARQ protocol. The key difference from Go-Back-N is that the receiver can acknowledge individual frames. If a frame is lost, only that frame is retransmitted. The instructor explains that the sender's window size is much smaller, typically 2^(m-1), to avoid ambiguity in sequence numbers.
55:00 – 60:00 55:00-60:00
The instructor explains the concept of sequence numbers in ARQ protocols. The sequence numbers are used to identify frames. The number of sequence bits (m) determines the total number of possible sequence numbers, which is 2^m. The sender's window size (SWS) and receiver's window size (RWS) must satisfy the condition SWS + RWS <= 2^m.
60:00 – 65:00 60:00-65:00
The instructor discusses the maximum sender window size in Go-Back-N ARQ. The formula is given as SWS = 2^m - 1. The instructor explains that this is because the sender needs to be able to distinguish between the next frame to be sent and the frames that have been acknowledged. The maximum window size is 7 when m=3.
65:00 – 70:00 65:00-70:00
The instructor presents a GATE 2025 question about channel utilization in a Stop-and-Wait protocol. The frame size is 3000 bits, the transmission rate is 2000 bits/sec, and the propagation delay is 100 milliseconds. The instructor calculates the transmission time (Tt) as 3000 / 2000 = 1.5 sec. The channel utilization is given by the formula Tt / (Tt + 2*Pd), which is used to find the answer.
70:00 – 75:00 70:00-75:00
The instructor discusses a GATE 2022 question about the time taken for a packet to be completely received. The problem involves a 100 Mbps link, a distance of 2100 km, and a signal speed of 3*10^8 m/s. The instructor calculates the propagation delay (Pd) as 2100*10^3 / 3*10^8 = 7 ms. The transmission time (Tt) for a 1000-byte packet is 1000*8 / 100*10^6 = 0.08 ms. The total time is Tt + Pd = 7.08 ms.
75:00 – 80:00 75:00-80:00
The instructor presents a GATE 2017 question about the transmission efficiency of the Stop and Wait ARQ protocol. The parameters are given: bit rate 1 Mbps, propagation delay 0.75 ms, time to process a frame 0.25 ms, frame size 1980 bytes, and acknowledgment size 20 bytes. The instructor calculates the transmission time for the frame and acknowledgment, and then uses the formula for efficiency to find the answer.
80:00 – 85:00 80:00-85:00
The instructor discusses a GATE 2015 question about achieving 100% utilization in a Selective Repeat protocol. The problem involves a 128*10^3 bits/sec satellite link with a 150 ms propagation delay and a frame size of 1 kilobyte. The instructor calculates the transmission time (Tt) as 8 ms. The window size is given by (Tt + 2*Pd) / Tt, which is used to find the minimum number of sequence bits.
85:00 – 90:00 85:00-90:00
The instructor presents a GATE 2009 question about the minimum number of bits required to represent sequence numbers distinctly. The problem involves frames of 1000 bits sent over a 10^6 bps duplex link with a propagation time of 25 ms. The instructor calculates the transmission time (Tt) as 1 ms. The number of frames that can be in transit is 25 ms / 1 ms = 25. The minimum number of sequence bits is log2(25) = 5.
90:00 – 95:00 90:00-95:00
The instructor discusses the concept of a sliding window protocol. A diagram shows a sender's window with sequence numbers 0, 1, 2, 3, 4, 5, 6, 7. The sender transmits frames, and the receiver acknowledges them. The window slides as acknowledgments are received. The instructor explains that the window size is the number of frames that can be in transit at any time.
95:00 – 100:00 95:00-100:00
The instructor discusses the Go-Back-N ARQ protocol. The key idea is that the sender can send multiple frames before receiving an acknowledgment. If a frame is lost, the sender must retransmit all frames from the lost one onwards. The instructor explains that the window size (N) must be less than or equal to 2^m - 1, where m is the number of sequence bits.
100:00 – 105:00 100:00-105:00
The instructor presents a GATE 2006 question about a sliding window protocol with N=3. The task is to find the total number of packets transmitted when every 5th packet is lost. The instructor draws a timeline showing the transmission of packets 0, 1, 2, 3, 4, 5, 6, 7, 8. When packet 5 is lost, the sender retransmits packets 5, 6, 7, 8. This process repeats, and the total number of transmissions is calculated to be 18.
105:00 – 110:00 105:00-110:00
The instructor continues the GATE 2006 problem. The diagram shows the sender's window sliding as acknowledgments are received. The instructor explains that when packet 5 is lost, the sender retransmits packets 5, 6, 7, 8. When packet 10 is lost, the sender retransmits packets 10, 11, 12, 13, 14, 15, 16, 17, 18. The total number of packets transmitted is 18.
110:00 – 115:00 110:00-115:00
The instructor discusses the Selective Repeat ARQ protocol. The key difference from Go-Back-N is that the receiver can acknowledge individual frames. If a frame is lost, only that frame is retransmitted. The instructor explains that the sender's window size is much smaller, typically 2^(m-1), to avoid ambiguity in sequence numbers.
115:00 – 120:00 115:00-120:00
The instructor explains the concept of sequence numbers in ARQ protocols. The sequence numbers are used to identify frames. The number of sequence bits (m) determines the total number of possible sequence numbers, which is 2^m. The sender's window size (SWS) and receiver's window size (RWS) must satisfy the condition SWS + RWS <= 2^m.
120:00 – 125:00 120:00-125:00
The instructor discusses the maximum sender window size in Go-Back-N ARQ. The formula is given as SWS = 2^m - 1. The instructor explains that this is because the sender needs to be able to distinguish between the next frame to be sent and the frames that have been acknowledged. The maximum window size is 7 when m=3.
125:00 – 130:00 125:00-130:00
The instructor presents a GATE 2025 question about channel utilization in a Stop-and-Wait protocol. The frame size is 3000 bits, the transmission rate is 2000 bits/sec, and the propagation delay is 100 milliseconds. The instructor calculates the transmission time (Tt) as 3000 / 2000 = 1.5 sec. The channel utilization is given by the formula Tt / (Tt + 2*Pd), which is used to find the answer.
130:00 – 135:00 130:00-135:00
The instructor discusses a GATE 2022 question about the time taken for a packet to be completely received. The problem involves a 100 Mbps link, a distance of 2100 km, and a signal speed of 3*10^8 m/s. The instructor calculates the propagation delay (Pd) as 2100*10^3 / 3*10^8 = 7 ms. The transmission time (Tt) for a 1000-byte packet is 1000*8 / 100*10^6 = 0.08 ms. The total time is Tt + Pd = 7.08 ms.
135:00 – 140:00 135:00-140:00
The instructor presents a GATE 2017 question about the transmission efficiency of the Stop and Wait ARQ protocol. The parameters are given: bit rate 1 Mbps, propagation delay 0.75 ms, time to process a frame 0.25 ms, frame size 1980 bytes, and acknowledgment size 20 bytes. The instructor calculates the transmission time for the frame and acknowledgment, and then uses the formula for efficiency to find the answer.
140:00 – 142:29 140:00-142:29
The instructor discusses a GATE 2015 question about achieving 100% utilization in a Selective Repeat protocol. The problem involves a 128*10^3 bits/sec satellite link with a 150 ms propagation delay and a frame size of 1 kilobyte. The instructor calculates the transmission time (Tt) as 8 ms. The window size is given by (Tt + 2*Pd) / Tt, which is used to find the minimum number of sequence bits.
This video provides a comprehensive and methodical review of data link layer protocols and performance analysis. The instructor begins by establishing the fundamental concepts of transmission and propagation delay, which are the building blocks for all subsequent calculations. The core of the lecture is the application of these concepts to different reliable data transfer protocols. The instructor uses a whiteboard to clearly illustrate the mechanisms of Stop-and-Wait, Go-Back-N, and Selective Repeat ARQ, highlighting their differences in window size, retransmission strategy, and efficiency. A key strength of the video is its focus on problem-solving, as it systematically works through a series of GATE exam questions. This approach allows the viewer to see how the theoretical concepts are applied to calculate critical parameters such as channel utilization, maximum window size, and the minimum number of sequence bits. The progression from basic definitions to complex problem-solving creates a coherent learning path, making the material accessible and practical for students preparing for competitive exams.