JN0-363 Open Shortest Path First (OSPF)

Open Shortest Path First (OSPF) Detailed Explanation

Overview

OSPF (Open Shortest Path First) is a dynamic link-state routing protocol widely used in IP networks. It is designed for scalability, fast convergence, and efficient network utilization. Unlike distance-vector protocols (e.g., RIP), OSPF builds a complete map of the network topology and uses Dijkstra’s Shortest Path First (SPF) algorithm to calculate the best path to a destination.

Key Topics

1. Areas and Hierarchical Design

OSPF supports a hierarchical structure, which divides the network into logical segments called areas. This improves scalability, reduces overhead, and simplifies management.

• Backbone Area (Area 0):

  • The central area in OSPF.
  • All other areas must connect to the backbone, either directly or through a virtual link.
  • Responsible for distributing inter-area routes.

• Stub Area:

  • Does not receive external routes (e.g., routes from other routing protocols or redistributed routes).
  • Reduces the size of the routing table.
  • Instead of external routes, a default route (0.0.0.0) is used to forward traffic.

• Totally Stubby Area:

  • A stricter version of a stub area.
  • Only allows default routes from the backbone and blocks all external and inter-area routes.

• Not-So-Stubby Area (NSSA):

  • Permits some external routes (e.g., from a connected ASBR) while behaving like a stub area for other purposes.
  • Useful for integrating external routes without overwhelming the OSPF backbone.

Example of Area Design:

• A corporate network might have:
  • Area 0 (Backbone): Core routers and data center.
  • Area 1 (Stub): Branch offices.
  • Area 2 (NSSA): DMZ where external routes from a BGP-ASBR are injected.

2. Neighbor Relationship

OSPF routers form neighbor relationships to exchange routing information.

• How Routers Discover Neighbors:

  • Routers send Hello packets on OSPF-enabled interfaces.
  • The Hello packet includes:
    • Router ID (unique identifier for each router).
    • Hello and Dead intervals.
    • Area ID and authentication settings.

• Neighbor States:

  • The process of establishing an adjacency involves several states:
    1. Down: No Hello packets received.
    2. Init: Hello packet received, but the sender is not listed as a neighbor.
    3. 2-Way: Bi-directional communication established.
    4. Full: Routers exchange LSAs and have a synchronized database.

• DR and BDR Election:

  • On broadcast or multi-access networks (e.g., Ethernet), OSPF elects:
    • Designated Router (DR): Handles updates between neighbors.
    • Backup Designated Router (BDR): Takes over if the DR fails.
  • Election is based on the OSPF priority (default: 1). A higher priority wins.
  • If priorities are equal, the router with the highest Router ID is chosen.

Configuration Example:

set protocols ospf area 0.0.0.0 interface ge-0/0/1 priority 10

• Sets a higher priority to increase the chance of becoming the DR.

3. Link-State Advertisements (LSAs)

OSPF uses LSAs to exchange network topology information. LSAs are propagated within an area or between areas.

• Types of LSAs:

  1. Type 1: Router LSA:

     • Advertised by all routers within an area.
     • Contains information about directly connected links and interfaces.

  2. Type 2: Network LSA:

     • Generated by the DR.
     • Describes all routers connected to a multi-access network.

  3. Type 3: Summary LSA:

     • Generated by Area Border Routers (ABRs).
     • Advertises routes between areas.

  4. Type 4: ASBR Summary LSA:

     • Generated by ABRs to describe the location of an ASBR.

  5. Type 5: External LSA:

     • Generated by ASBRs to advertise external routes (e.g., routes from BGP).

LSA Flooding:

• LSAs are flooded to all routers in the same area.
• Routers use the SPF algorithm to calculate the shortest path for each LSA.

4. Cost Calculation

OSPF assigns a cost to each link to determine the shortest path. Cost reflects the link’s bandwidth.

• Cost Formula:

  Cost = Reference Bandwidth / Interface Bandwidth
  

  • Reference Bandwidth: Default is 100 Mbps.
  • Example:
    • A 100 Mbps link has a cost of 1.
    • A 10 Mbps link has a cost of 10.

• Adjusting Cost:

  • You can manually adjust the cost to influence OSPF’s path selection.

Configuration Example:

set protocols ospf area 0.0.0.0 interface ge-0/0/1 metric 10

• Sets the OSPF cost for the specified interface to 10.

5. Timers

OSPF uses timers to manage neighbor relationships and detect failures.

• Hello Timer:
  • Determines how often Hello packets are sent.
  • Default: 10 seconds (Ethernet) or 30 seconds (Non-broadcast).
• Dead Timer:
  • The time a router waits without receiving Hello packets before declaring a neighbor down.
  • Default: 40 seconds (4x Hello interval).

Configuration Example:

set protocols ospf area 0.0.0.0 interface ge-0/0/1 hello-interval 5
set protocols ospf area 0.0.0.0 interface ge-0/0/1 dead-interval 20

• Reduces the Hello interval to 5 seconds and Dead interval to 20 seconds.

6. Virtual Links

Virtual links allow connecting non-contiguous areas to the backbone (Area 0). They are used when:

• An area does not have a direct connection to Area 0.
• Temporary workarounds are needed during network reconfigurations.

Configuration Example:

set protocols ospf area 1 virtual-link 1.1.1.1

• Creates a virtual link through Area 1 to connect the router with Router ID 1.1.1.1 to the backbone.

7. OSPF Authentication

OSPF can authenticate Hello packets and LSAs to ensure security and integrity.

• Types of Authentication:
  1. Plain-Text Authentication:
     • Simple but insecure.
  2. MD5 Authentication:
     • A more secure option using a hash function.

Configuration Example (MD5):

set protocols ospf area 0.0.0.0 authentication md5
set protocols ospf area 0.0.0.0 interface ge-0/0/1 authentication-key securekey

• Enables MD5 authentication for Area 0 and sets the authentication key.

Open Shortest Path First (OSPF) (Additional Content)

Overview

OSPF is a link-state interior gateway protocol (IGP) designed for speed, scalability, and efficient route computation. It uses areas to optimize network performance and the Dijkstra SPF algorithm to compute shortest paths. Below are some additional essential details to better understand OSPF’s operational depth and to prepare for exam-level questions.

1. OSPF Router Types

In OSPF, routers are categorized based on their position in the topology and the type of routing information they handle. These roles are important for network design and OSPF behavior.

1.1 Internal Router

• All interfaces belong to the same area.

• Maintains a single link-state database for that area.

1.2 Backbone Router

• Has at least one interface in Area 0 (Backbone area).

• Responsible for inter-area communication within the OSPF hierarchy.

1.3 Area Border Router (ABR)

• Connects two or more OSPF areas, one of which must be Area 0.

• Maintains separate link-state databases for each connected area.

• Generates Type 3 and Type 4 LSAs to summarize and advertise routes between areas.

1.4 Autonomous System Boundary Router (ASBR)

• Redistributes routes from external sources (e.g., BGP, static routes) into OSPF.

• Generates Type 5 LSAs (or Type 7 in NSSA areas) to advertise external routes.

2. OSPF LSA Type 7 (NSSA External LSA)

While standard OSPF external routes are carried by Type 5 LSAs, Not-So-Stubby Areas (NSSAs) use a special LSA:

• Type 7 LSA is used by ASBRs within an NSSA to advertise external routes.

• ABRs connecting the NSSA to Area 0 translate Type 7 LSAs into Type 5 LSAs before flooding them into the rest of the OSPF domain.

NSSA areas use Type 7 LSAs to carry external routes, which are then translated into Type 5 LSAs by the ABR.

This mechanism preserves the stub-like nature of the NSSA while still allowing external route injection.

3. OSPF Route Types in the Routing Table

In Junos (and generally in OSPF implementations), different types of OSPF-learned routes are labeled to indicate their origin and type. These labels are visible using show route commands and can help identify the path type and decision-making process.

Route Type	Routing Table Tag	Description
Intra-Area	O	Routes learned within the same area
Inter-Area	O IA	Routes learned from another area via an ABR
External Type 1	O E1	External routes with internal OSPF cost considered
External Type 2	O E2	External routes where only external cost is considered (default)

Example:

inet.0: 15 destinations, 15 routes (15 active, 0 holddown, 0 hidden)
+ = Active Route, - = Last Active, * = Both

O        10.10.10.0/24 [110/5] via ge-0/0/1.0, Area 0.0.0.0
O IA     10.20.20.0/24 [110/20] via ge-0/0/2.0, Area 0.0.0.1
O E2     192.168.1.0/24 [150/1] via 10.1.1.2, Area 0.0.0.0

• O: intra-area

• O IA: inter-area (from another area via ABR)

• O E2: external (Type 2), originated from an ASBR

Summary of Additions

• OSPF Router Roles: Internal Router, Backbone Router, ABR, and ASBR have distinct responsibilities.

• Type 7 LSAs: Specific to NSSA areas, used by ASBRs and converted to Type 5 by ABRs.

• Routing Table Labels: Understanding O, O IA, O E1, O E2 is essential for route origin interpretation and troubleshooting.