Differences between RIP and OSPF
Routers running RIP exchange the contents of the
routing tables with each of its neighbours, not with all
routers. This happens by default every 30 secs. Leads
to heavy network traffic.
Every RIP router knows the next ho
p router to all
reachable networks, plus a hop count to each network.
It does not know the topology/interconnection of the
network beyond the next hop router.
RIP routers suffer from slow convergence.
A hop count is the only metric maintained.
RIP v 1 does
not support subnetting or the use of
CIDR. RIP v 2 does.
Routers running OSPF exchange messages with all
other routers in the Autonomous System to which it
belongs. Those messages contain information
regarding the state of its local links. I.e either
down, IP addresses, masks etc
OSPF routers build up a database of network topology
information. From this they build a tree diagram to
show routes to every other reachable network. Then
calculate the shortest path, based on a variety of
metrics. Can derive
a ‘shortest path’ based on
reliability, bandwidth, distance, security, cost etc.
Once data base is synchronized, messages are sent
only on topology change detection.
Requires considerable calculation to synchronize the
databases. After that, in the absenc
e of topology
changes, low overhead.