GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

  GeekInterview.com  >  Interview Questions  >  Networking

 Print  |  
Question:  Distance Vector Routing Algorithm

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


September 09, 2008 02:09:43 #1
 Tanu_shree   Member Since: September 2008    Total Comments: 1 

RE: Distance Vector Routing Algorithm
 
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.
     

 

Back To Question