Distance Vector routing
“Vector” of distances (signposts) to each possible destination at each router.
How to find distances ?
- Distance to local network is 0.
- Look in neighbors’ distance vectors, and add link cost to reach the neighbor
- Find which direction yields minimum distance to to particular destination. Turn signpost that way.
- Keep checking if neighbors change their signposts and modify local vector if necessary.
- And that’s it !
- Called the “Bellman-Ford algorithm”