Test series

Question

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 entity for each neighbour with the weight of the respective connecting link. After all the routing tables stabilize, which of the following links in the network will never be used for carrying any data?

How R3-->R4-->R6 and R3-->R5-->R4—R6 both paths have same weight then in this case should i consider both of then or just one of them that is having less number of hops in between?

 

Comments

6,5,8,3,7 will never be use

---

R3-->R4-->R6 and R3-->R5-->R4—R6 both have 8 weight

Answer 1

For this type of questions,just simply calculate cost column by help of intution(i.e. by finding shortest path) and here using dvr algo will be time consuming R2-R3 ,R2-R4,R3-R5,R5-R6 links will never be used,if any mistake kindly tell

Comments

@MonuKhan you no need to go through R3-R4-R6 or any other,we have a better path i.e. R3-R2-R5-R4-R6