Thank You So Much Ma'am..Cleared my Concepts very well. Helped me a lot in my orals. I could answer every trick question related to congestion control protocols.
@@Finn-jp6pn no, it's correct. cwnd is increased by 1 for every ack received, so you send 1 segment and get 1 ack, --> cwnd = cwnd + 1 = 2 --> you send 2 segments and get separate acks for segments 2 and 3 so you get 2 acks --> cwnd = cwnd + 1 repeated twice, so now it equals 4 --> you send 4 segments... etc. until reaching treshold
can you please explain cwnd = cwnd + 1 for slow start, you have told that it will increase exponentially but it is increasing linearly ? Its confusing....
y on a hurry lecture? and not a real time examples? lecture was good but it was really fast like reading something very quick and that takes the lecture so boring, please provide a little slow teaching and help with the basic examples that can help us to understand more.
this is why people say engineering is just a memory test...look at the lecture..no real time example and is really boring..put some extra things like the algorithms names..if you closely see, they named after US cities where you could loose a bunch of money :) try to add stuff like this...also things from a real network transfer perspective..not just theory....
Cleared my concepts of congestion control algorithm of TCP Tahoe. Loved your lecture. :)
I should watch this fully before I go for my exams. this is an awesome lecture.
Thank You So Much Ma'am..Cleared my Concepts very well. Helped me a lot in my orals. I could answer every trick question related to congestion control protocols.
This lecture is GOLD. Thank you so much Ma'am.
Explained very well in good detail. Thank you!
In Reno, when 3 Dup ACK's are received then CW is not reduced to 1 but to half of existing CW.......correct me if am wrong
Great lecture. Thank you.
Great video..This bettered my understanding on different TCPs. Thank you Mam!
Excellent lecture man. Thanks for sharing the knowledge.
You're very good!!! You can explain a lot better than my prof :) Thank You
At 5:05 , Slowstart. Shouldn't cwnd=cwnd*2 instead of cwnd+1
Yeah, I think so too. Before threshold, cwnd increases by a factor of 2.
@@Finn-jp6pn no, it's correct. cwnd is increased by 1 for every ack received, so you send 1 segment and get 1 ack, --> cwnd = cwnd + 1 = 2 --> you send 2 segments and get separate acks for segments 2 and 3 so you get 2 acks --> cwnd = cwnd + 1 repeated twice, so now it equals 4 --> you send 4 segments... etc. until reaching treshold
Excellent video, very clear explanation!
Around 14:00 is what I sought. Explained simply and fast.
Good explanation Maam..
Thank you for this lecture! It helped a lot!
So good. Thanks a bunch!
Great Video , Thanks Maam .
Very well explained Mam
Thank you mam
Thanks a million madam
thanks alot
Me having an exam tomorrow and watching this at 2x speed 😎
thanks mam
help me alot
Thanks mam
This is really good
Thanks ma'am.
can you please explain cwnd = cwnd + 1 for slow start, you have told that it will increase exponentially but it is increasing linearly ? Its confusing....
very helpfull
why did we have duplicate ack for packet 33?
Very Nice Video, I am unable to find CN Lecture 9. Can you please upload it? Thanks!
Thanks ma,am ..
What is awnd??
Avoidance window
Please send the .pdf
y on a hurry lecture? and not a real time examples? lecture was good but it was really fast like reading something very quick and that takes the lecture so boring, please provide a little slow teaching and help with the basic examples that can help us to understand more.
Switch the speed to 0.75. Thank me later
I did the opposite and set it to 1.5 lul
this is why people say engineering is just a memory test...look at the lecture..no real time example and is really boring..put some extra things like the algorithms names..if you closely see, they named after US cities where you could loose a bunch of money :) try to add stuff like this...also things from a real network transfer perspective..not just theory....
excellent video, just that she speak too fast
diagram is right but u r wrong. sorry to be honest