Inscrivez-vous ou connectez-vous pour rejoindre votre communauté professionnelle.
Distance vector is a type of routing protocol which use Bellman–Ford algorithm, ford algorism to calculate the best path example of Distance vector routing protocol is RIP in distance vector protocol every router send periodic update to its neighbor about the network path it discover unlike link state Protocol which send update only when topology Changed and it is now not use quit often for large network since its low convergence time, todays popular link state OSPF, EIGRP
Routers use distance vector–based routing protocols to periodically advertise the routes in their routing tables. Routing information exchanged between typical distance vector–based routers is unsynchronized and unacknowledged