An Exploration of Count-to-Infinity Problem in Networks
Now-a-days routing is the vital problem while forwarding information from one node to another node in networks. Routing algorithm can be classified as distance vector and link state. Among distance vector and link state routing, distance vector routing algorithm forwards the information to each and every node from and to its neighbors. The distributed Bellman-Ford algorithm is a well known example of distance-vector algorithm (RIP) which calculates the shortest path. RIP (Routing Information Protocol) is a widely-used protocol for managing router information within a Local Area Network (LAN) or an interconnected group of LANs. RIP is an Interior Gateway Protocol. Collecting and broadcasting the routing information may initiates count-to-infinity problem and routing loops.