Direction: 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?
-
- 0
- 1
- 2
- 3
- 0
Correct Option: B
As in the previous question 
and 
not used. So, we give them weight = 2, by applying same method only one link not used.
