Distance Vector Routing Algorithm

Distance Vector Routing Algorithm, also called the Bellman-Ford algorithm, is a routing algorithm in which every router maintains a database with one entry for each possible destination on the network.