Routing information protocol updating algorithm

All RIP routing protocols are based on a distance vector algorithm called the Bellman-Ford algorithm, after Bellman's development of the equation used as the basis of dynamic programming, and Ford's early work in the area.

Software based on these algorithms was used as early as 1969 on the ARPANET, but the main protocol development was done by the Xerox network research and development division. Gallaher proved the RIP algorithm converged to the best estimates of distance to each destination address.

At issue here is the fact that if updates are sent too frequently, congestion may occur; if updates are sent too infrequently, convergence time may be unacceptably high.Dynamic routing protocols not only perform these path determination and route table update functions but also determine the next-best path if the best path to a destination becomes unusable.The capability to compensate for topology changes is the most important advantage dynamic routing offers over static routing.RIP uses a distance vector algorithm to decide which path to put a packet on to get to its destination.It stores in its routing table the distance for each network it knows how to reach, along with the address of the "next hop" router -- another router that is on one of the same networks -- through which a packet has to travel to get to that destination.