penny_hardway
asked on
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
, 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
Take a look at the Dijkstra algorithm theory!
ASKER
I think i'm using the Bellman-Ford one...is that wrong?
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER
thanks, i think i got some misunderstand about the algo..anyway.thanks