Distance Vector Routing: Explaining the Example Step-by-Step

Distance vector routing is a distributed routing method where each router maintains, for every destination, a distance (metric) and a next hop. Routers periodically exchange their distance vectors with neighbors, and update their own tables using the neighbors’ advertised distances. This process is closely related to the Bellman–Ford shortest-path principle. 2

In a typical distance vector algorithm, if router $X$ has neighbor $Y$, then for destination $d$:

$$D_X(d) = \min_{Y \in \text{neighbors}(X)} \left\{ c(X,Y) + D_Y(d) \right\}$$

where:

• $D_X(d)$ is router $X$’s current best distance to destination $d$,
• $c(X,Y)$ is the link cost from $X$ to $Y$,
• $D_Y(d)$ is router $Y$’s advertised distance to destination $d$. 2

Below, I walk through how you explain (and compute) distance vector routing on the given diagram by identifying the nodes, listing initial distances, then iterating table exchanges until values stabilize.

Key learning terms:

• Distance vector
• Next hop
• Bellman–Ford
• Count-to-infinity
• Split horizon

Note on the example image: The exact numeric costs and topology specifics must be read from the diagram. In the steps below, I show the general computation procedure and the table update logic you apply to the nodes shown (the method is identical regardless of whether costs are 1, weights, etc.). You can plug in the link costs and destination labels exactly as in your figure.

Footnotes

1. Routing Information Protocol (RIP) — Wikipedia - Describes distance vector basics and how RIP uses distance vectors and periodic exchanges. ↩ ↩²

2. Bellman–Ford algorithm — Wikipedia - Provides the iterative relaxation principle underlying shortest paths used in distance-vector contexts. ↩ ↩²

1) Interpret the topology in the diagram

Start by labeling routers (nodes) as they appear in your figure (for example, commonly letters like A, B, C, …). Identify:

1. Which nodes are directly connected (edges).
2. The cost of each directly connected link $c(X,Y)$ (often shown as numbers on the links).

Then, for distance vector routing, each router $X$ maintains a table:

• Destination: every node in the network (including itself).
• Distance: current best estimate.
• Next hop: neighbor used to achieve that estimate.

A compact table representation for a router $X$ looks like:

Distance vector routing computes shortest paths by repeated updates that use neighbor information. 2

Footnotes

1. Routing Information Protocol (RIP) — Wikipedia - Describes distance vector basics and how RIP uses distance vectors and periodic exchanges. ↩

2. Bellman–Ford algorithm — Wikipedia - Provides the iterative relaxation principle underlying shortest paths used in distance-vector contexts. ↩

2) The core update rule you must explain

For any router $X$ and destination $d$, distance vector routing uses:

$$D_X(d) = \min_{Y \in N(X)} \{ c(X,Y) + D_Y(d) \}$$

and the next hop is the neighbor $Y$ that attains the minimum.

This is the essential “explain the algorithm” part: show that the router’s best distance to $d$ is computed by trying each neighbor as the first step, then using what that neighbor already knows about reaching $d$. 2

A helpful mini-visual (conceptual) of the exchange is:

Footnotes

1. Routing Information Protocol (RIP) — Wikipedia - Describes distance vector basics and how RIP uses distance vectors and periodic exchanges. ↩

2. Bellman–Ford algorithm — Wikipedia - Provides the iterative relaxation principle underlying shortest paths used in distance-vector contexts. ↩

3) How to narrate the iteration using the example diagram

A strong exam-style explanation is to do the following for each round:

1. State the round: “In Round 1, routers exchange their initial vectors.”

2. Identify which destinations can improve: Only destinations within one additional hop from known neighbors can become finite.

3. Compute one or two representative destination updates:
   Example phrasing:

   • “Router $X$ receives neighbor $Y$’s estimate for destination $d$.”
   • “It computes $c(X,Y)+D_Y(d)$.”
   • “If that is smaller than its current $D_X(d)$, it updates both distance and next hop.”

4. Repeat until convergence: After enough rounds equal to the network’s effective diameter (in hops), no better routes appear.

Distance vector routing is known to converge when there are no negative cycles (for the classic Bellman–Ford framing). In standard routing contexts with nonnegative link costs, it converges to shortest paths; failures and loops can still cause transient incorrectness. 2

Footnotes

1. Routing Information Protocol (RIP) — Wikipedia - Describes distance vector basics and how RIP uses distance vectors and periodic exchanges. ↩

2. Bellman–Ford algorithm — Wikipedia - Provides the iterative relaxation principle underlying shortest paths used in distance-vector contexts. ↩

4) Split horizon / poison reverse (often required in “explain DV” questions)

Many curricula require mentioning loop-prevention techniques:

• Split horizon
• Poison reverse
• Loop-free convergence

These techniques aim to prevent a router from telling a neighbor about a route that the neighbor might have used to reach the router in the first place—reducing the likelihood of loops and count-to-infinity behavior.

Footnotes

1. Split horizon — Wikipedia - Explains split horizon (and related loop prevention concepts) used in distance vector routing to mitigate routing loops. ↩

5) (Optional) Visualize “hop-by-hop” distance propagation

Even without plugging exact numeric costs from the image, you can explain propagation qualitatively:

Each iteration allows routers to learn paths that are longer by one hop, because routers base their computations on neighbors’ current estimates. 2

Footnotes

1. Routing Information Protocol (RIP) — Wikipedia - Describes distance vector basics and how RIP uses distance vectors and periodic exchanges. ↩

2. Bellman–Ford algorithm — Wikipedia - Provides the iterative relaxation principle underlying shortest paths used in distance-vector contexts. ↩