Count to Infinity Problem is solved using Split Horizontal:
Count to Infinity Problem : Problem with distance vector routing is whenever a link is broken , other routers unknowingly given information that they know how to reach a disconnected node. This false information will propagate to all routers . This problem is known as count to infinity.
and solution to this problem is split horizon with poison reverse technique(used by RIP to reduce the chance of forming loops and uses maximum number of hop counts to counter the problem.)
Split horizons states that if a neighboring router sends a route to a router , the receiving router will not propagate this route back to the advertising router on the same interface.
Split horizon with poison reverse is a variant of split horizon route advertisement in which a router actively advertises routes as unreachable over the interface over which they were learned by setting the route metric to infinite. The effect of such an announcement is to immediately remove most looping routes before they can propagate through the network.
Limitations in this is it can significantly increase the size of routing announcements in certain fairly common network topologies but it allows for the improvement of overall efficiency of network in case of faults.
