Bellman Ford Distance Vector Algorithm (for computing least cost paths)
Consider the 6-node network shown below, with the given link costs:
1. When the algorithm converges, what are the distance vectors from router 'U' to all routers? Write your answer as u,v,w,x,y
2. What are the initial distance vectors for router 'X'? Write your answer as u,v,w,x,y and if a distance is ∞, write 'x'
3. The phrase 'Good news travels fast' is very applicable to distance vector routing when link costs decrease; what is the name of the problem that can occur when link costs increase?
1. When the algorithm converges, router U has distance vectors (u,v,w,x,y) = (0,9,13,10,19)
2. The initial distance vectors of router X are: (u,v,w,x,y) = (x,1,7,0,9) where x is ∞
3. It is called the 'Count to Infinity' problem.
The answer was: 0,9,13,10,19
The answer was: x,1,7,0,9
The answer was: Count to Infinity