Difference Between RIP and OSPF ?

RIP OSPF
RIP Stands for Routing Information Protocol. OSPF stands for Open Shortest Path First.

RIP works on the Bellman-Ford algorithm. OSPF works on Dijkstra algorithm.

It is a Distance Vector protocol and it uses the distance or hops count to It is a link-state protocol and it analyzes different sources like the speed, cost and
determine the transmission path. path congestion while identifying the shortest path.

It is used for smaller size organizations. It is used for larger size organizations in the network.

It allows a maximum of 15 hops. There is no such restriction on the hop count.

It is not a more intelligent dynamic routing protocol. It is a more intelligent routing protocol than RIP.

The networks are classified as areas, sub-areas, autonomous systems, and

The networks are classified as areas and tables here.
backbone areas here.

Its administrative distance is 120. Its administrative distance is 110.

RIP uses UDP(User Datagram Protocol) Protocol. OSPF works for IP(Internet Protocol) Protocol.

It calculates the metric in terms of Hop Count. It calculates the metric in terms of bandwidth.

In RIP, the whole routing table is to be broadcasted to the neighbors every 30 In OSPF, parts of the routing table are only sent when a change has been made to
seconds by the routers. it.

RIP utilizes less memory compared to OSPF but is CPU intensive like OSPF. OSPF device resource requirements are CPU intensive and memory.

It consumes more bandwidth because of greater network resource requirements

It consumes less bandwidth as only part of the routing table is to send.
in sending the whole routing table.

Its multicast address is 224.0.0.9. OSPF’s multicast addresses are 224.0.0.5 and 224.0.0.6.
Difference Between BGP and RIP ?

S. No. Border Gateway Protocol Routing Information Protocol

1. BGP stands for Border Gateway Protocol. RIP Stands for Routing Information Protocol.

2. It initially came in the year 1989. It was defined in the year 1988.
3. It works on Best path algorithm. RIP works on Bellman Ford algorithm.

4. It is basically used for very larger size organizations as compared to RIP. It is basically used for smaller size organizations.

5. It is an external gateway protocol. It is an industry standard dynamic routing protocol.

6. It is a more intelligent routing protocol than RIP. It is not a very intelligent dynamic routing protocol.

The networks are classified as areas, sub areas, autonomous systems

7. The networks are classified as areas and tables.
and backbone areas.

8. It calculates the metric in terms of Hop Count. It calculates the metric in terms of Hop Count.

9. It is hybrid type. It is a Vector State type.

10. There is no such restriction on the hop count. It allows a maximum of 15 hops.

11. It has design type- Fully meshed. It has design type- Flat network.

It consumes more bandwidth for two purposes-

It consumes more bandwidth because of the sending of whole routing
12. •learning routes from connected autonomous systems (AS)
table after every 90s (by default)
•update bursts