Explain what the count-to-infinity problem is with distance vector routing?

I am not too good with the details yet but here is what I know...

In the distance vector routing algorithm, when the link cost for any link drops this good news travels very fast. But when the link cost for any link increases, this bad news takes many iterations of the algorithm to travel. This problem that the distance vector algorithm has with propagation of bad news is called the count to infinity problem. When I learn more about the details of this, I would come back to this page and add more details.

oh btw, I found this great link for a short explanation See related links

You might also want to check out poison-reverse and horizon-splitting