Distance Vector protocols are the simplest amoung Routing Protocols. Distance vector routing protocols use the distance and direction (vector) to find paths to destinations. Distance Vector protocols use the Bellman-Ford algorithm for finding paths to destinations.

Routers running Distance Vector protocols learn who their neighbours are by listening for routing broadcasts on their interfaces. Distance Vector protocols periodically send local broadcasts (255.255.255.255) to share routing information.

Distance Vector algorithms pass routing table updates to their immediate neighbors in all directions. At each exchange, the router increments the distance value received for a route, thereby applying its own distance value to it. The routerwho received this update again pass the updated table further outward, where receiving routers repeat the process.

The Distance Vector protocols do not check who is listening to the updates which they sent and Distance Vector protocols broadcast the updates periodically even if there is no change in the network topology.

Distance Vector protocols are the simplest among three types of dynamic routing protocols. They are easy to set-up and troubleshoot. They require less router resources. They receive the routing update, increment the metric, compare the result to the routes in the routing table, and update the routing table if necessary.