Routing
September 7, 2024IP-Header
September 7, 2024Routing
| Question 10 |
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 | |
| 4 |
Question 10 Explanation:
Now Graph will look like
And only link that will be removed is R5-R6 link.
And only link that will be removed is R5-R6 link.
Correct Answer: B
Question 10 Explanation:
Now Graph will look like
And only link that will be removed is R5-R6 link.
And only link that will be removed is R5-R6 link.