Distance Vector Routing Algorithm

Modern networks that use dynamic routing algorithms rather than the static routing algorithm can’t take the load of the line into consideration. Distance Vector Routing Algorithm is a dynamic routing algorithm. It is also sometimes called the Bellman-Ford Routing Algorithm and the Ford-Fulkerson Routing Algorithm.

In Distance Vector Routing, each router maintains a routing table indexed by and containing an entry for adjacent routers in the subnet. The entry contains two parts:

Preferred outgoing line to use for that destination.

An estimate of the time or the distance to that destination

← PreviousNext →