Flow Control and ARQ 3: Go-back-N and Selective-reject ARQs
Вставка
- Опубліковано 19 вер 2024
- This video describes two ARQ schemes associated with sliding window flow control. Much of this material is based on content from the book Data and Computer Communications by William Stallings.
finally, a video that isn't in hindi ;u;
they been all over youtube lately...
@@Fiji_water_man So annoying!!!
@@michaelbuchler2743 hmm its like people speak other languages besides English...who would've thought
Yeah, who would have though that UA-cam would even offer you a video in hindi unless you explicitly search for it...
thank you for your service to engineering/it/comp sci students everywhere man
Today (27 May 2020) is exactly 4 year since you posted this video. I'm watching it for my assignment. Thank you!
your way of teaching is simple and effective!!!! Good Job!!! Thanks for sharing !!!
This is a very concise and accurate sliding window explanation! Thank you.
Thank you very much for the informative video. Much appreciated.
why isit that there have never been acknowledgements for frame 0?
By acknowledging N you also acknowledge N-1, N-2, ..., 0.
This is pretty lit tbh
thanks
Love your videos
I am pretty sure that both algorithms do not work with Reject messages but with Timeouts of the source. Am I wrong?
jacob, ADAMSIN!
good video
Thank you! Great video :)
this is for data link protocol layer or the transport protocol layer >????
very nice!
Hi! first of all thanks for the awesome video! Only one question on the Go-Back-N : let's assume that an RR from Reciever gets lost so the Source sends a RR (poll) that also gets lost due to some network error. Does the Reciever have to wait for another Source Timeout and RR(poll) ? Thank you!
awesome! thank you so much:)
At 2:15, won't we have a Frame 2 re-transmission by the sender because the receiver only sends an ACK2 (RR 2), and the sender goes like "okay, the receiver got 0, 1; but he missed a 2". It then shrinks its window, removing the 0 and 1, BUT it still transmits the Frame 2 (F2) that you did not do at 2:20?
Also, do we really have the "reject" messages that are sent by the receiver, or do we just have a time-out on the sender side that makes the sender to repeat the transmissions that are in it's current window? I ask this because a few other sources (I am not very sure I believe them, but it is good to clarify I think) do not mention these "reject" messages
The sender knows that it already sent Frame 2, and the RR 2 doesn't mean that the transmission of Frame 2 failed, merely that the receiver has not acknowledged it yet. From the sender's perspective, it assumes that RR 2 was sent while its own Frame 2 message was enroute, and until it has evidence to the contrary, it will assume that Frame 2 message could still have been received.
If there is a time-out, then the sender will eventually check to see what is going on, but if the receiver rejects a frame as soon as it sees a gap, it can likely get a quicker response, and possibly spare the sender from transmitting a lot of data that will be discarded anyway.
@@JacobSchrumah okay, thanks! This is a bit different than how I have been taught. Could you please also let me know about:
1) the "reject" messages by the receiver? I have not come across such messages specifically for Go-Back-N, only for Selective Repeat. But I can understand the logic behind it.
2) I have been told that there aren't any NAK's in GBN, but that the "time-out" is the only event in which retransmissions can occur, aiding the receiver in getting those lost frames. Even the "poll" message that you mentioned that the sender has the capability to send. I have not come across those. This is making me even more confused because, everything you say also makes logical sense.
Of-course I understand that I am newbie, and really want to know the 'standard' way. I would really appreciate if you have a great resource that I can rely on to study this.
3) Does the sender, in GBN, have logic involved in it's side that allows it to keep track of what are the ACK'ed, UNACK'ed, can-transmit packets in it's window? Because when you mention at 2:15 that the sender just sends the frame 3 after the RR2, it makes me believe that there is some state saving going on the sender side to keep this information.
Thanks a ton for such a quick response, I really appreciate it! You are a fantastic source to learn Computer Science from :)
i really appreciate your videos. According to this video you shouldve explained the function between the buffer and the ARQ protocolls in a more detailed way.
amazing thanks!
Hello sir. Great videos. But that haircut though :P
klaiw
if the window size is 3, should it not not send the F1 that ends up failing?
for selective repeat doesn't each frame have its own timer ?
For the sender, it is sufficient to base the timeout on the last reply from the receiver. Or were you referring to something else? Perhaps you could clarify.
awesome work. can u please tell is there any difference between Go-Back-N and Go-Back N ARQ both are same things?
same
Thanks sir
This example is for N=4 right?
Nice video but there is a slight error in go back n since window size is 3 u cannot send f1 until rr3/rr0/rr1 is received..☺️
that is what I thought too......can the author confirm this
perfect !! what is the different between those 2
Something missing. You need define Window Size!
when do the source and the destination agree on the size of the window?
Hi RR2=ACk2 ?
thanks
thanku sir :)
Shouldn't it be 0,1,2 for N=3? Not 0,1,2,3.
Please, I need to know for my test lol.
thnx
Selctive repeat, not reject..
Either: en.wikipedia.org/wiki/Selective_Repeat_ARQ