The full form of RIP is Routing Information Protocol, and is one of the ancient distance-vector routing protocols. It employs the hop count as a routing metric. By executing a limit on the number of hops enabled in the path from source to destination, RIP stops the routing loop. It implements route poisoning, split horizon, and hold-down mechanisms to avoid false routing information from being broadcast.
Expansion of Distance Vector Routing Protocols
Distance vector routing executed from 1960 onwards in data networks such as CYCLADES and ARPANET, dependent on the Ford-Fulkerson Algorithm and the Bellman-Ford Algorithm. The ancestor of rip was the GWINFO (Gateway Information Protocol) formed in the mid-1970s by Xerox to broadcast its temporary network.
How does it work?
Routing Information Protocol uses distance vector algorithms to choose which path an envelope has to take to reach its destination. In all RIPs, there is a routing table that contains a list of all the destinations the router knows to reach. Each router traverses its entire table from its close to the nearest one every 30 seconds. In turn, the closest ones send information to their nearest router until all hosts on the network have the same routing path message.
Version