Count to Infinity Problem in Distance Vector Routing

For Complete YouTube Video: Click Here

In this class, we will try to understand the concept of Count to Infinity Problem in Distance Vector Routing.

We have already covered the concept of Routing loops in our previous class.

Understanding the concept of routing loops is very important for understanding what we discuss in this class.

Count to Infinity Problem in Distance Vector Routing

Consider the example we thought of in our previous class to understand this concept.

The image below describes the problem of Routing Loops.

The above image states that C can transmit its data to D through B, B can transmit its data to D through A, and A can send its data to D through B.

At A and B, a loop happens.

As we have discussed, the distance vectors are periodically exchanged between the immediately connected nodes distance vectors will continue to increment to infinity for each periodic exchange.

The image below shows the count to infinity problem clearly.