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?
Explanation: See question 3 of http://www.geeksforgeeks.org/computer-networks-set-4-2/
Quiz of this Question
Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.