Consider a network with 6 routers R1 to R6 connected with links having weights…
GATE · 2010 · CS · Computer Science & IT
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?
- A.
0
- B.
1
- C.
2
- D.
3
Attempted by 178 students.
Sign up free to check your answer
Sign up freeLoading lesson…