IP Addressing and Routing

Explain RIP and OSPF routing algorithm.

• RIP stands for Routing Information Protocol.
• It is a standardized Distance Vector protocol, which is designed for smaller networks.
• It is one of the first widely deployed routing protocols.
• It is supported on a wide variety of systems.
• This protocol uses a Bellman-Ford Distance Vector algorithm.

• It supports IP and IPX routing.
• It utilizes UDP port 520.
• It has a maximum hop count of 15 hops.
• RIP routes have an administrative distance of 120.

• It sends out periodic routing updates and tables at every 30 seconds.
• It uses a form of distance as its metric, that is hop count.
• It uses the Bellman-Ford Distance Vector algorithm to determine the best path to a particular destination.

• The network is restricted to 15 hops in order to solve the 'count to infinity' problem.
• The periodic routing table consumes bandwidth and the convergence is slow.

• OSPF stands for Open Shortest Path First.
• It was developed by the IETF (Internet Engineering Task Force).
• It is used as a replacement to overcome the shortcomings of RIP in RFC 2328.
• This routing algorithm is vendor independent.
• It uses Dijkstra routing algorithm and utilizes Internet Protocol (IP).
• OSPF routes have an administrative distance of 110.
• The network is unrestricted, there is no limitation for hop count.
• OSPF supports IPv4 and IPv6 network protocols.

• OSPF is the highest performance open standard routing protocol.
• It is a classless routing protocol.
• It provides shortest path routing.
• It is fast to fault-recovery and rerouting.
• It consumes minimal link overhead when the network is in steady state.
• It is a much more advanced routing protocol than any other Interior Gateway Protocol.

• OSPF demands higher processing and memory requirement than RIP.
• It consumes a large bandwidth at the initial link-state packet flooding.