Distance Vector Routing
Example
At the beginning, each router only knows the distance to its directly connected neighbors, thus all other path are marked as . In the propagation process, we follows:
- each router maintains its own distance vector table
- each router can only update its own distance vector row (as marked in gray)
- other entries can ONLY be updated when receiving distance vectors from neighbors
In the next time step, each router will propagate its distance vector to its neighbors, take router as an example, it receives distance vectors from router and and update its own distance vector row:
Also, router should re-calculate the distance to each destination based on the received distance vectors:
And thus the updated distance vector table at router is: