OSPF Routing Protocol Principle

V2.1

Outline
Through learning this course, you will: Master computing methods of OSPF routing protocol Master advanced applications of OSPF routing protocol

Contents

OSPF Overview OSPF Concept OSPF Working Process Area Allocation LSA Transmission among Multiple Areas Route Optimization

OSPF Overview

Open Shortest Path First (OSPF) OSPF is Internal Gateway Protocol (IGP).
OSPF is a kind of link-state protocol, it maintains complex network topology database and then adopts SPF algorithm to calculate the best route.

The types of network supported by OSPF are classified into multi-access network and point-to-point network.

OSPF Advantages

No route loop Adapt to large-scale network High convergence rate of route Support area allocation Support equivalent route Support verification Support hierarchic management Transmit protocol messages in multicast address

Contents

OSPF Overview OSPF Concept OSPF Working Process Area Allocation LSA Transmission among Multiple Areas Route Optimization

OSPF Concept (1)

Router ID

Definition: 32-bit binary to identify each router on OSPF network. Selection method: SelecteThe IP address of the interface which is activated firstly. If multiple interfaces are activated, the minimum IP address of the router is selected on the ZTE router. If loopback interface is configured on the router, router ID will be the minimum IP address of all loopback interfaces, in spite of IP addresses of other physical interfaces or even when they are activated. Features: Hi, I am router A and my name is Globally unique; 192.132.1.3. Once selected, it cannot be changed unless OSPF progress is restarted.
ZXR10# clear ip ospf process <process-id>

OSPF Concept (2)

Interface

Interfaces run OSPF protocol; transmit protocol messages periodically (Hello packet) to search and find neighbors. Designated Router (DR) and Backup Designated Router (BDR) To reduce traffic of OSPF synchronous link state information, broadcast network can be automatically represented as DR or BDR according to interface priority or router-id.

Link State Database

Contains link state of all routers on the network and indicates the topology structure of the whole network.

Neighboring Routers
OSPF routers on the direct network become neighbors automatically after exchanging hello packets.

Adjacency
On the basis of neighbors, Link State Advertisement (LSA) is synchronized to form adjacency.

OSPF Working Process (1)

Run OSPF protocol and find neighbors;

Exchange LSA, synchronize Link State Database (LSDB), and form adjacency; Use SPF algorithm to establish the shortest path tree and calculate the best route.

OSPF Working Process (2)

Autonomous system

Interfaces start OSPF

Neighbor table

Topology database

Route table

Contents

OSPF Overview OSPF Concept OSPF Working Process Finding Neighbors Selecting DR or BDR Forming Adjacency Updating LSA Computing Optimal Route Area Allocation LSA Transmission among Multiple Areas Route Optimization

Neighborhood
D
E

Hello

afadjfjorqpoeru 39547439070713

Hello

Router ID Hello/dead intervals Neighbors Area-ID Router priority DR IP address BDR IP address Authentication password Stub area flag

Interfaces run OSPF send periodically Items with *which must be consistent to establish neighbors

NeighborhoodHello Message

Process of Forming OSPF Neighbor List

Lo: 10.75.0.1

10.75.32.1/30 Int1

Lo: 10.75.0.2 10.75.32.2/30 B Int1

RB Neighbors List 10.75.0.1, int1, 10.75.0.1, int1 ,2-way init
Down State

RA Neighbors List 10.75.0.2, int1 , 2-way

Hello, my router ID is 10.75.0.1 and see no neighbors.

Init State

Hello, my router ID is 10.75.0.2 and my neighbor is 10.75.0.1.

Two-way

Hello, my router ID is 10.75.0.1 and my neighbor is 10.75.0.2.

Contents

OSPF Overview OSPF Concept

OSPF Working Process

Finding Neighbors Selecting DR or BDR Forming Adjacency Updating LSA Computing Optimal Route Area Allocation LSA Transmission among Multiple Areas Route Optimization

LSA Synchronization on Broadcast Network

Neighbor, receive my LSA.

On broadcast network or NBMA, resource will be wasted when each neighbor transmits LSA (network bandwidth and CPU resources).

Functions of DR and BDR

DR

BDR

To reduce traffic of OSPF protocol messages, each network segment uses DR or BDR to represent the network. Each router can synchronize LSA with DR and BDR to form adjacency.

Selection of DR and BDR

P=3 P=2

DR

BDR

Hello

P=1

P=1

P=0

The router that is started first on the network is selected as DR; When started simultaneously or reselected, the router with the superior priority (0-255) is selected as DR; When started simultaneously or with the same priority, the router with the largest ID is selected as DR; DR selection is not preemptive unless OSPF progress is restarted.

Selection of DR and BDRHello Message

Contents

OSPF Overview OSPF Concept OSPF Working Process Finding Neighbors Selecting DR or BDR Forming Adjacency Updating LSA Computing Optimal Route Area Allocation LSA Transmission among Multiple Areas Route Optimization

Forming Adjacency of OSPF (1)

Lo: 10.75.0.1

10.75.32.1/30 Int1

Lo: 10.75.0.2 10.75.32.2/30 B DR Int1

RB Neighbors List 10.75.0.1, 10.75.0.1, int1, int1, Exchange 10.75.0.1, int1 ,2-way init

RA Neighbors List 10.75.0.2, 10.75.0.2,int1, int1, 10.75.0.2, int1 Exchange ,Exstart 2-way
afadjfjorqpoeru 39547439070713

Exstart DR, I will initiate interaction of LSA and I am the master sender (MS=1).
afadjfjorqpoeru 39547439070713

DBD

No, I am the master sender, because I have higher router ID. Exchange State
afadjfjorqpoeru 39547439070713

DBD
afadjfjorqpoeru 39547439070713

This is summary information about my LSDB. This is summary information about my LSDB.

DBD

DBD

Forming Adjacency of OSPF (2)

lo10.75.0.1

10.75.32.1/30 Int1

lo10.75.0.2 10.75.32.2/30 B DR Int1

RB Neighbors List 10.75.0.1, 10.75.0.1, int1, int1, Exchange Full 10.75.0.1, int1 , init

RA Neighbors List 10.75.0.2, 10.75.0.2, int1, int1, Loading 10.75.0.2, int1, Exchange 10.75.0.1, int1 , Full init
afadjfjorqpoeru 39547439070713

Loading State I have no information about 172.16.6.0/24 and I need entire LSA.
afadjfjorqpoeru 39547439070713

LSR

This is LSA of 172.16.6.0/24.

afadjfjorqpoeru 39547439070713

LSU

LSAck

Received, thanks! Full State

My LSDB is complete. No query is need

Contents

OSPF Overview OSPF Concept OSPF Working Process Finding Neighbors Selecting DR or BDR Forming Adjacency Updating LSA Computing Optimal Route Area Allocation LSA Transmission among Multiple Areas Route Optimization

Flooding Process (1)

Point-to-point link state changes
3 Update route table 1 LSU 2
B LSU

The router notifies changed topology information of neighbors in 224.0.0.5.

Flooding Process (2)

Broadcast link state changes
LSU

2
DR

4 Update route table 1 LSU

A B

3
LSU

Router A notifies DR in 224.0.0.6. DR notifies other routers in 224.0.0.5.

Contents

OSPF Overview OSPF Concept OSPF Working Process Finding Neighbors Selecting DR or BDR Forming Adjacency Updating LSA Computing Optimal Route Area Allocation LSA Transmission among Multiple Areas Route Optimization

Process of Computing OSPF Protocol

RTA
1 2 5

RTB LSDB LSA of RTA LSA of RTB LSA of RTC LSA of RTD RTD
3

A
2

B
5

RTC
3

(1) Network topology structure A

2 1

(2) LSDB of each router (3) Weighted digraph created by LSDB

1 2 1 2 1 2

C
3 3

C
3

C
3

(4) Each router computes the minimal spanning tree with itself as the root node.

Computing Minimal Spanning Tree

Sum of COST from external ports in data forwarding direction 10.1.1.0/24

Cost=1

10.2.2.0/24
Cost=1

10.3.3.0/24
Cost=1

Cost=5

Cost=5

Ospf route Table Net Cost 10.2.2.0 2 10.3.3.0 3

Ospf route Table Net Cost 10.1.1.0 10

Contents

OSPF Overview OSPF Concept OSPF Working Process Area Allocation LSA Transmission among Multiple Areas Route Optimization

Problems Large-Scale OSPF Network Meets

OSPF
Always computing route table, boring!
Only LSA is received, no data.

OSPF OSPF OSPF OSPF

My route table is too large and my memory is too small.

Solution: Allocate Areas

Area 0

Area 1

Area 2

Autonomous system Rules for allocating areas:

Each network segment must belong to an area, that is, each interface that runs OSPF protocol must be designated to an area; Each area is identified by area ID, which is an integer ranging from 0 to 32; Backbone area (area 0) cannot be separated by non-backbone areas; Non-backbone areas (not area 0) must be connected to backbone area (virtual link is not suggested).

Advantages for Allocating Areas

Only LSDB of routers in the same area can be synchronized. The changes of network topology structure are first updated within the area..
After areas are allocated, route aggregation can be performed on the boundary router within the area to reduce the number of LSA notified to other areas and minimize the influence caused by changes of network topology.

Types of OSPF Routers

Area 1 Backbone area 0 ABR and backbone router Backbone/internal router Internal router Area 2

Internal router

ABR and backbone router ASBR and backbone router

External AS

Contents

OSPF Overview OSPF Concept OSPF Working Process Area Allocation LSA Transmission among Multiple Areas Route Optimization

Types of LSA
Types of LSA
LSA1: Router LSA LSA2: Network LSA LSA3: Network Summary LSA LSA4: ASBR Summary LSA LSA5: Autonomous system external LSA

Initiator
Each router in the area DR and BDR ABR

Transmission Range
Within the area Within the area Among areas

Described Object
Direct link state of the router Directly connected routers within the network segment Route of the area where ABR is located (LSA1 and LSA2) Notify ASBR of the area where ABR is located Notify exterior route (non-ospf route, such as RIP or BGP)

ABR

Among areas

ASBR

Among areas

Types of LSA
Area 1
DR

Area 0

Network Router
ABR

External
ASBR

External AS

Summary

Flooding of LSA among Multiple Area Network

RIP

Area 1
Internal ABR1

Area 0
ABR2

Area 50
Internal

BBone
afadjfjorqpoeru 39547439070713 afadjfjorqpoeru 39547439070713 afadjfjorqpoeru 39547439070713

Type 1

Type 3

Type 3
afadjfjorqpoeru 39547439070713

afadjfjorqpoeru 39547439070713

Type 4 Type 5
afadjfjorqpoeru 39547439070713

Type 5

Contents

OSPF Overview OSPF Concept OSPF Working Process Area Allocation LSA Transmission among Multiple Areas Route Optimization
Stub Area

Route Summarization

Constitution of OSPF Route

Route table Route within areas

Area 1

Route among areas

Area 1

Area 0

External route (non-OSPF route)

Area 1

RIP

Types of Areas
Stub Area 0 Totally Stubby

Do not receive redistributed route ASBR Summary LSA Autonomous system external LSA

Receive all LSA

Do not receive route outside areas Network Summary LSA Do not receive redistributed route ASBR Summary LSA Autonomous system external LSA

Stub and Totally Stubby Area (1)

4.1.1.0 4.1.2.0

Area 50
2.1.2.0
C

RIP
ABR
1.1.1.0

Area 0
ABR
1.1.2.0 1.1.3.0

Area 1
3.1.1.0

2.1.1.0

A ASBR

F
3.1.2.0

RC route table 1.1.1.0 int1 ospf 1.1.2.0 int1 ospf 1.1.3.0 int1 ospf 2.1.1.0 int1 direct 2.1.2.0 int2 direct 3.1.1.0 int1 ospf 3.1.2.0 int1 ospf 4.1.1.0 int1 ospf 4.1.2.0 int1 ospf

RD route table 1.1.1.0 int1 direct 1.1.2.0 int1 ospf 1.1.3.0 int1 ospf 2.1.1.0 int2 direct 2.1.2.0 int2 ospf 3.1.1.0 int1 ospf 3.1.2.0 int1 ospf 4.1.1.0 int1 ospf 4.1.2.0 int1 ospf

RE route table 1.1.1.0 int1 ospf 1.1.2.0 int1 ospf 1.1.3.0 int1 direct 2.1.1.0 int1 ospf 2.1.2.0 int1 ospf 3.1.1.0 int2 direct 3.1.2.0 int2 ospf 4.1.1.0 int1 ospf 4.1.2.0 int1 ospf

RF route table 1.1.1.0 int1 ospf 1.1.2.0 int1 ospf 1.1.3.0 int1 ospf 2.1.1.0 int1 ospf 2.1.2.0 int1 ospf 3.1.1.0 int1 direct 3.1.2.0 int2 direct 4.1.1.0 int1 ospf 4.1.2.0 int1 ospf

Stub and Totally Stubby Area (2)

RIP

Area 50Stub

Area 0

Area 1Totally Stubby

Internal

ABR1

ASBR

BBone

ABR2

Internal

afadjfjorqpoeru 39547439070713 afadjfjorqpoeru 39547439070713 afadjfjorqpoeru 39547439070713

afadjfjorqpoeru 39547439070713

Summary
Summary Summary

Default

afadjfjorqpoeru 39547439070713

afadjfjorqpoeru 39547439070713

afadjfjorqpoeru 39547439070713

afadjfjorqpoeru 39547439070713

Default

External

External

Default

Stub and Totally Stubby Area (3)

4.1.1.0 4.1.2.0

Area 50Stub
2.1.2.0
C

RIP

Area 0
1.1.2.0 1.1.3.0

Area 1Totally Stubby

ABR
3.1.1.0

ABR
1.1.1.0 2.1.1.0

A ASBR

F
3.1.2.0

RC route table 1.1.1.0 int1 ospf 1.1.2.0 int1 ospf 1.1.3.0 int1 ospf 2.1.1.0 int1 direct 2.1.2.0 int2 direct 3.1.1.0 int1 ospf 3.1.2.0 int1 ospf 0.0.0.0 int1 ospf

RD route table 1.1.1.0 int1 direct 1.1.2.0 int1 ospf 1.1.3.0 int1 ospf 2.1.1.0 int2 direct 2.1.2.0 int2 ospf 3.1.1.0 int1 ospf 3.1.2.0 int1 ospf 4.1.1.0 int1 ospf 4.1.2.0 int1 ospf

RE route table 1.1.1.0 int1 ospf 1.1.2.0 int1 ospf 1.1.3.0 int1 direct 2.1.1.0 int1 ospf 2.1.2.0 int1 ospf 3.1.1.0 int2 direct 3.1.2.0 int2 ospf 4.1.1.0 int1 ospf 4.1.2.0 int1 ospf

RF route table

3.1.1.0 int1 direct 3.1.2.0 int2 direct 0.0.0.0 int1 ospf

Limitation of Stub and Totally Stubby Area

Area 2
0.0.0.0
R3 R4

Unique outlet

X
External AS

Only

one outlet No ASBR within the area Can not be AREA 0 (Backbone) No Virtual links

NSSA

Not So Stubby Area

Area 0 To Other Area Type 5
R3

Area 2

R4

Type 7

External AS

Contents

OSPF Overview OSPF Concept OSPF Working Process Area Allocation LSA Transmission among Multiple Areas Route Optimization
Stub Area Route Summarization

Support Route Summarization

Area 0 backbone area Summarized route

ABRs Area 1

Reduce the size of route table Limit the influence of topology changes in the local area Reduce the number of LSAs and save CPU resource

Route Summarization
ABR
B

Area 1
A

Area 0
C

Summarized route

Route table of router B

O 172.16.8.0 O 172.16.12.0 O 172.16.16.0 O 172.16.20.0 O 172.16.24.0 O 172.16.28.0 255.255.252.0 255.255.252.0 255.255.252.0 255.255.252.0 255.255.252.0 255.255.252.0

LSAs transmitted to route C

IA 172.16.8.0 255.255.248.0 IA 172.16.16.0 255.255.240.0

A summarized route can represent multiple sub networks.

Review

OSPF concept and features OSPF working principle OSPF area allocation Stub and Totally Stubby area Route summarization

Questions

Can OSPF achieve load balance or equivalent load balance? How is OSPF Metric computed? How many types of LSA does OSPF have? Who creates theses types? Can you describe the working process of OSPF?