Explain distance-vector and link-state routing and compare/contrast them. Discuss their strengths and weaknesses.© BrainMass Inc. brainmass.com March 21, 2019, 7:56 pm ad1c9bdddf
Distance-vector and link-state routing are two different categories of dynamic routing protocols. Distance-vector protocols find the best path to a remote network by judging distance using the Bellman-Ford algorithm. Each time a packet goes through a router or host, that is considered a hop. The route with the least number of hops to the destination network is determined to be the best route. The vector indicates the interface through which traffic will be forwarded to reach the remote network, and routers send their entire routing tables to directly connected neighbors. Both RIP (Routing Information Protocol) and IGRP (Interior Gateway Routing Protocol) are distance-vector routing ...
Provides a discussion comparing and contrasting distance-vector and link-state routing.