Multiple choice

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

Suppose the weights of all unused links in the previous question are changed to 2 and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?

  1. 0

  2. 1

  3. 2

  4. 3

Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation