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.

Комментарии • 57

  • @gabrielgraf2521
    @gabrielgraf2521 Год назад +7

    Man, this was straight and clear. 20min of these was more helpful then 6 hours of university lesson

  • @deepeshgodara651
    @deepeshgodara651 6 лет назад +93

    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.

    • @worldpotato
      @worldpotato 4 года назад

      I just came here to prepare for an exam. :)

  • @kepegus
    @kepegus Год назад +1

    Your videos are so clear and concise. You've demystified TCP in such a simple manner. Thank you.

  • @sammieollie
    @sammieollie 6 лет назад +10

    Thank you for making a cogent and accurate lesson on a topic that is very difficult to find good information on.

  • @nikosnichlos9286
    @nikosnichlos9286 4 года назад +4

    this really is a great video man 18 minutes that saves you tons of reading ty!

  • @izharkazmi
    @izharkazmi 3 года назад +1

    Hats off to you on such a great explanation. All the confusion has just gone ... thanks for the amazing video.

  • @daanyder_renegade972
    @daanyder_renegade972 4 года назад +1

    This helped me understand the AIMD concept better. Thanks a lot dude.

  • @ricardomartins4608
    @ricardomartins4608 5 лет назад +2

    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.

  • @tejasnareshsuvarna7948
    @tejasnareshsuvarna7948 5 лет назад +2

    Excellent explanation. The best one ever on RUclips after browsing some many other videos. Thank you so much sir 😁

  • @chiragchoudhary2497
    @chiragchoudhary2497 5 лет назад

    That was perfect explanation of this topic , good work .

  • @mykhailoshpakov6487
    @mykhailoshpakov6487 4 года назад +1

    Sir , I am very grateful. It was really helpful and without complication. Wish I had teacher like him. Nice job and don’t stop

  • @rahuldhar7784
    @rahuldhar7784 Год назад +1

    Very Nice Chief ! Thank you.

  • @tom17936548
    @tom17936548 3 года назад +1

    Thanks for making this video. It really helps!

  • @sashsec1018
    @sashsec1018 6 лет назад +1

    This was perfect. Thank you

  • @pkpkgr
    @pkpkgr 5 лет назад

    Thank you , it is a very helpful and explanatory video!

  • @adityakadam5737
    @adityakadam5737 5 лет назад

    This is probably the most clear explanation I have ever seen. (And I have an MS degree.)

  • @Ben-em2ry
    @Ben-em2ry 5 лет назад

    It was awesome, super easy and saving time. Thanks

  • @Jeanify10
    @Jeanify10 6 лет назад +1

    Awesome. Appreciate so much!

  • @houseofkings3329
    @houseofkings3329 4 года назад

    Absolutely amazing!

  • @varunpjoshi
    @varunpjoshi 5 лет назад +1

    Thank you very much.. Very insightful.

  • @irfadrazick1847
    @irfadrazick1847 4 года назад +1

    Thank you, the video really helped and explanation is very clear.

  • @AnhNguyen-kb7fz
    @AnhNguyen-kb7fz 5 лет назад

    this is super helpful man thank you!!!

  • @MrIliass99
    @MrIliass99 3 года назад +1

    that was really useful, thank you so much!!!

  • @adarshsasidharan254
    @adarshsasidharan254 4 года назад +1

    Thanks a lot sir, really appreciate your work

  • @kangw1624
    @kangw1624 3 года назад +1

    Great Video! love it

  • @KrishnaKumar-np3tw
    @KrishnaKumar-np3tw 4 года назад +1

    Great lecture!

  • @lironglickman9611
    @lironglickman9611 6 лет назад +1

    GREAT MAN!!

  • @Raptilicus
    @Raptilicus 4 года назад +1

    Excellent explanation. Thank you!

  • @balazsbanto2249
    @balazsbanto2249 3 года назад +1

    Perfect, thank you Sir!

  • @shiny8119
    @shiny8119 5 лет назад +1

    What a good video!

  • @ahmedshafraz1538
    @ahmedshafraz1538 4 года назад +1

    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.

  • @maryzhang8825
    @maryzhang8825 4 года назад +1

    So helpful! Thanks:)

  • @user-yi8bz2ng6z
    @user-yi8bz2ng6z 15 часов назад +1

    thank you sir

  • @elnazashena1854
    @elnazashena1854 5 лет назад

    so helpful , thank you

  • @oooakpoka
    @oooakpoka 4 года назад +1

    TOP and CLEAR in just 18 minutes

  • @shaya568
    @shaya568 2 года назад

    Great video thank you

  • @az0304
    @az0304 3 года назад +1

    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?

  • @taylan1039
    @taylan1039 3 года назад

    what a hero!

  • @jeyarathinam2222
    @jeyarathinam2222 4 года назад +1

    Great sir

  • @OneGoodVideo
    @OneGoodVideo 4 года назад +2

    Second video second shoutout! Don't lose faith, almost there.

  • @louaykhammar7268
    @louaykhammar7268 2 года назад

    Thank you

  • @Cotyora1905
    @Cotyora1905 5 лет назад

    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 ?

  • @baronhelmut2701
    @baronhelmut2701 4 месяца назад

    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.

  • @merttoktas4177
    @merttoktas4177 3 года назад

    Teşekkürler Hocam

  • @KILLKIDspeedrun
    @KILLKIDspeedrun 4 года назад +1

    They have speed limit signs like that where I live :0

  • @jeyarathinam2222
    @jeyarathinam2222 4 года назад +1

    Good

  • @evolagenda
    @evolagenda Год назад

    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.

  • @mixolt23
    @mixolt23 6 лет назад

    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

  • @salmatofaily389
    @salmatofaily389 5 лет назад

    may you provide the presentation, please

  • @dawoodmuzammil485
    @dawoodmuzammil485 4 года назад +1

    👏👏👏👏

  • @souventy7587
    @souventy7587 5 лет назад +1

    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!

  • @KnowledgeAmplifier1
    @KnowledgeAmplifier1 4 года назад

    The graph at 7:07 is wrong , initiall the window size is increasing exponentially , so fist part will be exponential :-/

    • @1nikhils
      @1nikhils 4 года назад

      It was because he wasn't talking about slow start at that time

  • @aekboudj4713
    @aekboudj4713 2 года назад

    dommage que la vidèo est en anglais et pas en français

  • @wolvAUS
    @wolvAUS 3 года назад

    WHY can’t you be my university lecturer?