3.7 - TCP Congestion Control | FHU - Computer Networks
HTML-код
- Опубликовано: 26 июн 2024
- An overview of TCP's congestion control algorithm (slowstart, congestion avoidance, fast recovery).
The slides are adapted from Kurose and Ross, Computer Networks 5th edition and are copyright 2009, Kurose and Ross.
Man, this was straight and clear. 20min of these was more helpful then 6 hours of university lesson
Don't stop making videos. Your videos are really saving a lot of time and are extremely important in terms of exam point of view.
I just came here to prepare for an exam. :)
Your videos are so clear and concise. You've demystified TCP in such a simple manner. Thank you.
Thank you for making a cogent and accurate lesson on a topic that is very difficult to find good information on.
this really is a great video man 18 minutes that saves you tons of reading ty!
Hats off to you on such a great explanation. All the confusion has just gone ... thanks for the amazing video.
This helped me understand the AIMD concept better. Thanks a lot dude.
Thank you for this video! And by the way I do quite increase my driving speed at night, so it was funny when you brought it up.
Excellent explanation. The best one ever on RUclips after browsing some many other videos. Thank you so much sir 😁
That was perfect explanation of this topic , good work .
Sir , I am very grateful. It was really helpful and without complication. Wish I had teacher like him. Nice job and don’t stop
Very Nice Chief ! Thank you.
Thanks for making this video. It really helps!
This was perfect. Thank you
Thank you , it is a very helpful and explanatory video!
This is probably the most clear explanation I have ever seen. (And I have an MS degree.)
It was awesome, super easy and saving time. Thanks
Awesome. Appreciate so much!
Absolutely amazing!
Thank you very much.. Very insightful.
Thank you, the video really helped and explanation is very clear.
this is super helpful man thank you!!!
that was really useful, thank you so much!!!
Thanks a lot sir, really appreciate your work
Great Video! love it
Great lecture!
GREAT MAN!!
Excellent explanation. Thank you!
You are welcome!
Perfect, thank you Sir!
What a good video!
Wooow sir what a beautiful explanation... great work sir thank you very much sir. I just gained a mass knowledge on this topic it's so interesting....!!! Thank you sir.
So helpful! Thanks:)
thank you sir
so helpful , thank you
TOP and CLEAR in just 18 minutes
Great video thank you
This vid is so helpful and great.
BTW, is there one state called "Fast Retransmission" between Slowstart and Fast Recovery that instantly resend the lost package back to sender after receive 3 dupACK?
what a hero!
Great sir
Second video second shoutout! Don't lose faith, almost there.
Thank you
What if initially cwnd = 4 and in the first round one of the 4 segments is lost, how will the diagram look like then? Do I have in RTT=1: cwnd=4, RTT=2: cwnd = 7 or 8 ?
So is TCP Tahoe and Reno just the separation between these two algorithms where one drops the current cwnd and starts anew and the other just cuts it in half but doesnt drop the previous state completely ? Or am I getting this wrong. Because the title just says TCP. It doesnt say which one.
Teşekkürler Hocam
They have speed limit signs like that where I live :0
Good
The only thing I don't understand is initial arbitrary value set for ssthresh. I read in rfc 5681 that it's set arbitrarily high to avoid imposing limits on the max throughput of a line. I.e. "to the size of the largest possible advertised window" the language here is confusing me. If it's the largest window how can you grow beyond it.
The problem i had was the "randomness" of the congestion window but finally i got the part that is there is more than one system sending in the network so your own congestion window needs to change according to that haha, not sure why it took so long for me
may you provide the presentation, please
👏👏👏👏
If you want to learn someone something you need a MORE illustrations. This was like I was on class and professor just reads the lecture from his laptop/phone/notes/books... boring right? Please, more illustrations in future content!
The graph at 7:07 is wrong , initiall the window size is increasing exponentially , so fist part will be exponential :-/
It was because he wasn't talking about slow start at that time
dommage que la vidèo est en anglais et pas en français
WHY can’t you be my university lecturer?