1. Routing Information Protocol (RIP) :
RIP stands for Routing Information Protocol in which distance vector routing protocol is used for data/packet transmission. In Routing Information protocol (RIP), the maximum number of Hop is 15, because it prevents routing loops from source to destination. Mechanism like split horizon, route poisoning and holdown are used to prevent from incorrect or wrong routing information. Sally Floyd and Van Jacobson  suggest that, without slight randomization of the timer, the timers are synchronized overtime. Compared to other routing protocol, RIP (Routing Information Protocol) is poor and limit size i.e. small network. The main advantage of using RIP is it uses the UDP (User Datagram Protocol).
2. Open Shortest Path First (OSPF) :
OSPF stands for Open Shortest Path First which uses link-state routing algorithm. Using the link state information which is available in routers, it constructs the topology in which the topology determines the routing table for routing decisions. It supports both variable-length subnet masking and classless inter-domain routing addressing models. Since it uses Dijkstra’s algorithm, it computes the shortest path tree for each route. The main advantages of the OSPF (Open Shortest Path first) is that it handles the error detection by itself and it uses multicast addressing for routing in a broadcast domain.
Difference Between RIP and OSPF
|1||RIP Stands for Routing Information Protocol.||OSPF stands for Open Shortest Path First.|
|2||RIP works on Bellman Ford algorithm.||OSPF works on Dijkstra algorithm.|
|3||It is a Distance Vector protocol and it uses the distance or hops count to determine the transmission path.||It is a link state protocol and it analyzes different sources like the speed, cost and path congestion while identifying the shortest path.|
|4||It is basically use for smaller size organization.||It is basically use for larger size organization in the network.|
|5||It allows a maximum of 15 hops.||There is no such restriction on the hop count.|
|6||It is not a more intelligent dynamic routing protocol.||It is a more intelligent routing protocol than RIP.|
|7||The networks are classified as areas and tables here.||The networks are classified as areas, sub areas, autonomous systems and backbone areas here.|
|8||Its administrative distance is 120.||Its administrative distance is 110.|
|9||RIP uses UDP(User Datagram Protocol) Protocol.||OSPF works for IP(Internet Protocol) Protocol.|
|10||It calculates the metric in terms of Hop Count.||It calculates the metric in terms of bandwidth.|
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Difference between RIP and EIGRP
- Difference between RIP and IGRP
- Difference between Border Gateway Protocol (BGP) and Routing Information Protocol (RIP)
- Difference between OSPF and BGP
- Difference between EIGRP and OSPF
- Difference between OSPF and IGRP
- Routing Information Protocol (RIP)
- Routing Information Protocol (RIP) V1 & V2
- Open shortest path first (OSPF) router roles and configuration
- Open Shortest Path First (OSPF) Protocol fundamentals
- Open Shortest Path First (OSPF) protocol States
- Open shortest path first (OSPF) - Set 2
- Difference and Similarities between PHP and C
- Difference between Stop and Wait, GoBackN and Selective Repeat
- Difference between Stop and Wait protocol and Sliding Window protocol
- Similarities and Difference between Java and C++
- Difference between Yaacomo and and XAP
- Difference between VoIP and and POTS
- Difference between ++*p, *p++ and *++p
- Difference Between DOS and Windows
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.