Open Shortest Path First (OSPF)
Open Shortest Path First (OSPF)
Link
RID
Neighbor
Area
Adjacency
Designated router
Backup Designated router
Hello protocol
Topological database
LSA
Neighbor and adjacency
initialization
LSA flooding
SPF tree calculation
Most people opt for OSPF, which works by using
the Dijkstra algorithm to initially construct a
shortest path tree and follows that by populating
the routing table with the resulting best paths
C D E
F G H
Area 1 Area 2 Area 3
Autonomous System
Hello?
224.0.0.5
Point-to-multipoint NA NA
10.1 20.1
Fa0/0 Fa0/0
SF LA
S0/0/0 S0/0/1
10.2 10.6
10.1 10.5
S0/0 S0/1
Corp Boulder
Fa0/0 Fa0/0
10.10.10.1 10.10.10.2
Adding a non-OSPF network
to LA router
OSPF Network
Fa0/0
Fa0/1
LA
The RID is not only used to advertise routes, its also used to elect the
designated router (DR) and the backup designated router (BDR). These
designated routers create adjacencies when a new router comes up and
exchanges LSAs to build topological databases.
Verifying OSPF Configuration
Show ip route
Show ip ospf
Show ip ospf database
Show ip ospf interface
Show ip ospf neighbor
Show ip protocols
OSPF and Loopback Interface
Loopback interfaces are logical
interfaces, which means theyre
virtual, software-only interfaces, not
actual, physical router interfaces.
A big reason we use loopback
interfaces with OSPF configurations is
because they ensure that an interface
is always active and available for
OSPF processes.
Configuring loopback
interface
SF#config t
SF(config)#int loopback 0
SF(config-if)#ip address 172.31.1.2
255.255.255.255