Consider a network with routers to connected with links having weights as shown in the following diagram.

Suppose the weights of all unused links are changed to and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?
View answer
Answer: B
Worked explanation not available yet.
Free practice · Your answers on this page are not saved.
