Extra note: For Selective Repeat: Relationship between Sequence Number Size & Window Size The ppt slides include the issue where receiver accepts duplicate data packet when the sequence number & window sizes are not adjusted correctly. However, the video does not cover that. So here is the issue: Window Size, N = 4. Sequence Numbers = [0, 1, 2, 3] Sender sends Packets{0,1,2}. Receiver receives all Packets{0,1,2} and sends ACKs{0,1,2}. Then moves its window to [ 3 0 1 2 ], so that it is now ready to receive new Packets{3, 0, 1, 2}. However, ACK(0) gets lost and sender never receives ACK(0). So the sender's window is still sitting on [ 0 1 2 3 ]. Now, after a certain amount of time, the timer for Packet(0) runs out. Timeout(0) is called and Packet(0) is Re-Sent ! This Packet(0) is the SAME packet as the previous Packet(0). Receiver, however, receives the Packet(0) and treats it as a New Packet(0) since the receiver's window is sitting on [ 3 0 1 2 ]. Then the receiver will deliver this DUPLICATE data packet to upper layer, which is an issue. So the question is: What relationship do we need between the Sequence Numbers & Window Sizes? The answer is, simply increase the sequence numbers by doubling and leave the window size. So, that the window size is at least half or less than the amount of sequence numbers. If this is applied to the same situation as above, this is what happens: Window Size, N = 4. Sequence Numbers = [0, 1, 2, 3, 4, 5, 6, 7] Sender sends Packets{0, 1, 2} Receiver receives all Packets{0, 1, 2}, sends ACKs{0, 1, 2}, and moves its window to [ 3 4 5 6 ] However, ACK(0) gets lost and sender never receives ACK(0). So, the sender's window is still sitting on [ 0 1 2 3 ] Timeout(0) is called, and sender re-sends Packet(0). Receiver gets Packet(0), checks that it is out of its window [ 3 4 5 6 ]. So, it discards the data packet, and Re-Sends ACK(0). Now, the receiver side does not deliver duplicate packet to upper layer !

Sir, this is a joy to watch. Your patient explanations are a huge help! - Thank you!

thank you so much for these videos, it's really amazing that you are explaining such content on youtube, thank you so much for the content

This video was fantastic. I've had issues understanding my class and this was absolutely magnificent

The most detailed video i have ever watched on reliable data transfer

Extra note: For Go-Back-N: How can Cumulative ACK actually work without an issue? On the slide it says, "cumulative ACK: ACK(n): ACKs all packets up to , including seq# n". This means that if the Sender receives ACK(5) - although never have received ACK(2), ACK(3) and ACK(4) - the Sender will ACK all of them anyway. You may think that this could cause some issues but that is not true. This is because the Receiver will only send ACK with the highest seq # out of the packets it received so far. If the Receiver did not get all or any of the Packets{2,3,4}, but got the Packet(5), it will never send ACK(5) because Packet(5) is not the in-order highest seq# of the packets it received so far. So, by the stage where the Receiver actually sends ACK(5), it means that the Receiver actually received all Packets{1,2,3,4,5}. Then, if sender gets ACK(5), although it didn't get ACKs{2,3,4}, the Sender can reasonably think that the Receiver actually has received all the packets correctly up to seq# 5. Thus, Sender does not have to worry about missing ACKs{2,3,4}, and it can just ACK them all when it gets ACK(5). At the Sender side, Packets{2,3,4,5} were accumulated to be waiting for ACKs, and all of them got ACKed once ACK(5) was received. Hence the name suggests, Cumulative ACK.

Great Work

I suppose the answer to that last question is: Sender starting transmission of pkt 6 to 9, with window transferred to new location of 6 to 9.

there! Thanks a lot for the help, I'm going to subscribe to your channel and keep up with all the videos!

Summarizing: The video discusses the development of a reliable data transfer protocol that accounts for both message corruption and loss. The protocol uses timeout retransmission and sequence numbers, and can be pipelined to improve utilization. Two approaches are presented, Go-Back-N and Selective-Repeat.

rdt protocol mechanisms: • error detection (e.g., checksum) • ACKs, NAKs • retransmission • sequence numbers (duplicate detection) • timeout-and-retransmit (lost messages)

clearly explained sir

Why are we restarting the sequence and resending pkt0 after pkt1 (in all of the examples)? Isn't it supposed to be pkt2?

0:50 rdt 3.0 15:15 selective repeat

In SR, can't we move the out-of-order ACKed packets outside the window? Why are we keeping them?

So is TCP a SR or a GBN protocol? I guess I will find out next...

At time 8:08, what if the duplicate ack1 arrives the sender side after the sending of the last pkt1? Sender will think this ack1 is for the last pkt1, but actually it is for the previous duplicate pkt1.

I love thee to the depth and breadth and height my soul can reach.

Sir Sakath video 😘

rdt2.2 is not there in lecture????????

Comment here for finance with bob

🧠

Hi guys I'm Bob finance advisor

All other videos are excellet except these two of RDT, its boring doesnt serve any usecase

LGBTQ+ i support, hence love video