Scribd
Upload
64 views9 pages

OSPF (Open Shortest Path F Irst) : What Is A Interior Gateway Protocol?

OSPF is an interior gateway protocol that uses the Dijkstra shortest path first algorithm to calculate the best path through a network topology to each destination. It operates within a single autonomous system and each router advertises its own link state information, which is then flooded to other routers. OSPF is hierarchical, with networks broken into areas to reduce routing information and make it scalable for larger networks.

Uploaded by

duranduran11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
64 views9 pages

OSPF (Open Shortest Path F Irst) : What Is A Interior Gateway Protocol?

OSPF is an interior gateway protocol that uses the Dijkstra shortest path first algorithm to calculate the best path through a network topology to each destination. It operates within a single autonomous system and each router advertises its own link state information, which is then flooded to other routers. OSPF is hierarchical, with networks broken into areas to reduce routing information and make it scalable for larger networks.

Uploaded by

duranduran11
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

OSPF ( Open Shortest Path First)

Open Shortest Path First (OSPF) is a dynamic routing protocol that uses a link state
algorithm (Dijkstra), as opposed to protocols (such as RIP) that use a distance vector
algorithm It is an interior gate!ay protocol (I"P) and operates in a single
autonomous system (#S) In OSPF, each router advertises the state o$ its o!n links,
or connections, in a link state advertisement (%S#), !hich it then multicasts to other
routers on the net!ork In addition, each router uses the %S#s it receives $rom other
routers to construct a graph that represents the net!ork topology &o 'uild its
routing ta'le, the router applies Dijkstra(s Shortest Path First algorithm to $ind the
'est path through the graph to each net!ork in the topology &his )shortest path
tree* 'ecomes the 'asis o$ the routing ta'le OSPF is hierarchical In OSPF, the
net!ork is 'roken up into )areas* +ithin each area, routers possess only local
routing in$ormation Routing in$ormation a'out other areas is calculated using
summari,ed routes e-changed 'et!een areas &his reduces the amount o$ net!ork
topology in$ormation routers have to generate and maintain, making OSPF a good
choice $or larger net!orks
What is a Interior Gateway Protocol?
#n interior gate!ay protocol (I"P) is a routing protocol that is used to e-change routing in$ormation
!ithin an autonomous system (#S)
What is a Autonomous System?
#n Autonomous System (AS) is a collection o$ connected Internet Protocol (IP) routing pre$i-es
under the control o$ one or more net!ork operators that presents a common, clearly de$ined routing
policy to the Internet
Configuring OSPF
Sample con$iguration $or OSPF &he con$iguration e-ample is
'ased on the diagram in the Figure 'elo!
.ou !ill no! con$igure OSPF on the routers la'eled R/, R0, and R1 in the
re$erence net!ork diagram &he routers are advertising their routes on net!orks
/22322403 and /22522403
&his e-ample assumes that you have already con$igured the router inter$aces
(including the loop'ack inter$aces 6 lo)7 only the steps re8uired to implement OSPF
are sho!n
&o create a 'asic OSPF con$iguration, per$orm the $ollo!ing steps in con$iguration
mode9
OSPF Commans
OSPF Area Commans
OSPF Interface Commans

You might also like