Distance-Vector Routing Algorithm - IP Network Layer | Computer Networks Ep. 5.2.2 | Kurose & Ross

[@Phas0ruk]

These videos are PURE GOLD. Thank you for making them. They are clear, in depth enough and I can follow along. The best videos I have found for networking on YT. Thanks!!!

[@EpicNetworks]

Thanks for the compliments, glad you like them!

[@diantepage357]

What a great explanation of how this works, thank you so much! This deserves way more views!

[@EpicNetworks]

Glad it helped!

[@ivanvicentemorenocencerrad1143]

Great explanation! Appreciate the clean and concise walkthrough

[@EpicNetworks]

Glad it was helpful!

[@mehmetfatihayten8269]

Saved lots of network course students, thank you soo much monsieur:)

[@EpicNetworks]

Glad it helped!

[@vandit_quantum]

stress buster + life saver !

[@EpicNetworks]

Glad I could help!

[@jacobnorgren6213]

5:45 "... the longest shortest path" ?!

[@harchitb]

what are the values of the edges in the real world? (units)

[@sachingiri8610]

routing protocols combine several factors like bandwith, delay, hop count, link utilization and many more into a composite metric, allowing for more context-specific routing decisions. The unit of edge cost is therefore often an abstract value derived from one or more of those underlying metrics, depending on the routing protocol and the specific requirements of the network.

[@deveshnandan323]

Thank You for the videos sir, awesome explanation.

[@EpicNetworks]

You are welcome, glad you like them!

[@minhajsixbyte]

thanks!

[@EpicNetworks]

You bet!

[@benzo-diazepine]

i love you.

[@noanelersa661]

😃😃😃