Transactions
August 14, 2024Routing
| Question 11 |
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?
| 4 | |
| 3 | |
| 2 | |
| 1 |
Question 11 Explanation:
Link R1- R2 will not be used because its cost is 6 and link R1-R3-R2 costs 5, which is lesser than R1-R2 link.
Similarly, link R4-R6 will not be used, instead this link we can use R4-R5-R6 link which costs only 5 unit.
Similarly, link R4-R6 will not be used, instead this link we can use R4-R5-R6 link which costs only 5 unit.
Correct Answer: C
Question 11 Explanation:
Link R1- R2 will not be used because its cost is 6 and link R1-R3-R2 costs 5, which is lesser than R1-R2 link.
Similarly, link R4-R6 will not be used, instead this link we can use R4-R5-R6 link which costs only 5 unit.
Similarly, link R4-R6 will not be used, instead this link we can use R4-R5-R6 link which costs only 5 unit.
Subscribe
Login
0 Comments