In computer communication theory relating to packet-switched networks, a distance-vector routing protocol is one of the two major classes of routing protocols, the other major class being the link-state protocol. Distance-vector routing protocols use the Bellman-Ford algorithm, Ford–Fulkerson algorithm, or DUAL FSM (in the case of Cisco Systems's protocols) to calculate paths.
A distance-vector routing protocol requires that a router informs its neighbors of topology changes periodically. Compared to link-state protocols, which require a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead.
The term distance vector refers to the fact that the protocol manipulates vectors (arrays) of distances to other nodes in the network.
Routers using distance vector protocol do not have knowledge of the entire path to a destination. Instead DV uses two methods:
- Direction in which or interface to which a packet should be forwarded.
- Distance from its destination.
Examples of distance-vector routing protocols include RIPv1 and RIPv2 and IGRP. EGP and BGP are not pure distance-vector routing protocols because a distance-vector protocol calculates routes based only on link costs whereas in BGP, for example, the local route preference value takes priority over the link cost.
Read more about Distance-vector Routing Protocol: Method, Example