Consider a network with 6 routers R1 to R6 connected with links having weights…
2010
Consider a network with 6 routers R1 to R6 connected with links having weights as shown in the following diagram
All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link. After all the routing tables stabilize, how many links in the network will never be used for carrying any data?
- A.
4
- B.
3
- C.
2
- D.
1
Attempted by 132 students.
Show answer & explanation
Correct answer: C
Correct. Two links will never be used for carrying any data. Provide concise explanation identifying which links are unused and why distance-vector routing chooses other paths based on path costs.
A video solution is available for this question — log in and enroll to watch it.