Distance Vector Routing: Count to Infinity and Routing Loops - dummies

Distance Vector Routing: Count to Infinity and Routing Loops

By Edward Tetz

Networks using distance-vector routing are susceptible to loops and issues with count to infinity. How does this problem develop? In the following illustration, everything is working fine on the network, and the network is converged.

Problems can happen with your routing protocol when a link or a router fails. In this figure, a failure happens on Router3 with interface fa0/0. When this link goes down, the route to is no longer available; however, if you look at what follows, you can see the issue.

  1. Router3 initially marks the route to as a link down in its routing table.

  2. Router2 sends out its routing table to each of its neighbors.

    This includes Router3, telling them that it has a path to with a hop count of 1.

  3. Router3 then updates its routing table with this new information.

    The new information states that the route to is now 2 hops away, as shown in Figure 6-3.


  4. Armed with the new information that is available.

    Albeit through another interface, Router3 sends out its routing table to its neighbors.

  5. Router2 gets the update.

    It then identifies that the router that previously said it knew about has updated the route from a hop count of 0 to 2, so Router2 updates its own routing table. The old route may have been identified as an updated route, or it may have timed out of the routing table, depending on the routing protocol that is in use.

  6. Router2 then passes its own routing information out through its other interface (S0/0) to propagate the change to Router1.


  7. Router3 eventually receives the update from Router2.

    This update tells Router2 that the hop count to has been updated to 3, and this process now continues.

This process continues to infinity because no mechanism is in place, in this case, to stop the process from continuing.

However, the RIP routing protocol has a built-in safety mechanism, to a degree. RIP has a maximum hop count of 16, and when the route to a network exceeds the 16-hop rule, the RIP protocol marks that network as unreachable so that it does not further propagate the route. This scenario does not change the information found in the router’s routing table — it only limits how far the error is propagated.

When you send data to a host or device on the network, it comes through the fa0/0 interface on Router1 and Router1 thinks that it can get to within 4 hops by sending the data out through interface S0/0 based on Router1’s routing table. The following figure shows what happens when the data is sent.

As it arrives at Router3, Router3 determines that the route to is back through Router2, which then causes the data to loop infinitely. There is a Time to Live (TTL) on IP packets, which defines the maximum amount of time which an IP packet can remain on a network. After spending some time looping, the data will be dropped from the network and a message sent back to the sender of the data.