Consider the 6-node network shown below with the given link costs:  When the algorithm converges, what are the distance vectors from router 'V' to all routers? Explain your answer

What are the initial distance vectors for router 'W'? Explain your answer as u,v,w,x,y and if a distance is ∞, write 'x'. Explain your answer 

 

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? Explain your answer 

Transcribed Image Text:

u 8 V 1 6 X -W 1 5 y u 8 V 1 6 X -W 1 5 y

Answer rating: 100% (QA)

Distance vectors from router V to all routers when the algorithm converges V to U 5 V to V 0 V to W 6 V to X 11 V to Y 7 Explanation To compute the di... View the full answer