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 belongs to link state protocol, maintains complex
network topology database, and adopts SPF algorithm to
compute the optimal route.
The types of OSPF network 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:
The IP address of the first interface that is activated is selected. If
multiple interfaces are activated, the minimum IP address of the router
is selected.
If loopback interface is configured on the router, router ID is the
minimum IP address of all loopback interfaces, in spite of IP address of
other physical interfaces or even when they are activated.
Hi,
Features:
Hi,I Iam
amrouter
routerAA
and
andmy
myname
nameisis
192.132.1.3.
Globally unique;
192.132.1.3.
Once selected, it cannot be changed unless OSPF progress is
restarted.
ZXR10# clear ip ospf

OSPF Concept (2)

Interface

Designated Router (DR) and Backup Designated Router (BDR)

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

Neighboring Routers

To reduce traffic of OSPF synchronous link state information, broadcast

network can be automatically represented as DR or BDR according to
interface priority.

Link State Database

Interfaces run OSPF protocol;

transmit protocol messages periodically (Hello packet) and search and
find neighbors.

OSPF routers on the direct network become neighbors automatically

according to 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;

Interact LSA, synchronize link state database
(LSDB), and form adjacency;
Use SPF algorithm to compute the shortest path
tree and form 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

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 * must be consistent to set up neighbors

NeighborhoodHello Message

Process of Forming OSPF Neighbor List

Lo: 10.75.0.1

Lo: 10.75.0.2
10.75.32.2/30
Int1
B

10.75.32.1/30
Int1

RB Neighbors List

RA Neighbors List

10.75.0.1, int1,
10.75.0.1,
int1 ,2-way
init

10.75.0.2, int1 , 2-way

Down
State

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,
Neighbor,
receive
receivemy
my
LSA.
LSA.

On broadcast network, waste can be caused when each

neighbor transmits LSA (network bandwidth and CPU
resources).

Functions of DR and BDR

DR

BDR

To reduce traffic of OSPF protocol messages, on local area network,

each network segment uses DR or BDR to represent the network.
Each router can synchronize 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
DR Int1
B
RB Neighbors List

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

DBD

10.75.0.1,
10.75.0.1,
int1,
int1,
10.75.0.1,
int1Exchange
,2-way
init
Exstart

DR, I will initiate interaction of LSA and I am the master sender (MS=1).
No, I am the master sender, because I have higher router ID.
Exchange State

afadjfjorqpoeru
39547439070713

DBD

This is summary information about my LSDB.

This is summary information about my LSDB.

afadjfjorqpoeru
39547439070713

DBD
afadjfjorqpoeru
39547439070713

DBD

Forming Adjacency of OSPF (2)

lo 10.75.0.1

10.75.32.1/30
Int1

lo 10.75.0.2
10.75.32.2/30
DR Int1
B
RB Neighbors List

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

LSR

10.75.0.1,
10.75.0.1,
10.75.0.1,
int1,
int1,
int1,
Exchange
Loading
Full
10.75.0.1,
int1
, init
Loading State

I have no information about 172.16.6.0/24 and I need entire LSA.

afadjfjorqpoeru
39547439070713

This is LSA of 172.16.6.0/24.

LSU

afadjfjorqpoeru
39547439070713

LSAck

Received, thanks!
Full State
My LSDB is complete. No query is needed.

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
A

2
B
LSU

The router notifies changed topology information of neighbors in 224.0.0.5.

Flooding Process (2)

Broadcast link state changes

2
LSU

DR

4 Update route table

1 LSU
A

Router A notifies DR in 224.0.0.6.

DR notifies other routers in 224.0.0.5.

3
LSU

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

RTB

LSDB

1
2

LSA of RTA

A
2

C
3

C
3

C
3

(2) LSDB of each router (3) Cum rights digraph created by LSDB

(1) Network
topology structure

LSA of RTD

RTD

LSA of RTC

LSA of RTB

RTC

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 direction

10.1.1.0/24

10.2.2.0/24

Cost=1

Topology Table
Net
Cost
10.2.2.0
2
10.3.3.0
3

Cost=5

10.3.3.0/24

Cost=1

Cost=5

Topology 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

My route table is too large and my

memory is too small.

OSPF

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 with 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 brought by changes of
network topology.

Types of OSPF Routers

Area 1

Backbone area 0

Area 2

ABR and backbone router

Backbone/internal router
Internal router

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

Initiator

Transmission
Range

Described Object

LSA1:
Router LSA

Each router in the

area

Within the area

Direct link state of the router

LSA2:
Network LSA

DR and BDR

Within the area

Directly connected routers

within the network segment

LSA3:
Network Summary
LSA

ABR

Among areas

Route of the area where ABR

is located (LSA1 and LSA2)

LSA4:
ASBR Summary
LSA

ABR

Among areas

Notify ASBR of the area

where ABR is located

LSA5:
Autonomous
system external
LSA

ASBR

Among areas

Notify exterior route (RIP or

BGP)

Types of LSA
Area 1

Area 0

DR

External

Network
Router

ABR

Summary

ASBR

External
AS

Flooding of LSU among Multiple Area Network

RIP
Area 1
Internal

Area 50

Area 0
ABR1

Internal

ABR2

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

External route
(non-OSPF route)

Area 1

Area 0

RIP

Types of Areas
Stub

Not receive route outside areas

Network Summary LSA

Area 0

Receive all LSA

Totally Stub

Not receive route outside areas

Network Summary LSA
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

RIP

Area 50
2.1.2.0

Area 0

ABR

ABR
1.1.1.0

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

2.1.1.0

Area 1

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

A
ASBR

1.1.2.0

1.1.3.0
B

3.1.1.0

F
3.1.2.0

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

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

Stub and Totally Stubby Area (2)

RIP

Area 50Stub

Internal

afadjfjorqpoeru
39547439070713

Summary

ABR1

ASBR

afadjfjorqpoeru
39547439070713

Summary

afadjfjorqpoeru
39547439070713

afadjfjorqpoeru
39547439070713

Default

External

Area 0

BBone

afadjfjorqpoeru
39547439070713

Summary

afadjfjorqpoeru
39547439070713

External

Area 1Totally Stubby

ABR2

Internal

afadjfjorqpoeru
39547439070713

Default

afadjfjorqpoeru
39547439070713

Default

Stub and Totally Stubby Area (3)

4.1.1.0
4.1.2.0

RIP

Area 50Stub
2.1.2.0

Area 0

ABR

ABR
1.1.1.0

RC route table

2.1.1.0
2.1.1.0 int1
int1 direct
direct
2.1.2.0
int2
direct
2.1.2.0 int2 direct
4.1.1.0
4.1.1.0 int1
int1 ospf
ospf
4.1.2.0
4.1.2.0 int1
int1 ospf
ospf
0.0.0.0
int1
ospf
0.0.0.0 int1 ospf

2.1.1.0

Area 1Totally Stubby

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

A
ASBR

1.1.2.0

1.1.3.0
B

3.1.1.0

F
3.1.2.0

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

RF route table

3.1.1.0
3.1.1.0 int1
int1 direct
direct
3.1.2.0
int2
direct
3.1.2.0 int2 direct
0.0.0.0
0.0.0.0 int1
int1 ospf
ospf

Limitation of Stub and Totally Stubby Area

Area 2
0.0.0.0
R3

Unique outlet

R4

X
External
AS

Only

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

NSSA

Not So Stubby Area

Area 2

Area 0
To Other Area
Type 5

R3

R4

Type 7

Type
7
RI
P
External
AS

Contents

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

Supporting Route Summarization

Area 0 backbone area
Summarizing route
ABRs
Area 1

Reduce the size of route table

Limit the influence of topology changes on the local
Reduce the number of LSAs and save CPU resources

Route Summarization

Area 1
A

ABR

Area 0
C

Summarizing 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 piece of route information can represent multiple sub

network.

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 does OSPF LSA have? Who
create theses types? What range are the types
released in? Which content is described?
Can you describe the working process of OSPF?