Problem Statement
Explain how the Distance Vector Routing algorithm works.
Explanation
In Distance Vector Routing, each router maintains a table listing the shortest distance to every other node and the direction (next hop) to reach it. Routers exchange their tables periodically with neighbors and update routes using the Bellman-Ford algorithm. The simplicity makes it easy to implement but it suffers from slow convergence and routing loops. Protocols like RIP use this approach.