Ospf
Ospf
Protocol
– Neighbor table:
• Also known as the adjacency database
(list of recognized neighbors)
– Topology table:
• Typically referred to as LSDB
(routers and links in the area or network)
• All routers within an area have an identical LSDB
– Routing table:
• Commonly named a forwarding database
(list of best paths to destinations)
OSPF vs. RIP
RIP is limited to 15 hops, it converges slowly, and it sometimes chooses
slow routes because it ignores critical factors such as bandwidth in route
determination. OSPF overcomes these limitations and proves to be a
robust and scalable routing protocol suitable for the networks of today.
OSPF Terminology
The next several slides explain various OSPF terms -
one per slide.
OSPF Term: Link
OSPF Term: Link State
OSPF Term: Area
OSPF Term: Link Cost
OSPF Term: Forwarding Database
OSPF Term: Adjacencies Database
OSPF Terms: DR & BDR
Link-State Data Structure:
Network Hierarchy
Router(config-router)#
network address inverse-mask area [area-id]
Router#
show ip ospf
Router#
show ip ospf neighbor [detail]
show ip route
show ip ospf neighbor detail