WELCOME TO OUR SEMINAR
PRESENTED BY
K. Arthi
C. Swathi
RIP PROTOCOL
• RIP stands for Routing Information Protocol in which distance
vector routing protocol is used for data/packet transmission.
• In the Routing Information Protocol (RIP), the maximum number of Hop is 15,
because it prevents routing loops from source to destination
• RIP (Routing Information Protocol) is poor and limited in size i.e. small network. The
main advantage of using RIP is it uses the UDP (User Datagram Protocol).
ROUTING METRICS
• Routing metrics are the values or criteria that routing
protocols use to compare and select the best routes among
Hop Count:
multiple options.
•RIP uses hop count as the metric.
•The maximum hop count by default is 15. Paths that are more than 15 hops away
are marked as unreadable.
Bandwidth:
The capacity of the link is known as a bandwidth of the link.
Delay:
It is a time taken by the router to process, queue and transmit a datagram to
an interface. The protocols use this metric to determine the delay values for all the
links along the path end-to-end.
Reliability:
Reliability is a metric factor may be composed of a fixed value.
Load:
Load refers to the degree to which the network resource such as a
router or network link is busy.
OSFP
• OSPF stands for Open Shortest Path First
which uses a link-state routing algorithm.
• Using the link state information which is available in routers, it
constructs the topology in which topology determines the
routing table for routing decisions.
• Since it uses Dijkstra’s algorithm, it computes the shortest path tree for
each route. The main advantage 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.
It is not a more intelligent It is a more intelligent routing
Difference Between RIP and OSPF dynamic routing protocol. protocol than RIP.
The networks are classified as
RIP Stands for Routing OSPF stands for Open The networks are classified as areas, sub-areas, autonomous
Information Protocol. Shortest Path First. areas and tables here. systems, and backbone areas
here.
RIP works on the OSPF works on
Its administrative distance is Its administrative distance is
Bellman-Ford algorithm. Dijkstra algorithm.
120. 110.
RIP uses
OSPF works for
It is a Distance Vector It is a link-state protocol and UDP(User Datagram Protocol)
IP(Internet Protocol) Protocol.
protocol and it uses the it analyzes different sources Protocol.
distance or hops count to like the speed, cost and path
determine the transmission congestion while identifying It calculates the metric in terms It calculates the metric in terms
path. the shortest path. of Hop Count. of bandwidth.
In RIP, the whole routing table
In OSPF, parts of the routing
is to be broadcasted to the
It is used for smaller size It is used for larger size table are only sent when a
neighbors every 30 seconds by
organizations. organizations in the network. change has been made to it.
the routers.
It allows a maximum of 15 There is no such restriction on RIP utilizes less memory OSPF device resource
hops. the hop count. compared to OSPF but is CPU requirements are CPU intensive
intensive like OSPF. and memory.
It consumes more bandwidth
because of greater network It consumes less bandwidth as
resource requirements in only part of the routing table is
sending the whole routing to send.
table.
Its multicast address is OSPF’s multicast addresses are
224.0.0.9. 224.0.0.5 and 224.0.0.6.
DIAGRAM:
