RIP
Routing Information Protocol (RIP) provides the standard IGP protocol for local area networks, and provides great network stability, guaranteeing that if one network connection goes down the network can quickly adapt to send packets through another connection. The following subsections describe how RIP was invented, how RIP works, and other RIP resources.
How RIP was invented. The Routing Information Protocol (RIP) was written by C. Hedrick from Rutgers University in June 1988, and has since become the most common Internet routing protocol for routing within networks.
RIP is based on the computer program “routed”, which was widely distributed with the Unix 4.3 Berkeley Software Distribution (BSD) operating system, and became the de-facto standard for routing in research labs supported by vendors of network gateways.
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.