Count to Infinity problem in Distance Vector Routing

[@maruthisrinivas2294]

Very Very and Very Good and straight Forward without any diversions...very well explained...i know that i used "Very" so many times..but you deserve that man!!

[@Alisilou]

"the connection between B and C is lost" sounds so sentimental with this music, I almost shed a tear

[@unique_bhanu]

😅

[@haiuongnguyen4234]

I laughed so hard omg

[@anjanaak7426]

😂😂

[@AB-sd9gx]

I wasted almost an hour on other videos, but only this 4 minute video cleared the thing so easily!!!

[@j.e.downhill8715]

Thank you so much ... your were able to explain what my professors was not able to do within 90 minutes..

[@aanniiee6829]

Everything explained in under 5 minutes! Thank you!

[@joyoshish]

Please make more videos like these. I can bet your channel will grow fast. Nice and simple explanation. Also, the video style using Manim and the music seem to be really soothing. Keep up good work!

[@berkay2608]

THANK YOU THANK YOU GOD BLESS YOU MY FRIEND

[@mirudhulaloganath7057]

cant believe u managed to explain it perfectly in almost just 3 mins!!

[@devanarayanababu1996]

crisp animation, easy to follow! ty

[@therealajmelmuadz]

Bro really dropped a high quality video and just dipped.

[@_Anna_Nass_]

easiest explanation I've found, thank you!!!

[@margaritalilly6807]

Wah!!👏👏 I don't know how to say thankyou. You really saved my time. ☺️ Thank-you so much

[@thenerds9134]

Glad it was helpfull :)

[@shibishprabakaran1997]

Nice explanation in a small crisp👏👏👏

[@ronaldfungss]

Clear explanation. Thank you

[@fpsgamer3267]

Clear and easy to understand

[@nitishrajbongshi9311]

exactly what i needed. Thank you...

[@Azpeitiamarkel]

simple and direct, thank you

[@lenadu5468]

nicely explained... wish my lecturer can explain as good as you

[@nadzeyahutsko1094]

Thank you so much for this wonderful explanation!

[@peterelovsson5232]

Brilliant video. Thank you so much for making it 👍

[@indigoriviera]

Very clear. Thank you for this video.

[@JohnDoe-yh8rr]

HEY SIR thank you for this video this was very simple and straightforward. Maybe in the next video you can talk about the solutions for this problem such as split horizon and poison reverse. love you

[@yogitajain8003]

The best i have ever heard...thank u

[@JonasHerbertson]

Great work! Thanks!

[@venkatasaignanaprakashmees8352]

Very well explained

[@mazenabouelhassen4913]

Very well explained, thank you

[@siddharthmathkar175]

Beautiful video!

[@pratheeeeeesh4839]

at 3:04 when router "B" sends a table to router "A" saying that it would help router "A" to reach router "C" by cost 4 in that case since router "A" (even though the connection is lost) assumes it already has a path c with cost 3(thats what the table of router A tells) which is less that than one offered by router "B" why will it update the entry of path A-->C to 5 . since it already know a better path (which however it is unaware that such a path might not exist though) any body please explain me this ?

[@pratheeeeeesh4839]

This makes sense if we assume the good news travels faster than the bad ones, but why is that bad news travels slower?? okay Is it like both the possibilities are possible if the contrary one happens then all is good. but if the above mention one happens the we do run into a slow convergence problem?

[@paruldang952]

Very helpful!! Many thanks..

[@aerodynamic8780]

Really good video my friend!! Awesome animations too btw

[@thenerds9134]

Thanks! You should definitely take a look at the 3b1b channel!

[@aerodynamic8780]

@@thenerds9134 thanks I will check it out

[@NPALLEMADHU]

Wah ! nice video ! keep it up ! pretty stright forward !

[@carolinamiguel3501]

Thank you so much! This was so helpful

[@mihiryoganandi1391]

Very Good explanation in short video

[@fromartic]

Great video

[@mittuvalasa6528]

Clear and good video

[@ITEngineer99]

Nice one....superb animation mentor......make video on split horizon also......

[@BharathRaj-yd5vc]

Annaa.. Thankyou 🙏

[@rupalikaple6314]

smart expectation.

[@tusharsahu8587]

Thank you So much.

[@laineyeorankim3121]

Thank you so much!

[@chupapimunanyo2596]

Video style copied from 3Blue1Brown ?

[@thenerds9134]

Definitely. As stated explicitly in the description ;) Big fan of 3b1b!

[@FamousEgyptboy]

Really helpful Thanks!

[@thenerds9134]

More than welcome :)

[@kushalupreti509]

Thanks mate. This was a perfect video. Btw what software did you use to make this video?

[@jmohamed87]

Brilliant

[@mariammohamedsaad6513]

Thank you

[@pritommazumder9897]

Make more videos, Man!

[@videowatcher4852]

Thank you!!

[@keentoknowher]

Tqsm

[@prabhusubramanianlectures4307]

Awesome

[@rah6031]

perfect.

[@samuelsuther1583]

Can this problem be overcome if router B checks how A reaches to C and if it realizes that if A reaches to C via B (itself), it doesn't update the entry and marks it with "- -", then the count to infinity problem won't occur?

[@thenerds9134]

That would definitely work. But keep in mind that if you scale this problem, say that you have 5000 routers, this would mean tables with a lot more information. And what if a package is already sent, but in between sending and reaching one of the connections breaks down?

[@samuelsuther1583]

@@thenerds9134 i went to search somemore. It seems possible and this is what "split horizon" method does. But if there is a loop with 3 or more nodes, the method womt work

[@almogz9486]

3b1b visuals nice

[@annghiephuynh7596]

thanks :3

[@weaponkid1121]

I don't get it. Why doesn't C just send it's table to all neighbors after it updates its C entry? Seems like a trivial problem to solve, which must mean I'm misunderstanding something

[@Madie-si6me]

Nice

[@alexprice4135]

thank you! Why did my textbook make this so complicated??

[@ashirafzal2025]

cool

[@kabirsingh1171]

But after link breaks b will first send its vector to A because B's routing table is changed.but you showed B is recived table from A and according to that B changes

[@vishalcseiitghy]

The fun fact is each router sends its distance vector only so they don't know they are taking any node to the lost node via them only and that is where the problem arises.

[@ibu2685]

That's where we introduce BGP which collects path information also.

[@vishalcseiitghy]

@@ibu2685 yes I agree

[@vizallaround]

bro explained a 45min lecture in 3 min

[@maoiljitschguevara]

So - where's the problem with that? Neither A nor B can reach C, but think the other one can. Therefore, they keep incrementing the cost. Since they can't reach C anyway, why does that matter? How is a high cost value for an impossible connection a problem?

[@chupapimunanyo2596]

I think he likes 3blue1brown. Just an assumption...

[@akshansh_00]

god

[@Ggag123]

it is confusing when you are talking about something else and pointing to something different. like when talking about B -> C and you point at A -> B

[@rafi_talks]

Remove the music man, it's distracting. Adds zero value. Your voice is good enough for explaining the meterial.

[@sonani100]

why does this have to be soo complicated i dont even understand what he is saying not even close

[@thenerds9134]

What exactly is it you do not understand? Can you point to a specific time in the video?

[@abdelkaremhomidi7322]

I think that you have some erreur bro

[@DK-jd5tb]

NETHERLANDS NUMMER 1 RAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAH

[@universal4334]

Thanks a ton

[@weihyac]

thank you

[@heyfromrenukapreneth]

Thank you!