Distance Vector Routing
a.k.a. Distance-vector routing
Key Points
- Routers exchange route metrics with neighbors
- Uses iterative updates to build routing knowledge
- Simple to implement but sensitive to convergence issues
- Common in classic routed networks
- Depends on neighbor-based metric exchange and iterative convergence
- Susceptible to routing loops and count-to-infinity behavior
Definition
Distance Vector Routing is a routing method in which routers share distance information with neighbors to reach destinations, building routes iteratively based on advertised metrics.
Concept
Distance Vector Routing is a fundamental routing approach used to exchange route cost and next-hop information between neighboring routers. It provides a simpler alternative to topology-wide path computation. Each router advertises to its neighbors the distance or metric to known destinations. The method depends on iterative convergence as routers share updated path information until the network reaches a stable state.
Explainer
Distance Vector Routing works by having each router repeatedly exchange route summaries with neighbors and update next-hop choices until the network converges on a stable view. It is used in routed networks, especially in environments where simplicity and low administrative overhead are important. Key constraints include convergence speed, susceptibility to routing loops, bounded metric design, and limited visibility into full topology. Failure modes include count-to-infinity behavior, route loops, slow convergence after failures, and stale neighbor information. Tradeoffs involve simplicity versus scalability, low control-plane overhead versus slower recovery, and reduced topology knowledge versus easier implementation. Distance Vector Routing matters because it represents a core routing model that explains how many internal network protocols learn and maintain paths. Cross-industry relevance is broad across enterprise networking, service provider systems, industrial communications, and any routed infrastructure that values incremental neighbor exchange.