Distance Vector Routing Algorithm

Explain distance vector routing algorithm with the help of suitable example.

Questions by rajesh_domadiya

Showing Answers 1 - 9 of 9 Answers

Tanu_shree

  • Sep 13th, 2008
 

Distance Vector Routing Algorithms calculate a best route to reach a destination based solely on distance. Eg. RIP. RIP calculates the reachability based on hop count. Its different from link state algorithms which consider some other factors like bandwidth and other metrics to reach a destination. Distance vector routing algos are not preferrable for complex networks and take longer to converge.

rahul nikam

  • Nov 8th, 2014
 

what is distance vector routing?

  Was this answer useful?  Yes

susheeljain1679@hotmail.com

  • Jan 12th, 2015
 

At the present time there is a good distance vector routing protocol is EIGRP. It can use the best route to send the packets as per neighbor route metric and selects the best metric calculation.

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions