Sem2 Chapter 11 OSPF

OSPF
NET1005
OSPF
CCNA Exploration Semester 2
Chapter 11
Linda Crane
With material from many sources including David Bray, Cisco.
Algonquin College
NET1005
Topics
Background and features of OSPF

Configure basic OSPF
OSPF metric
Designated router/backup designated router elections
Default information originate
CCNA v3.0 Update © 2003, Algonquin College. © 2002, Cisco Systems, Inc. All rights reserved. Page 2 Algonquin College2
NET1005 - L. Crane 1
OSPF
NET1005
Routing protocols
Interior Exterior
Distance vector Link state

RIP v1 OSPF EGP
RIP v2 IS-IS BGP
IGRP
EIGRP
NET1005
OSPF background
Developed by IETF to replace RIP

Better metric
Fast convergence
Scales to large networks by using areas
OSPF
NET1005
Link State Info of Other Routers

RouterB:
RouterA’s Topological Connected to RouterA on network 11.0.0.0/16, cost of 15
Data Base (Link State Connected to RouterE on network 15.0.0.0/16, cost of 2
Database) Has a “leaf” network 14.0.0.0/16, cost of 2
RouterC:
Connected to RouterA on network 12.0.0.0/16, cost of 2
Connected to RouterD on network 16.0.0.0/16, cost of 2
All other routers flood Has a “leaf” network 17.0.0.0/16, cost of 2
their own link state RouterD:
information to all other Connected to RouterC on network 16.0.0.0/16, cost of 2
routers. Connected to RouterE on network 18.0.0.0/16, cost of 2
Has a “leaf” network 19.0.0.0/16, cost of 2
RouterE:
RouterA stores this Connected to RouterB on network 15.0.0.0/16, cost of 2
information in its LSD Connected to RouterD on network 18.0.0.0/16, cost of 10
(Link State Database). Has a “leaf” network 20.0.0.0/16, cost of 2
The Dijkstra algorithm is

then run to create an
SPFT, which is used to
create the Forwarding
DB (Routing Table).
NET1005
Link State information from RouterB

We obtain the following link-state information from RouterB:
Connected to RouterA on network 11.0.0.0/16, cost of 15 14.0.0.0/16
Connected to RouterE on network 15.0.0.0/16, cost of 2 2
11.0.0.0/16 B 15.0.0.0/16
2
15
A E
Now, RouterA attaches the two graphs… 14.0.0.0/16

2
B
11.0.0.0/16 14.0.0.0/16 B
15
11.0.0.0/16 15.0.0.0/16
2 2
15
10.0.0.0/16
A
12.0.0.0/16
2
C
+ B 15.0.0.0/16 =
10.0.0.0/16
12.0.0.0/16
2
2 E
2 15 A C
5 2
5
13.0.0.0/16 D A E
13.0.0.0/16
D
OSPF
NET1005
Link State information from RouterC
12.0.0.0/16
We obtain the following link-state information from RouterC: 17.0.0.0/16
2
Connected to RouterA on network 12.0.0.0/16, cost of 2 A C
2
Has a “leaf” network 17.0.0.0/16, cost of 2 16.0.0.0/16 2
D
14.0.0.0/16
2 Now, RouterA attaches the two graphs…
11.0.0.0/16 B
15.0.0.0/16
15
2 17.0.0.0/16 14.0.0.0/16
2
A C
12.0.0.0/16 2 2
10.0.0.0/16
2
A
2
C E + 16.0.0.0/16 2
11.0.0.0/16 B
15.0.0.0/16
5 D 2
15
13.0.0.0/16 D 10.0.0.0/16 12.0.0.0/16 17.0.0.0/16
= 2
A
2
C E
5 2 16.0.0.0/16
CCNA v3.0 Update © 2003, Algonquin College. © 2002, Cisco Systems, Inc. All rights reserved.
13.0.0.0/16
Page 7 D
Algonquin College7
NET1005
Link State information from RouterD
We obtain the following link-state information from RouterD: A C E

Connected to RouterA on network 13.0.0.0/16, cost of 5 16.0.0.0/16
5 10
Connected to RouterC on network 16.0.0.0/16, cost of 2 2
Connected to RouterE on network 18.0.0.0/16, cost of 10 13.0.0.0/16 18.0.0.0/16
D
2 19.0.0.0/16
14.0.0.0/16 Now, RouterA attaches the two graphs…

2 A C E 14.0.0.0/16
2
B
11.0.0.0/16 15.0.0.0/16 5 2 10
2 11.0.0.0/16 B 15.0.0.0/16
15 18.0.0.0/16
D 2
12.0.0.0/16 17.0.0.0/16 15
10.0.0.0/16
2
A
2
C E + 2 19.0.0.0/16
10.0.0.0/16 A
12.0.0.0/16 17.0.0.0/16
2 E
C
13.0.0.0/16
5
16.0.0.0/16
2 = 2
5 16.0.0.0/16
2 10
D
13.0.0.0/16 D 18.0.0.0/16
2
19.0.0.0/16
OSPF
NET1005
Link State information from RouterE

B
15.0.0.0/16
2
We obtain the following link-state information from RouterE:
Connected to RouterB on network 15.0.0.0/16, cost of 2 20.0.0.0/16
Connected to RouterD on network 18.0.0.0/16, cost of 10 E
2
2 10
18.0.0.0/16
D
14.0.0.0/16
2
B B 14.0.0.0/16
11.0.0.0/16 15.0.0.0/16
2 2
2
15
B
12.0.0.0/16 11.0.0.0/16 15.0.0.0/16
10.0.0.0/16
17.0.0.0/16 E 20.0.0.0/16
2
2
A
2
C E
+ 2
15
12.0.0.0/16
20.0.0.0/16
5 16.0.0.0/16
2 10
2 10 10.0.0.0/16 A 2 17.0.0.0/16 E
C
13.0.0.0/16 18.0.0.0/16 D 2 2
D
5 16.0.0.0/16
2 10
2 19.0.0.0/16
13.0.0.0/16 18.0.0.0/16
D
2 19.0.0.0/16
NET1005
Final Topology
Using the topological information we listed, RouterA has now built a complete
topology of the network.
The next step is for the link-state algorithm to find the best path to each node
and leaf network.
14.0.0.0/16
2
B
11.0.0.0/16 15.0.0.0/16
2
15
12.0.0.0/16
10.0.0.0/16 2 17.0.0.0/16 20.0.0.0/16
A C E
2 2 2
16.0.0.0/16
5 2 10
18.0.0.0/16
13.0.0.0/16
D
2 19.0.0.0/16
OSPF
NET1005
Link State Info of Other Routers

RouterB:
RouterA’s Topological Connected to RouterA on network 11.0.0.0/16, cost of 15
Data Base (Link State Connected to RouterE on network 15.0.0.0/16, cost of 2
Database) Has a “leaf” network 14.0.0.0/16, cost of 2
RouterC:
All other routers flood Has a “leaf” network 17.0.0.0/16, cost of 2
their own link state RouterD:
information to all other Connected to RouterC on network 16.0.0.0/16, cost of 2
routers. Connected to RouterE on network 18.0.0.0/16, cost of 2
RouterE:
RouterA stores this Connected to RouterB on network 15.0.0.0/16, cost of 2
information in its LSD Connected to RouterD on network 18.0.0.0/16, cost of 10
(Link State Database). Has a “leaf” network 20.0.0.0/16, cost of 2
The Dijkstra algorithm is

then run to create an
SPFT, which is used to
create the Forwarding
DB (Routing Table).
NET1005
Choosing the Best Path

• Now RouterA uses the SPF algorithm to find the best path to each network,
creating an SPFT (Shortest Path First Tree).
14.0.0.0/16
2
B
11.0.0.0/16 15.0.0.0/16
2
15
12.0.0.0/16
17.0.0.0/16 20.0.0.0/16
10.0.0.0/16 2 E
A C 2 2
16.0.0.0/16
5 2 10
13.0.0.0/16 18.0.0.0/16
D
2 19.0.0.0/16
OSPF
NET1005
SPFT Results Build a Routing Table

RouterA’s Routing Table
10.0.0.0/16 connected e0
14.0.0.0/16
11.0.0.0/16 connected s0 2
12.0.0.0/16 connected s1
13.0.0.0/16 connected s2 B
11.0.0.0/16 15.0.0.0/16
2
14.0.0.0/16 17 s0
15
15.0.0.0/16 16 s1
16.0.0.0/16 4 s1 12.0.0.0/16
s0
17.0.0.0/16 4 s1 17.0.0.0/16 20.0.0.0/16
10.0.0.0/16 s1 2 E
18.0.0.0/16 14 s1
e0
A C 2 2
19.0.0.0/16 6 s1 s2
16.0.0.0/16
20.0.0.0/16 16 s1 5 2 10
13.0.0.0/16 18.0.0.0/16
D
2 19.0.0.0/16
CCNA v3.0 Update © 2003, Algonquin College. © 2002, Cisco Systems, Inc. All rights reserved. Algonquin College13
NET1005
OSPF packets
0x01 Hello establishes and maintains adjacency
0x02 Database Description (DBD) summary of database
for other routers to check
0x03 Link State Request (LSR) use to request more
detailed information
0x04 Link State Update (LSU) reply to LSR and send new
information
0x05 Link State Acknowledgement (LSAck)
OSPF
NET1005
OSPF encapsulation
Data link IP packet OSPF packet Data

frame header header header
MAC destination address

Multicast 01-00-5E-00-00-05
or 01-00-5E-00-00-06
NET1005
OSPF encapsulation

IP destination address
Multicast 224.0.0.5 or 224.0.0.6
Protocol field 89
OSPF
NET1005
OSPF encapsulation

Type code for packet type (0x01 etc)

Router ID and Area ID
NET1005
Hello, OSPF packet type 1
Discover OSPF neighbours and establish adjacencies.

Advertise parameters on which two routers must agree to
become neighbors.
Elect the Designated Router (DR) and Backup
Designated Router (BDR) on multiaccess networks like
Ethernet and Frame Relay.
OSPF
NET1005
Fields in Hello packet

Type (=1), Router ID, Area ID
Subnet mask of sending interface
Hello Interval, Dead Interval
Router Priority: Used in DR/BDR election
Designated Router (DR): Router ID of the DR, if any
Backup Designated Router (BDR): Router ID of the BDR, if any
List of Neighbors: lists the OSPF Router ID of the neighboring
router(s)
NET1005
Sending Hellos
By default, OSPF Hello packets are sent every 10
seconds on multiaccess and point-to-point segments and
every 30 seconds on non-broadcast multiaccess (NBMA)
segments (Frame Relay, X.25, ATM).
In most cases, OSPF Hello packets are sent as multicast
to 224.0.0.5.
Router waits for Dead interval before declaring the
neighbor "down." Default is four times the Hello interval.
OSPF
NET1005
Matching
Before two routers can form an OSPF neighbour

adjacency, they must agree on three values:
Hello interval,
Dead interval,
Network type (e.g. point to point, Ethernet, NBMA.)
NET1005
Election
On multi-access networks (Ethernet, NBMA) the routers

elect a designated router and a backup designated router
This saves on overhead
Each router becomes adjacent to the designated router
and swaps updates with it
If the designated router fails, the backup designated
router takes over
OSPF
NET1005
Finding best routes
NET1005
Administrative Distance
Preferred to IS-IS or RIP but not to EIGRP
OSPF
NET1005
Configuring OSPF
R1(config)#router ospf 1
R1(config-router)#
The process-id is between 1 and 65535
It does not have to match the process-id on neighbour
routers (unlike EIGRP)
NET1005
Configuring OSPF
Router(config-router)#network 192.168.1.0 0.0.0.255

area 0
Address as usual
Wildcard mask is required (optional for EIGRP), some
routers accept subnet mask
We always use a single area 0 for CCNA, this would be
the backbone if there are multiple areas.
OSPF
NET1005
Choosing the Router ID
1. Use the IP address configured with the OSPF router-id

command.
2. If the router-id is not configured, use the highest IP
address of any of the loopback interfaces.
3. If no loopback interfaces are configured, use the highest
active IP address of any physical interface. The
interface must be up. It need not be in a network
command.
NET1005
Show the router ID
#show ip protocols (on most routers).

#show ip ospf
#show ip ospf interface
OSPF
NET1005
Loopback address
Highest loopback address is used in preference to a real

interface address
A loopback address is a virtual interface and is
automatically up, so it cannot fail – this makes it more
stable.
Router(config)#interface loopback 0
Router(config-if)#ip address 10.0.0.1 255.255.255.255
NET1005
OSPF router-id command
Introduced in IOS 12.0(T) and is the first choice for

determining router ID.
Router(config)#router ospf 1
Router(config-router)#router-id 172.16.0.1
Many networks still use the loopback address method of

assigning router IDs.
OSPF
NET1005
Changing router ID
The router ID is fixed when OSPF is configured and given
its first network command.
Any loopback addresses or router-id commands should
be given before configuring OSPF.
Router#clear ip ospf process can be used, set the ID,
then configure OSPF again.
The router may need to be reloaded
NET1005
Show ip ospf neighbor
Neighbor ID Pri state Dead Time Address Interface
10.3.3.3 1 FULL/ 00:00:30 192.168.10.6 Serial0/1
10.2.2.2 1 FULL/ 00:00:33 192.168.10.2 Serial0/0
Of
OSPF neighbour
priority On this
Fully
adjacent router
OSPF
NET1005
Other show commands
show ip protocols
show ip ospf
show ip ospf interface
Show ip route
NET1005
Summary?
OSPF does not summarise to class boundaries by

default.
OSPF
NET1005
OSPF metric
The OSPF specification says that cost is the metric, does

not say how cost is found.
Cisco uses bandwidth
Cost = 108 = 100,000,000
bandwidth bandwidth
Then finds cumulative cost for all links on a path.
NET1005
Standard costs
Interface type 108/bps = Cost
Fast Ethernet and faster 108/100,000,000bps = 1
Ethernet 108/10,000,000bps = 10
E1 108/2,048,000bps = 48
T1 108/1,544,000bps = 64
128 Kbps 108/128,000bps = 781
64 Kbps 108/64,000bps = 1562
56 Kbps 108/56,000bps = 1785
OSPF
NET1005
Faster than 100 Mbps
By default, the cost metric for all interfaces operating at

100Mbps or more is 1.
This uses the reference bandwidth of 100Mbps.
To distinguish between links of higher bandwidths, configure
all routers in the area e.g.
auto-cost reference-bandwidth 1000
This would multiply costs by 10 and allow for faster
bandwidths to have costs below 10.
NET1005
Serial link bandwidths
Serial links often have a default bandwidth of T1 (1.544

Mbps), but it could be 128 kbps.
This may not be the actual bandwidth.
show interface will give the default value.
show ip ospf interface gives the calculated cost.
Give it the right bandwidth.
Router(config-if)#bandwidth 64
OSPF
NET1005
Configure the cost directly
Alternative to configuring the bandwidth:

Configure the cost directly.
R1(config)#interface serial 0/0
R1(config-if)#ip ospf cost 1562
Configure cost if there are non-Cisco routers in the area
that calculate costs in different ways.
NET1005
Point to point network

Only two routers on network
They become fully adjacent with each other
OSPF
NET1005
Multiaccess networks
Networks where there could possibly be more than 2

routers, e.g. Ethernet, Frame Relay.
These have a method of cutting down on adjacencies and
the number of updates exchanged.
5 routers:
10 adjacencies?
NET1005
Multiaccess network
Not efficient if they every router becomes fully adjacent to

every other router
Designated router (DR) becomes fully adjacent to all
other routers
Backup designated router (BDR) does too – in case
designated router fails
OSPF
NET1005
Multiaccess
All routers send LSUs to DR and BDR but not to other routers
Use multicast address 224.0.0.6
DROther DROther DROther

NET1005
Multiaccess
DR then sends LSUs to all routers

Use multicast address 224.0.0.5
OSPF
NET1005
Router detects change

A router knows that a link is down if it does not receive a timed
Hello from a partner
NET1005
Send update
The router sends a LSU (link state update) on multicast
224.0.0.6 to DR/BDR
OSPF
NET1005
Update all routers

DR sends to 224.0.0.5, all OSPF routers
BDR does not send unless DR fails
NET1005
Recalculate routing table
Each router sends LSAck acknowledgement

Waits for hold time in case link comes straight back up
Runs SPF algorithm using new data
Updates routing table with new routes
OSPF
NET1005
OSPF network types
Network type Characteristics DR election?
Broadcast multiaccess Ethernet, token ring, Yes

FDDI
Nonbroadcast Frame relay, X.25, Yes

multiaccess ATM
Point to point PPP, HDLC No
Point to multipoint Configured by No

administrator
Virtual link Configured by No

administrator
NET1005
DR/BDR election
Happens when routers first discover each other using

Hellos.
Router with highest priority becomes DR, next highest
becomes BDR.
If they have the same priority then the highest router ID
becomes DR, next highest becomes BDR.
By default all routers have priority 1
OSPF
NET1005
Election where same priority
NET1005
Add a router
An election has taken place and a DR and BDR have

been chosen.
Now add another router with a higher priority. It will not
become DR if there is already a DR.
To make sure that a certain router becomes DR:
• Give it the highest priority
• Switch it on first
OSPF
NET1005
OSPF states
Down
Init (after receiving hello)
Two-way (election here)
ExStart (decide who initiates exchange)
Exchange (swap summary database)
Loading (link state requests and updates)
Full adjacency (know the same topology)
NET1005
Summary of OSPF Operational States

Down – no sign of anyone
Init – received an initial Hello packet
Two-Way – received a Hello packet with my own router ID (i.e. I'm recognized
by the sender as a neighbour)
ExStart – Exchange Startup mode where neighbours negotiate who's in
control of the conversation
Exchange – neighbours are actively exchanging link-state information
Loading – neighbours requesting more detailed Link State Advertisements
(LSAs) from each other
Full – neighbouring routers have the same LSD (Link State Database, or
Topological Database), and are fully adjacent
OSPF
NET1005
After Neighbour Discovery
Discovering Routes and Reaching Full State
reached “2-Way” after
exchanging Type-1's
(Hello packets)
OSPF Type-2 (DBD)

OSPF Type-2 (DBD)
OSPF Type-2 (DBD)

OSPF Type-2 (DBD)
OSPF Type-5 (LSAck)
OSPF Type-3 (LSR)

OSPF Type-4 (LSU)
OSPF Type-5 (LSAck)
NET1005
DROther routers
Routers that are not elected as DR or BDR are called

DROther.
They become fully adjacent with DR and BDR.
They stay in 2-way state with each other.
OSPF
NET1005
Priority
Router(config-if)#ip ospf priority {0 - 255}

To force an election:
Shut down the interfaces
Bring them up again, chosen DR first, chosen BDR
second.
The DR should be a router with plenty of processing
power.
NET1005
Propagate static route

R1(config-router)#default-information originate
In routing table
O*E2 0.0.0.0/0 [110/1] via 192.168.10.10, 00:05:34, Serial0/0/1
E2 means this is an OSPF External Type 2 route.
The cost will stay the same as it is propagated.
Type 1 would increase its cost at each router.
OSPF
NET1005
Changing intervals
Router(config-if)#ip ospf hello-interval seconds

Router(config-if)#ip ospf dead-interval seconds
This needs to be done on both partners in an adjacency.
The adjacency is broken when one router is changed.
NET1005
Databases
OSPF
NET1005
Summary….
What is the importance of router-id in OSPF?

NOTE that the administrator SHOULD control router-id.
How is router-id set on a router?
• Why would administrator use one method over another?
How can you influence which routers are the DR or BDR?
When is DR and BDR elected…what effect does this
have?
NET1005
Comparing routing protocols
Link state Distance vector

Sends LSA updates – low Broadcasts whole routing
bandwidth use after initial tables – high bandwidth use
flooding Simple algorithms – little
Complex algorithm – powerful processing
processor One table – little memory
Three databases – large Can have loops
memory
No loops
OSPF
NET1005
The End
Algonquin College

Sem2 Chapter 11 OSPF

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Sem2 Chapter 11 OSPF

Загружено:

Авторское право:

Доступные форматы

OSPF

 Background and features of OSPF

Distance vector Link state

 Developed by IETF to replace RIP

Link State Info of Other Routers

The Dijkstra algorithm is

Link State information from RouterB

Now, RouterA attaches the two graphs… 14.0.0.0/16

Link State information from RouterC

Link State information from RouterD

We obtain the following link-state information from RouterD: A C E

14.0.0.0/16 Now, RouterA attaches the two graphs…

Link State information from RouterE

Link State Info of Other Routers

The Dijkstra algorithm is

Choosing the Best Path

SPFT Results Build a Routing Table

Data link IP packet OSPF packet Data

MAC destination address

Data link IP packet OSPF packet Data

Data link IP packet OSPF packet Data

Type code for packet type (0x01 etc)

Hello, OSPF packet type 1

 Discover OSPF neighbours and establish adjacencies.

Fields in Hello packet

 Before two routers can form an OSPF neighbour

 On multi-access networks (Ethernet, NBMA) the routers

Finding best routes

 Preferred to IS-IS or RIP but not to EIGRP

 Router(config-router)#network 192.168.1.0 0.0.0.255

Choosing the Router ID

1. Use the IP address configured with the OSPF router-id

Show the router ID

 #show ip protocols (on most routers).

 Highest loopback address is used in preference to a real

OSPF router-id command

 Introduced in IOS 12.0(T) and is the first choice for

 Many networks still use the loopback address method of

Show ip ospf neighbor

Neighbor ID Pri state Dead Time Address Interface

10.3.3.3 1 FULL/ 00:00:30 192.168.10.6 Serial0/1

10.2.2.2 1 FULL/ 00:00:33 192.168.10.2 Serial0/0

Other show commands

 OSPF does not summarise to class boundaries by

 The OSPF specification says that cost is the metric, does

Faster than 100 Mbps

 By default, the cost metric for all interfaces operating at

Serial link bandwidths

 Serial links often have a default bandwidth of T1 (1.544

Configure the cost directly

 Alternative to configuring the bandwidth:

Point to point network

 Networks where there could possibly be more than 2

 Not efficient if they every router becomes fully adjacent to

DROther DROther DROther

 DR then sends LSUs to all routers

Router detects change

Update all routers

Recalculate routing table

 Each router sends LSAck acknowledgement

OSPF network types

Network type Characteristics DR election?

Broadcast multiaccess Ethernet, token ring, Yes

Background and features of OSPF

Developed by IETF to replace RIP

Discover OSPF neighbours and establish adjacencies.

Before two routers can form an OSPF neighbour

On multi-access networks (Ethernet, NBMA) the routers

Preferred to IS-IS or RIP but not to EIGRP

Router(config-router)#network 192.168.1.0 0.0.0.255

#show ip protocols (on most routers).

Highest loopback address is used in preference to a real

Introduced in IOS 12.0(T) and is the first choice for

Many networks still use the loopback address method of

OSPF does not summarise to class boundaries by

The OSPF specification says that cost is the metric, does

By default, the cost metric for all interfaces operating at

Serial links often have a default bandwidth of T1 (1.544

Alternative to configuring the bandwidth:

Networks where there could possibly be more than 2

Not efficient if they every router becomes fully adjacent to

DR then sends LSUs to all routers

Each router sends LSAck acknowledgement

Happens when routers first discover each other using

An election has taken place and a DR and BDR have

Routers that are not elected as DR or BDR are called

Router(config-if)#ip ospf priority {0 - 255}

Router(config-if)#ip ospf hello-interval seconds

What is the importance of router-id in OSPF?