OSPF Fundamentals
OSPF Fundamentals
OSPF Overview:
OSPF is a link-state routing protocol designed to efficiently manage routing information within an
Autonomous System (AS). It operates based on the Link State Database (LSDB), where routers
share information about their connected links. OSPF routers use the SPF algorithm to calculate the
shortest path to reach each destination, with the metric being the "Cost" based on link bandwidth.
Hierarchical Structure:
OSPF organizes networks into a hierarchical structure, dividing them into areas. This hierarchical
design enhances scalability and reduces the complexity of routing information exchanges. Routers
within an area have detailed knowledge of the area's topology, while a summary of that information
is sent to routers in other areas.
OSPF Configuration:
Enabling OSPF:
1. Router Configuration:
1. Unique Identification:
• The Router ID can be manually assigned using the router-id [router-id] command or
can be automatically assigned based on the highest IP address of any of the router's
active interfaces.
1. Interface Configuration:
• Enable OSPF on the interface with the ip ospf [process-id] area [area-id]
command.
1. Neighbor Discovery:
DR Election Process:
• In OSPF, on broadcast networks like Ethernet, the DR and BDR are elected.
• Election is based on the router's priority, with the highest priority becoming the DR.
If priorities are tied, the router with the highest Router ID is chosen.
Benefits:
1. Reducing Adjacencies:
• This minimizes the amount of OSPF routing information exchanged on the network.
Metric Calculation:
1. Cost Calculation:
• OSPF routers calculate the cost of a route based on the bandwidth of the links.
• The SPF algorithm then determines the shortest path based on the accumulated
cost.
Types of Routes:
• External Routes come from external sources and are redistributed into OSPF.
Summarization of Routes:
Benefits:
#sh ip protocols