Methodology to Solve the Count-To-Infinity Problem by Accepting and Forwarding Correct and Updated Information Only Using "Test" Packet

An Effective Solution to Count-to-Infinity Problem for both Complex and Linear Sub-Networks

“…The metric is referred to as a count or a distance. In the Distance vector, the process of exchanging information is done iteratively [1]. There is no information exchange between the neighbourhoods until the information received from at least one neighbour directly and the algorithm does not require all the neighbours are asynchronous with each other.…”

“…For periodic routing updates, the convergence time is slow. The slow convergence leads to count-to-infinity and routing loops problem [1].…”

“…The distance vector routing algorithm suffers from the count-to-infinity problem. Count-to-infinity problems can be solved by preventing loops [9][8] [1]. Researchers tried to prevent them by using various ways.…”

“…For error handling it will checksum. To solve the count to infinity, they design this type of test packet [1].…”

“…So, a better network means less packet loss. Distance Vector Routing is one of the dynamic algorithms [1]. Whenever a router goes down, routing loops usually occur in DVR.…”