5.2.2 - Distance Vector Routing | FHU - Computer Networks
ฝัง
- เผยแพร่เมื่อ 16 ก.ย. 2024
- An overview of Distance Vector routing and a comparison to Link-State.
The slides are adapted from Kurose and Ross, Computer Networks 5th edition and are copyright 2009, Kurose and Ross.
10:53 bold of you to assume I'm not excited enough to see the updated tables >:(
Great video by the way, helped me out a ton!
HAHAHA! Yes exactly
Thank you after I browsed so many videos, this one made me understand the algorithm.
Can't we reach D from A via B & C with minimum cost when compared to via C?
A - B - C - D gives 2+1+4=7 to reach D, which is smaller cost than via C only A - C - D (4+4=8)??
very clear and informative
Hey Kenan, good job with these tutorials. However there is one mistake in your slide, bellman ford takes O(n^2).. i.e O(|v|*|e|) and in case of a complete graph it takes O(n^3) time.
Just so you know, the topic number is 4.5.2 from Computer Networks book that you took these lecture. Very informative though.
Pr what is it that you said c(u,W) = 5 ( why not go from u to x then x to w = 1+3 and say c(u,W) = 4) this suggest that for c(u w) we have to take the direct cost not the short route?
Hello, so in the first exercise, I don't understand why you include w since w is not a neighboor of u. Anyone can explain?
I have followed your series from chapter 1......this videos was not at the level that u usually have.. I could not understand without reading the book