Computer Networks IPv4/IPv6, Routers and Routing Algorithms Router and Routing Algorithm

Suppose different cities are connected via paths and using the distance vector algorithm to search the shortest path from Delhi to Ranchi, Patna and Bokaro.

Consider Delhi is having 3 neighbour cities as Lucknow, Kanpur and Noida. Distance measured from Delhi to Lucknow, Kanpur and Noida in one iteration are 550 km, 430 km and 350 km respectively. Delhi gets routing vector from its neighbours that means the distance to Ranchi from Lucknow, Kanpur and Noida are 728 km, 652 km, 532 km respectively. Distance to Patna from Lucknow, Kanpur and Noida are 608 km, 702 km, 812 km respectively. Distance to Bokaro from Lucknow, Kanpur and Noida are 720 km, 650 km, 642 km respectively.

We will get new routing table at Delhi after updation. Which of the following is/are INCORRECT regarding this?

1
The distance from Delhi to Bokaro will be updated as 1080.
2
The next hop city for sending a packet from Delhi to Ranchi via Noida.
3
The distance from Delhi to Patna will be 1158.
4
The next hop city for sending a packet from Delhi to Bokaro via Kanpur.

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters