About distance table and distance vector routing algorithm

Hi, I'm studying this algorithm
, here is a simple network:
http://www.geocities.com/chikongyuen/DV.jpg

here is my distance table so far, I'm not too sure if it's right...since I can't find any example like that,
here is my  work:
http://www.geocities.com/chikongyuen/DT.txt
can anyone one give me some idea, am I doing right, or missing something or on the wrong track...
thanks in advance
penny_hardwayAsked:
Who is Participating?
 
rafael_accCommented:
That's ok. This usualy is used by the RIP routing protocol. I don't know the theory behind Bellman-Ford. You should have a good theory background about the algorithm before trying to apply it.

http://www.brainyencyclopedia.com/encyclopedia/b/be/bellman_ford_algorithm.html

Just insert the algorithm (code lines) and run it! Then you would be able to check either what u r doing is right or wrong.
Cheers.
0
 
rafael_accCommented:
Take a look at the Dijkstra algorithm theory!
0
 
penny_hardwayAuthor Commented:
I think i'm using the  Bellman-Ford one...is that wrong?
0
 
penny_hardwayAuthor Commented:
thanks, i think i got some misunderstand about the algo..anyway.thanks
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.