Q. 11 Consider a network with 6 routers R1 and 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 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
Answer: (C)
Explanation:
