Quiz

1. E-bit set to zero in in a Hello packet means

-----------------------
2. Router ID is 0.0.0.0 in a Hello packet
means -----------------------
3. All SPF Router address -------------
4. An OSPF Router with P=0 means ----------
 Quiz cont…
5. Down, Attempt, Init, 2-way, Exstart,
Exchange, loading & Full OSPF adjancies
states, When will you see the Attempt
state?
6. What are the six conditions under which
OSPF adjacencies are formed?
7. What are the three main techniques that
are used for LSA sequence?
 Quiz cont…
8. A typical MaxAgeDiff value is ----------
9. Max age of ------ hour and an LSRefresh
time of ---- minutes
10.Down, Point-to-point, waiting, DR, Backup,
DR Other, Loopback are OSPF interface
states, What do you see a Waiting state? &
What happens in a Waiting state?
11.IP Protocol number for OSPF is ----
 Quiz cont…
12. Explain LSA Types from 1 to 11
13.Explain the OSPF Hello packet options
DN, O, DC, EA, N/P, MC, E, T
14.Explain OSPF DD packet options:
I, M, MS
15.The MTU value of 0X000 is used on a
-----------
 Quiz cont…
16.Explain Router LSA bits V, E, and B
17.OSPF router LSA field Link Type 1,2,3, &
4 are -----------
18.What are the four path types available in
OSPF?
 OSPF

• Open Shortest Path First protocol

defined in RFC 2328
• OSPF is classified as an Interior
Gateway Protocol (IGP).
• Developed by the OSPF working group
of the Internet Engineering Task Force
(IETF).
 Evolution of OSPF
• OSPF version 1, published as Request for
Comments (RFC) 1131 in October 1989 by
John T. Moy and the OSPF Working
Group.
• Between that time and the release of this
RFC in July of 1991, OSPF version 2 was
developed
• OSPF made use of the famous Dijkstra
Algorithm.
OSPF evolution timeline.
 Dijkstra Algorithm

• This algorithm was not new and had not

been created specifically to fill the demand
of the networking community. In reality,
this mathematical formula was initially
created to demonstrate the ARMAC
computer in 1956, over 30 years before
OSPF was ever considered!
 Edsger W. Dijkstra
• Edsger W. Dijkstra was born in 1930 in the city of
Rotterdam in the Netherlands. Born into a
scientifically oriented family, he quickly excelled
and achieved his Ph.D. in Computer Science in
1959 from the University of Amsterdam, Holland.
By the time he was 32, he had achieved a full
professorship in mathematics at the Eindhoren
University. His achievement remains extremely
impressive to this day.
 OSPF Terminology

Interfaces

Token
Ring
 OSPF Terminology

Neighbors
Interfaces

Token
Ring
 OSPF Terminology

Neighbors
Interfaces
Cost = 10

Token
Ring
Cost = 1785 Cost = 6
 OSPF Terminology

Neighbors
Interfaces
Area 1 Cost = 10
Area 0
Token
Ring
Cost = 1785 Cost = 6
 OSPF Terminology
Autonomous System

Neighbors
Interfaces
Area 1 Cost = 10
Area 0
Token
Ring
Cost = 1785 Cost = 6
 OSPF Terminology
Autonomous System

Neighbors
Interfaces
Area 1 Cost = 10
Area 0
Token
Ring
Cost = 1785 Cost = 6

Neighborship
Database
Lists Neighbors
 OSPF Terminology
Autonomous System

Neighbors
Interfaces
Area 1 Cost = 10
Area 0
Token
Ring
Cost = 1785 Cost = 6

Neighborship Topology
Database Database
Lists Neighbors Lists All Routes
 OSPF Terminology
Autonomous System

Neighbors
Interfaces
Area 1 Cost = 10
Area 0
Token
Ring
Cost = 1785 Cost = 6

Neighborship Topology Routing

Database Database Table
Lists Neighbors Lists All Routes Lists Best Routes
 AREA
OSPF allows collections of contiguous
networks and hosts to be grouped
together. Such a group, together with
the routers having interfaces to any one
of the included networks, is called an
area.
Characteristics of an OSPF Area

• Areas contain a group of contiguous hosts and

networks
• Routers have a per area topological database
and run the same SPF algorithm
• Each area is connected to the backbone area
known as area 0
• Virtual links can be used
• Allows for inter-area routing
 Types of Areas
• Backbone Area
• Non-Backbone
• Stub Area
• Totally Stubby Area
• NSSA
Types of Areas
Types of Areas
Backbone
Area 0

Interconnects
areas;
accepts all
LSAs.
 Types of Areas
Stub Area Backbone
Area 0

Interconnects
Does not accept
areas;
external LSAs.
accepts all
LSAs.
 Types of Areas
Stub Area Backbone Totally Stubby
Area 0 Area

Interconnects
Does not accept Does not accept
areas;
external LSAs. external or
accepts all
LSAs. summary LSAs.
 Backbone Area
A backbone area is the logical and physical structure
for the Autonomous System and is attached to
multiple areas.

The backbone is responsible for distributing routing

information between non-backbone areas.

The backbone must be contiguous, but it need not be

physically contiguous; backbone connectivity can be
established and maintained through virtual links.
 Using Stub and Totally
Stubby Areas
RIP
Area 50—Stub Area 0 Area 1—Totally Stubby

Internal ABR1 ASBR BBone ABR2 Internal

Non-Cisco
Router

afadjfjorqpoeru afadjfjorqpoeru afadjfjorqpoeru

afadjfjorqpoeru 39547439070713 39547439070713
39547439070713 39547439070713

Summary Summary Summary Default

afadjfjorqpoeru afadjfjorqpoeru afadjfjorqpoeru afadjfjorqpoeru

39547439070713 39547439070713 39547439070713 39547439070713

Default External External Default

 Stub area
• An area could be referred to as a stub area
when there is a single exit point from that
area, or if external routing to outside of the
area does not have to take an optimal path.
• Routing from these areas to the outside
world is based on a default route. They do
contain inter-area and intra-area routes.
• Stub areas should have one Area Border
router.
 Stub Area Restrictions
• Stub areas cannot be used as a transit area for virtual links.
• An ASBR cannot be internal to a stub area.
• OSPF allows certain areas to be configured as stub areas.
• External networks, such as those redistributed from other protocols into
OSPF, are not allowed to be flooded into a stub area.

Note
All OSPF routers inside a stub area have to be configured as stub routers
because whenever an area is configured as stub, all interfaces that belong to
that area will start exchanging hello packets with a flag that indicates that
the interface is stub. Actually this is just a bit in the hello packet (“E” bit)
that gets set to 0. All routers that have a common segment have to agree on
that flag. If the routers don’t agree, then they will not become neighbors and
routing will not take effect.
 Stub and Totally
Stubby Area Restrictions
Area 2
0.0.0.0
R3
R4

Single Exit Point

X
External
AS

– Typically a single exit point into area; if multiple exit points,

suboptimal paths may be selected
– An ASBR cannot be internal to stub
– Area is not the backbone Area 0
– Virtual links are not allowed
Virtual Links
 Meeting the Backbone
Area Requirements
Area 0
(Backbone)

Virtual Link
Area 1 Area 2
Transit
Area
Area
Area33

– Backbone is the center of communication

– Virtual links provide path to backbone
– Avoid configuring virtual links if possible
Meeting the Backbone
Area Requirements
Area 1 Area 2
Transit Area

Area 0 Area 0
Area 3

•Link discontiguous backbone

– Merged networks
– Redundancy
– Point-to-point links
 Area Design Rules

• A backbone area must be present

• All areas must have a connection to backbone,
even stub areas
• The backbone area must be contiguous
 Router ID
• Every OSPF Router must be identified by a
unique Router ID.
• Manually configured IP Address
• Highest IP Address of any Interface
• If no interface exists, then Router ID is set
to 0.0.0.0
 Basic OSPF Configuration
• Enable OSPF
• Add Network to be advertised
• Add an area
• Verify the configuration
 OSPF Timers
• Hello Interval - 10 Seconds - Broadcast
Multi Access
• Poll Interval - 120 Seconds - Non -
Broadcast Multi Access
• LSA Retransmit Interval - 5 Seconds
• Dead Interval - 40 Seconds
Types of OSPF Routers

Area 1 Backbone Area 0 Area 2

External
AS
Types of OSPF Routers
Area 1 Backbone Area 0 Area 2

Internal
Routers

Internal
Routers

External
AS
Types of OSPF Routers
Area 1 Backbone Area 0 Area 2

Backbone/
Internal
Internal Routers
Routers

Internal
Routers

External
AS
Types of OSPF Routers
Area 1 Backbone Area 0 Area 2
ABR and
Backbone
Router Backbone/
Internal
Internal Routers
Routers

Internal
Routers

ABR and
Backbone
Router
External
AS
Types of OSPF Routers
Area 1 Backbone Area 0 Area 2
ABR and
Backbone
Router Backbone/
Internal
Internal Routers
Routers

Internal
Routers

ASBR and ABR and

Backbone Backbone
Router Router
External
AS
 Types of OSPF Routers
• Internal Routers (IRs) are routers whose
directly connected networks all belong to
the same OSPF area. These types of routers
will have a single link-state database
because they only belong to one area.
 Types of OSPF Routers
• ABRs are attached to multiple OSPF areas, so there
can be multiple ABRs within a network. ABRs will
have multiple copies of the link-state database
because of this. The router will run one database for
each area that will be summarized, and then it will
be presented to the backbone for distribution to
other areas.
• ABR only sends summarized information to the
backbone area, and in order to be considered an
ABR the router must be connected to the backbone.
 Types of OSPF Routers
• ASBRs are connected to more than one
Autonomous System and exchange routing
information with routers in another autonomous
system. ASBRs advertise the exchanged external
routing information throughout their autonomous
system. Every router within an autonomous
system will know how to get to each ASBR with
its AS. ASBRs run both OSPF and another routing
protocol, such as RIP or BGP.
 Types of OSPF Routers
• BRs typically have an interface to the
backbone area and two other OSPF areas.
Backbone Routers do not have to have
ABRs. Routers that only have interfaces
connecting them to the backbone are also
considered BRs.
 Operations of OSPF
• OSPF speaking router sends hello packets out of all OSPF
enabled interface. If any other router on OSPF enable
interface is also running OSPF agrees certain parameter
specified in hello packet then they becomes neighbor. This
relationship is known as adjacencies.
• Each router sends LSAs over all adjacencies. Each LSAs
describes router’s link_id, state of link & cost of link. The links
may be stub, to other OSPF routers, to networks in another
areas, or to external networks. OSPF defines multiple LSA
types.
• Each OSPF running router receives LSA from neighbor records
the LSA in LSDB, & sends a copy of same LSA to all of its
neighbor on another data link segment. By flooding LSAs within
the area, all OSPF routers in single area have identical LSDB.
• After adding LSA to database OSPF router runs SPF algorithm to
calculate a loop free with shortest path to every known
destination, with itself in the root. After passing from SPF
algorithm routes are installed in global routing table.
Different network types within
which OSPF operates
 Point-to-Point Networks
• Point-to-point networks, such as a T1,
DS-3, or SONET link, connect a single
pair of routers.
• Valid neighbors on point-to-point
networks will always become adjacent.
• The destination address of OSPF
packets on these networks will always
be the reserved class D address
224.0.0.5, known as AllSPFRouters
 Broadcast Networks
• Broadcast networks, such as Ethernet,
Token Ring, and FDDI, might be better
defined as broadcast multi-access
networks.
• Broadcast networks are multi-access in
that they are capable of connecting more
than two devices, and they are broadcast
in that all attached devices can receive a
single transmitted packet.
• OSPF routers on broadcast networks will
elect a DR and a BDR.
 Broadcast Networks cont..

• Hello packets are multicast with the All

OSPFRouters destination address 224.0.0.5, as are
all OSPF packets originated by the DR and BDR.
• The destination Media Access Control (MAC)
identifier of the frames carrying these packets is
0100.5E00.0005.
• All other routers will multicast link-state update
and link-state acknowledgment packets
(described later) to the reserved class D address
224.0.0.6, known as AllDRouters. The destination
MAC identifier of the frames carrying these
packets is 0100.5E00.0006.
 NBMA Topology
X.25
Frame Relay
ATM

Full Mesh

Partial Mesh

Star (Hub and Spoke)

 Non-Broadcast MA Networks
• NBMA networks, such as X.25, Frame Relay,
and ATM, are capable of connecting more than
two routers but have no broadcast capability.
• A packet sent by one of the attached routers
would not be received by all other attached
routers.
• Extra configuration might be necessary for
routers on these networks to acquire their
neighbors.
• OSPF routers on NBMA networks elect a DR and
BDR, and all OSPF packets are unicast.
 Point-to-MultiPoint,
• Point-to-multipoint networks are a
special configuration of NBMA networks
in which the networks are treated as a
collection of point-to-point links.
• Routers on these networks do not elect
a DR and BDR, and the OSPF packets
are unicast to each known neighbor.
 Designated Routers and
Backup Designated Routers
 Why a DR and BDR
• Multiaccess networks present two problems
for OSPF, relating to the flooding of LSAs
• The formation of an adjacency between every
attached router would create many
unnecessary LSAs
• If n is the number of routers on a multiaccess
network, there would be n(n - 1)/2 adjacencies
• Each router would flood n 1 LSAs for its
adjacent neighbors, plus one LSA for the
network, resulting in n2 LSAs originating from
the network.
 DR and BDR
DR BDR

– Hellos elect DR and BDR to represent segment

– Each router then forms adjacency with DR
and BDR
Electing the DR and BDR
P=3 P=2

DR BDR

Hello

P=1 P=1 P=0

– Hello packets exchanged via IP multicast

– Router with highest OSPF priority elected
 Pre Election
• Each multi-access interface of each router
has a Router Priority, which is an 8-bit
unsigned integer ranging from 0 to 255.
• Routers with a priority of 0 are ineligible
to become the DR or BDR.
• When an interface first becomes active on
a multi-access network, it sets the DR and
BDR to 0.0.0.0. It also sets a wait timer
with a value equal to the
RouterDeadInterval.
 DR and BDR Election
1. After two-way communication has been
established with one or more neighbors, examine
the Priority, DR, and BDR fields of each neighbor's
Hello. List all routers eligible for election (that is,
routers with priority greater than 0 and whose
neighbor state is at least two-way); all routers
declaring themselves to be the DR (their own
interface address is in the DR field of the Hello
packet); and all routers declaring themselves to be
the BDR (their own interface address is in the BDR
field of the Hello packet). The calculating router
will include itself on this list unless it is ineligible.
 DR and BDR Election
2. From the list of eligible routers, create a
subset of all routers not claiming to be the
DR (routers declaring themselves to be the
DR cannot be elected BDR).
3. If one or more neighbors in this subset
include its own interface address in the BDR
field, the neighbor with the highest priority
will be declared the BDR. In a tie, the
neighbor with the highest Router ID will be
chosen.
 DR and BDR Election
4. If no router in the subset claims to be the
BDR, the neighbor with the highest priority
will become the BDR. In a tie, the neighbor
with the highest Router ID will be chosen.
5. If one or more of the eligible routers
include their own address in the DR field,
the neighbor with the highest priority will
be declared the DR. In a tie, the neighbor
with the highest Router ID will be chosen.
 DR and BDR Election
6. If no router has declared itself the
DR, the newly elected BDR will
become the DR.
 Post Election
• After the DR and BDR have been
elected, the other routers (known as
DRothers) will establish adjacencies
with the DR and BDR only
• All routers continue to multicast Hellos
to the AllSPFRouters address 224.0.0.5
so that they can track neighbors
 Post Election
• DRothers multicast update packets
to the AllDRouters address
224.0.0.6. Only the DR and BDR
will listen to this address; in turn,
the DR will flood the updates to the
DRothers on 224.0.0.5.
 Maintaining Routing Information

Link-State Change
DR

1 LSU

x A
B

Router A notifies all OSPF DRs on 224.0.0.6

 Maintaining Routing Information
2
Link-State Change
DR
LSU

1 LSU

x A
B

• Router A notifies all OSPF DRs on 224.0.0.6

• DR notifies others on 224.0.0.5
 Maintaining Routing Information

2
Link-State Change
DR
LSU

1 LSU

x
3
B
A
LSU

• Router A notifies all OSPF DRs on 224.0.0.6

• DR notifies others on 224.0.0.5
 Maintaining Routing Information
2
Link-State Change
DR
LSU

4 I need to update
my routing table.
1 LSU

x
3
B
A
LSU

• Router A notifies all OSPF DRs on 224.0.0.6

• DR notifies others on 224.0.0.5
 Neighbor
Adjacency States
 Neighborship
D E

Hello

B A C
Router ID
afadjfjorqpoeru
39547439070713 Neighbors
*
Hello/dead intervals

Area-ID*
Router priority
Hello DR IP address
BDR IP address
Authentication password *
*
Stub area flag

* Entry must match on neighboring routers

 Neighborship (cont.)
D E

Hello

B A C
Router ID
afadjfjorqpoeru
39547439070713 Neighbors
*
Hello/dead intervals

Area-ID*
Router priority
Hello DR IP address
BDR IP address
Authentication password *
*
Stub area flag

* Entry must match on neighboring routers

 Adjacency States

• Down
• Attempt
• Init
• 2-way
• Exstart
• Exchange
• Loading
• Full
 Exchange Process

172.16.5.1/24 172.16.5.2/24
A B
E0 E1
Down State
 Exchange Process

172.16.5.1/24 172.16.5.2/24
A B
E0 E1
Down State
I am router ID 172.16.5.1 and I see no one.

Init State

Router B
Neighbors List
172.16.5.1/24, int E1
 Exchange Process
172.16.5.1/24 172.16.5.2/24
A B
E0 E1
Down State
I am router ID 172.16.5.1 and I see no one.

Init State

Router B
Neighbors List
172.16.5.1/24, int E1
I am router ID 172.16.5.2, and I see 172.16.5.1.
 Exchange Process
172.16.5.1/24 172.16.5.2/24
A B
E0 E1
Down State
I am router ID 172.16.5.1 and I see no one.

Init State

Router B
Neighbors List
172.16.5.1/24, int E1
I am router ID 172.16.5.2, and I see 172.16.5.1.

Router A
Neighbors List
172.16.5.2/24, int E0
Two-Way State
 Discovering Routes
DR
E0 E0
172.16.5.1 172.16.5.3
afadjfjorqpoeru
Exstart State
39547439070713

Hello I will start exchange because I have router ID 172.16.5.1.

afadjfjorqpoeru

No, I will start exchange because I have a

39547439070713

higher router ID. Hello

 Discovering Routes
DR
E0 E0
172.16.5.1 172.16.5.3
afadjfjorqpoeru
Exstart State
39547439070713

Hello I will start exchange because I have router ID 172.16.5.1.

afadjfjorqpoeru

No, I will start exchange because I have a

39547439070713

higher router ID. Hello

Exchange State afadjfjorqpoeru

39547439070713

Here is a summary of my link-state database.

DBD
afadjfjorqpoeru
39547439070713

DBD Here is a summary of my link-state database.

 Discovering Routes
DR
E0 E0
172.16.5.1 172.16.5.3
afadjfjorqpoeru
39547439070713
afadjfjorqpoeru
39547439070713

LSAck Thanks for the information!

LSAck
 Discovering Routes
DR
E0 E0
172.16.5.1 172.16.5.3
afadjfjorqpoeru
39547439070713
afadjfjorqpoeru
39547439070713

LSAck Thanks for the information!

LSAck

afadjfjorqpoeru
39547439070713
Loading State

LSR I need the complete entry for network 172.16.6.0/24.

afadjfjorqpoeru
39547439070713

Here is the entry for network 172.16.6.0/24. LSU

afadjfjorqpoeru
39547439070713

LSAck Thanks for the information!

 Discovering Routes
DR
E0 E0
172.16.5.1 172.16.5.3
afadjfjorqpoeru
39547439070713
afadjfjorqpoeru
39547439070713

LSAck Thanks for the information!

LSAck

afadjfjorqpoeru
39547439070713
Loading State

LSR I need the complete entry for network 172.16.6.0/24.

afadjfjorqpoeru
39547439070713

Here is the entry for network 172.16.6.0/24. LSU

afadjfjorqpoeru
39547439070713

LSAck Thanks for the information!

Full State
 Adjacency States :Down
• Down: The initial state of a neighbor
conversation indicates that no Hellos have
been heard from the neighbor in the last
RouterDeadInterval.
• Hellos are not sent to down neighbors
unless those neighbors are on NBMA
networks; in this case, Hellos are sent
every PollInterval.
• If a neighbor transitions to the Down state
from some higher state, the link state
Retransmission, Database Summary, and
Link State Request lists are cleared.
 Adjacency States :Attempt
• Attempt: This state applies only to
neighbors on NBMA networks, where
neighbors are manually configured. A
DR-eligible router transitions a neighbor
to the Attempt state when the interface
to the neighbor first becomes Active or
when the router is the DR or BDR.
• A router sends packets to a neighbor in
Attempt state at the HelloInterval
instead of the PollInterval.
 Adjacency States :Init
• Init: This state indicates that a Hello
packet has been seen from the neighbor
in the last RouterDeadInterval, but two-
way communication has not yet been
established.
• A router includes the Router IDs of all
neighbors in this state or higher in the
Neighbor field of the Hello packets.
 Adjacency States :2-Way
• 2-Way This state indicates that the router
has seen its own Router ID in the Neighbor
field of the neighbor's Hello packets, which
means that a bidirectional conversation has
been established.
• On multi-access networks, neighbors must
be in this state or higher to be eligible to be
elected as the DR or BDR.
• The reception of a Database Description
packet from a neighbor in the init state also
causes a transition to 2-Way.
 Adjacency States :ExStart
• ExStart In this state, the router and its
neighbor establish a master/slave
relationship and determine the initial
DD sequence number in preparation for
the exchange of Database Description
packets.
• The neighbor with the highest Router ID
becomes the master.
 Adjacency States :Exchange
• Exchange The router sends Database
Description packets describing its entire
link-state database to neighbors that
are in the Exchange state.
• The router may also send Link State
Request packets, requesting more
recent LSAs, to neighbors in this state.
 Adjacency States :Loading
• Loading The router sends Link
State Request packets to
neighbors that are in the Loading
state, requesting more recent LSAs
that have been discovered in the
Exchange state but have not yet
been received.
 Adjacency States :Full
• Full Neighbors in this state are
fully adjacent, and the adjacencies
appear in Router LSAs and
Network LSAs.
The six conditions under which OSPF
adjacencies are formed

• Network connectivity is point-to-point

• Network connectivity is achieved through a virtual link
• The router is the Designated Router (DR)
• The neighboring router is the DR
• The router is the backup DR
• The neighboring router is the backup DR
 Link State Flooding

• After the adjacencies are established, the

routers may begin sending out LSAs. As the
term flooding implies, the advertisements
are sent to every neighbor. In turn, each
received LSA is copied and forwarded to
every neighbor except the one that sent the
LSA. This process is the source of one of
link state's advantages over distance vector.
 Link State Flooding

• The flooding process is the most complex

piece of a link state protocol.
• Two procedures are vitally important to the
flooding process: sequencing and aging.
 sequencing
•Sequence number is used to find the
most resent LSA received on an interface.

•Three main technique that are used to

sequence the numbers are.
•Linear Sequence Number Spaces
•Circular Sequence Number Spaces
•Lollipop-Shaped Sequence Number Spaces
 Aging

• The LSA format should include a field for the age

of the advertisement. When an LSA is created, the
router sets this field to zero. As the packet is
flooded, each router increments the age of the
advertisement.
 Aging

• A typical MaxAgeDiff value is 15 minutes

• This process of aging adds another layer of
reliability to the flooding process. The protocol
defines a maximum age difference (MaxAgeDiff)
value for the internetwork. A router may receive
multiple copies of the same LSA with identical
sequence numbers but different ages. If the
difference in the ages is lower than the
MaxAgeDiff, it is assumed that the age difference
was the result of normal network latencies
 Maximum age

• The age of an LSA continues to be

incremented as it resides in a link state
database. If the age for a link state record is
incremented up to some maximum age
(MaxAge)—again defined by the specific
routing protocol—the LSA, with age field
set to the MaxAge value, is flooded to all
neighbors and the record is deleted from the
databases.
 Link state refresh time
• If the LSA is to be flushed from all databases when
MaxAge is reached, there must be a mechanism to
periodically validate the LSA and reset its timer
before MaxAge is reached. A link state refresh time
(LSRefeshTime) is established; when this time
expires, a router floods a new LSA to all its
neighbors, who will reset the age of the sending
router's records to the new received age. OSPF
defines a MaxAge of 1 hour and an LSRefreshTime
of 30 minutes.
• Note : LSRefreshTime, MaxAge, and MaxAgeDiff are OSPF constants.
 Maintaining LSA Information
LSU
Is entry in
LSA link-state
database?

No
Add to database

Send LSAck
to DR

Flood LSA

Run SPF to calculate

new routing table

End
 Maintaining LSA Information
LSU
Is entry in Is seq. #
LSA link-state Ignore LSA
database? the same?
Yes Yes

No
Add to database

Send LSAck
to DR

Flood LSA

Run SPF to calculate

new routing table

End
 Maintaining LSA Information
LSU
Is entry in Is seq. #
LSA link-state Ignore LSA
database? the same?
Yes Yes

No
No
Add to database
Is seq. #
higher?
Send LSAck
to DR No

Flood LSA Send LSU

with newer
Run SPF to calculate information to
new routing table source

End End
 Maintaining LSA Information
LSU
Is entry in Is seq. #
LSA link-state Ignore LSA
database? the same?
Yes Yes

No
No
A Add to database Go
Is seq. #
to
higher? Yes
Send LSAck A
to DR No

Flood LSA Send LSU

with newer
Run SPF to calculate information to
new routing table source

End End
 OSPF Interface states
• An OSPF-enabled interface will
transition through several states before
it becomes fully functional.
– Down
– Point-to-Point
– Waiting
– DR
– Backup
– DRother
– Loopback
 Interface states: Down
Down This is the initial interface
state. The interface is not
functional, all interface parameters
are set to their initial values, and
no protocol traffic is transmitted or
received on the interface.
Interface states: Point-to-point
Point-to-Point This state is applicable
only to interfaces connected to point-to-
point, point-to-multipoint, and virtual
link network types. When an interface
transitions to this state, it is fully
functional. It will begin sending Hello
packets every HelloInterval and will
attempt to establish an adjacency with
the neighbor at the other end of the
link.
 Interface states:Waiting
• Waiting This state is applicable only to
interfaces connected to broadcast and
NBMA network types. When an interface
transitions to this state, it will begin
sending and receiving Hello packets and
will set the wait timer. The router will
attempt to identify the network's DR
and BDR while in this state.
 Interface states: DR
• DR In this state, the router is the
DR on the attached network and
will establish adjacencies with the
other routers on the multi-access
network.
 Interface states: Backup
• Backup In this state, the router is
the BDR on the attached network,
and will establish adjacencies with
the other routers on the multi-
access network.
 Interface states: DRother
• DRother In this state, the router is
neither the DR nor the BDR on the
attached network. It will form
adjacencies only with the DR and
BDR, although it will track all
neighbors on the network.
 Interface states: Loopback
• Loopback In this state, the
interface is looped back via
software or hardware. Although
packets cannot transit an interface
in this state, the interface address
is still advertised in Router LSAs,
so that test packets can find their
way to the interface.
OSPF Header
OSPF packet encapsulations
 OSPF Header and packet
Types
All OSPF protocol packets share a
common protocol header.
There are several OSPF packet types
– Hello Packet
– Database Description Packet
– Link-State Request Packet
– Link-State Update Packet
– Link-State Acknowledgment Packet
OSPF Common Packet
Header
 OSPF Packet Header
Version (1 octet) This field details the current version
of OSPF used by the local router. It is set to a value of 2,
the default value.
Type (1 octet) This field specifies the type of OSPF
packet. Possible values include:
 1- Hello packet
 2- Database descriptor
 3- Link-state request
 4- Link-state update
 5- Link-state acknowledgment
Packet Length (2 octets) This field displays the total
length, in octets, of the OSPF packet.
.
 OSPF Packet Header
Router ID (4 octets) The router ID of the advertising
router appears in this field.
Area ID (4 octets) This field contains the 32-bit area ID
assigned to the interface used to send the OSPF packet.
Checksum (2 octets) This field displays a standard IP
checksum for the entire OSPF packet, excluding the 64-
bit authentication field.
Authentication Type (2 octets) The specific type of
authentication used by OSPF is encoded in this field.
Possible values are:
 0-Null authentication
 1-Simple password
 2-MD5 cryptographic authentication
Authentication (8 octets) This field displays the authentication data to
verify the packet's integrity.
OSPF Packet Types
 OSPF Packet Types
TypePacket Name Protocol
Function
1 Hello Discover /
Maintain
Neighbors
2 Database Summarize
Description Database
Contents
OSPF Packet Types cont..
TypePacket Name Protocol
Function
3 Link State Database
Request Download
4 Link State Database
Update Update
5 Link State Flooding
Ack Ack
Type 1 - OSPF Hello Packet
 Hello Packet
• Hello is sent to establish and maintain a neighbor
relationship
• Hello packets are sent out all configured interfaces
and await a response
• Hello packet, type code 1, is addressed to the
AllSPFRouters multicast address of 224.0.0.5 for
broadcast and point-to-point connections
• All other type networks unicast Hello.
OSPF Hello Packet
 OSPF Hello Packet
• Version. Identifies the OSPF version running on the
router originating the hello packet
• Packet length. Provides the total length of the hello
packet
• Router ID. Contains the originating router identification
number of the appropriate interface
• Area ID. Contains the area number to which the
originating router belongs
• Checksum. This section is, of course, used to ensure the
packets integrity has not been comprised during
transmission.
• Network Mask (4 octets) This field contains the subnet
mask of the advertising OSPF interface. Unnumbered point-
to-point interfaces and virtual links set this value to 0.0.0.0.
• Hello Interval (2 octets) This field displays the value of the
hello interval requested by the advertising router. Possible
values range from 1 to 255, with a default value of 10
seconds.
 OSPF Hello Packet
Options (1 octet) The local router advertises its capabilities in
this field. Each bit in the Options field represents a different
function. The various bit definitions are:
Bit 7 The DN bit is used for loop prevention in a Virtual Private Network (VPN) environment.
An OSPF router receiving an update with the bit set does not forward that update.
Bit 6 The O bit indicates that the local router supports opaque LSAs.
Bit 5 The DC bit indicates that the local router supports Demand Circuits.
Bit 4 The EA bit indicates that the local router supports the External Attributes LSA for carrying
BGP information in an OSPF network.
Bit 3 The N/P bit describes the handling and support of not-so-stubby LSAs.
Bit 2 The MC bit indicates that the local router supports multicast OSPF LSAs.
Bit 1 The E bit describes the handling and support of external LSAs.
Bit 0 The T bit indicates that the local router supports TOS routing functionality.
 OSPF Hello Packet
• Router Priority (1 octet) This field contains the priority of the local router.
The value is used in the election of the designated router and backup
designated router. Possible values range from 0 to 255, with a default value
of 128.
• Router Dead Interval (4 octets) This field shows the value of the dead
interval requested by the advertising router. Possible values range from 1 to
65,535.
• Designated Router (4 octets) The interface address of the current
designated router is displayed in this field. A value of 0.0.0.0 is used when
no designated router has been elected.
• Backup Designated Router (4 octets) The interface address of the current
backup designated router is displayed in this field. A value of 0.0.0.0 is used
when no backup designated router has been elected.
• Neighbor (Variable) This field displays the router ID of all OSPF routers
for which a hello packet has been received on the network segment.
 Database Description Packet
• After discovering its neighbors, the local router
begins to form an adjacency with each neighbor.
• This adjacency process requires that each router
advertise its local database information.
• The DD packet, type code 2, summarizes the local
database by sending LSA headers to the remote
router.
• The remote router analyzes these headers to
determine whether it lacks any information within
its own copy of the link-state database
DD Packet
 DD Packet

• Interface MTU (2 octets) This field contains the

MTU value, in octets, of the outgoing interface.
When the interface is used on a virtual link, the
field is set to a value of 0x0000.
• Options (1 octet) The local router advertises its
capabilities in this field. The bit values are
discussed in the "Hello Packet"
 DD Packet
• Flags (1 octet) This field provides an OSPF router with the capability to
exchange multiple DD packets with a neighbor during an adjacency
formation.
• The first five bits of the next octet are unused and are
always set to 00000b. Bits 3 through 7 These bit values
are currently undefined and must be set to a value of 0.
– Bit 2 The I bit, or Initial bit, designates whether this DD packet
is the first in a series of packets. The first packet has a value of
1, while subsequent packets have a value of 0.
– Bit 1 The M bit, or More bit, informs the remote router whether
the DD packet is the last in a series. The last packet has a
value of 0, while previous packets have a value of 1.
– Bit 0 The MS bit, or Master/Slave bit, is used to indicate which
OSPF router is in control of the database synchronization
process. The master router uses a value of 1, while the slave
uses a value of 0.
 DD Packet
• DD Sequence Number (4 octets) This field guarantees
that all DD packets are received and processed during
the synchronization process through use of a sequence
number. The Master router initializes this field to a
unique value in the first DD packet, with each
subsequent packet being incremented by 1.
• LSA Headers (Variable) This field carries the LSA
headers describing the local router's database
information. Each header is 20 octets in length and
uniquely identifies each LSA in the database. Each DD
packet may contain multiple LSA headers.
 Designated Router
The Designated Router (highest Router
Priority) originates a network-LSA on
behalf of the network.
The Designated Router becomes
adjacent to all other Routers on the
network.
 Link-State Request Packet
• As Database Description packets are
received during the database
synchronization process, a router takes note
of any listed LSAs that are not in its database
or are more recent than its own LSA.
• These LSAs are recorded in the Link State
Request list.
• The router then sends one or more Link State
Request packets asking the neighbor for its
copy of the LSAs on the Link State Request
list.
Link-State Request Packet
 Link-State Request Packet
• Link-State Type (4 octets) This field
displays the type of LSA being requested.
• Link-State ID (4 octets) This field encodes
information specific to the LSA. Each
different type of advertisement places
different information here.
 Link State Update Packet
• The Link State Update packet, shown in, is
used in the flooding of LSAs and to send
LSAs in response to Link State Requests.
• A Link State Update packet, carrying one
or many LSAs, carries the LSAs only to the
originating router's connected neighbors.
• The receiving neighbor is responsible for
re-encapsulating the appropriate LSAs in
new LS Update packets for further
flooding to its own neighbors.
Link State Update Packet
 Link State Update Packet

• Number of LSAs (4 octets) This field displays

the number of LSAs carried within the link-state
update packet.
• Link-State Advertisements (Variable) The
complete LSA is encoded within this variable-
length field. Each type of LSA has a common
header format along with specific data fields to
describe its information. A link-state update may
contain a single LSA or multiple LSAs.
 Link-State Ack Packet
• Link State Acknowledgment packets are used
to make the flooding of LSAs reliable
• Each LSA received by a router from a neighbor
must be explicitly acknowledged in a Link State
Acknowledgement packet.
• The LSA being acknowledged is identified by
including its header in the LS ACK packet, and
multiple LSAs can be acknowledged in a single
packet.
• LS ACK packet consists of nothing more than an
OSPF packet header and a list of LSA headers.
 Link State
Acknowledgment packet
 Issues with Maintaining a Large
OSPF Network
OSPF
The SPF is running too
often for me to route.
I am only receiving
LSAs, no data.
OSPF

OSPF OSPF OSPF

My routing table is too big,

and I am running low on memory.
 The Solution: OSPF
Hierarchical Routing
Area 0

Area 1 Area 2

Autonomous System
– Consists of areas and autonomous systems
– Minimizes routing update traffic
 OSPF Multiarea Components
Routers LSAs Areas
afadjfjorqpoeru
39547439070713

Area 0
Internal Type 1
I am a backbone.
afadjfjorqpoeru
39547439070713

Type 2
ABR Area 1
afadjfjorqpoeru
39547439070713
I am standard.
Type 3/4

ASBR
afadjfjorqpoeru
39547439070713
Area 2
I am a stub.
Type 5

Backbone
LSA
LSA Header
 LSA fields
• Age is the time, in seconds, since the
LSA was originated. As the LSA is
flooded, the age is incremented by
InfTransDelay seconds at each router
interface it exits. The age is also
incremented in seconds as it resides in
a link-state database.
• Options In the LSA header specifies the
optional capabilities supported by the
portion of the OSPF domain described
by the LSA.
 LSA fields
• Type is the LSA type.
• Link State ID identifies the
portion of the OSPF domain being
described by the LSA. The specific
usage of this field varies according
to the LSA type; the descriptions of
each LSA include a description of
how the LSA uses this field.
 LSA fields
• Advertising Router is the router ID of
the router that originated the LSA.
• Sequence Number is incremented
each time a new instance of the LSA is
originated, so that other routers can
identify the most recent instance of the
LSA.
 LSA fields
• Checksum is the Fletcher checksum of
the complete contents of the LSA
except for the Age field. If the Age field
were included, the checksum would
have to be recalculated every time the
age was incremented.
• Length is the number of octets of the
LSA, including the header.
 LSA options field

•The Options field is present in every Hello and

Database Description packet and in every LSA.
•The Options field allows routers to
communicate their optional capabilities to
other routers.
 LSA options field
• DN is used with MPLS-based layer 3 Virtual
Private Networks (VPN), commonly called RFC
2547 VPNs after the RFC that specifies them.
• When a route is learned from a customer network
via OSPF, is advertised across the RFC 2547 VPN
using Multiprotocol BGP, and then is advertised
back to a customer network via OSPF, a loop can
occur in which the OSPF route is redistributed
back to the VPN provider network in BGP.
• The DN bit prevents this looping. When the DN bit
is set in a type 3, 5, or 7 LSA, the receiving router
cannot use that LSA in its OSPF route
calculations.
 LSA options field
• O is set to indicate that the originating
router supports Opaque (type 9, 10, and
11) LSAs.
• DC is set when the originating router is
capable of supporting OSPF over
demand circuits.
• EA is set when the originating router is
capable of receiving and forwarding
External Attributes LSAs.
 LSA options field
• N is used only in Hello packets. A router
sets N-bit = 1 to indicate support for
NSSA External LSAs. If N-bit = 0, the
router will not accept or send these
LSAs. Neighboring routers with
mismatched N-bits will not become
adjacent; this restriction ensures that all
routers in an area support NSSA
capabilities equally. If the N-bit = 1, the
E-bit must be 0.
 LSA options field
• P is used only in NSSA External LSA
headers. (For this reason, the N- and P-
bit can use the same position.) This bit
tells the ABR of a not-so-stubby area to
translate type 7 LSAs into type 5 LSAs.
• MC is set when the originating router is
capable of forwarding IP multicast
packets. This bit is used by MOSPF.
 LSA options field
• E is set when the originating router is capable
of accepting AS External LSAs. It will be set to
1 in all AS External LSAs and in all LSAs
originated in the backbone and nonstub areas.
E-bit = 0 in all LSAs originated within a stub
area. Additionally, the bit is used in the Hello
packet to indicate an interface's capability of
sending and receiving type 5 LSAs.
Neighboring routers with mismatched E-bits
will not become adjacent; this restriction
ensures that all routers in an area support stub
capabilities equally.
 LSA options field
• MT, when set, indicates that the
originating router supports
Multitopology OSPF (MT-OSPF).
 LSA Types
Type Description
Code
1 Router LSA
2 Network LSA
3 Network Summary LSA
4 ASBR Summary LSA
5 AS External LSA
6 Group Membership LSA
7 NSSA External LSA
Router LSA
 Router LSA
• Router LSAs are produced by every router.
This most fundamental LSA lists all of a
router's links, or interfaces, along with the
state and outgoing cost of each link. These
LSAs are flooded only within the area in
which they are originated.
• LSA is recorded in the link state database.
Router LSA
 Router LSA Field
• Link State ID for router LSAs is the originating router's
Router ID.
• V, or Virtual Link Endpoint bit, is set to one when the
originating router is an endpoint of one or more
• fully adjacent virtual links having the described area as the
transit area.
• E, or External bit, is set to one when the originating router
is an ASBR.
• B, or Border bit, is set to one when the originating router is
an ABR.
 Router LSA Field
• Number of Links specifies the number of router links the LSA
describes. The router LSA must describe all of the originating
router's links, or interfaces, to the area in which the LSA is flooded.
 Router LSA Field
Link Type describes the general type of
connection

LinkType Connection
1
Point-to-point connection to another router
2
Connection to a transit network
3
Connection to a stub network
4
Virtual link
 Router LSA Link ID
Link ID identifies the object to which the link
connects. This is dependent on the link
type, Link ID is the same as the Link State
ID in the header of the neighboring router's
LSA. During the routing table calculation,
this value is used to find the neighbor's LSA
in the link state database.
Router LSA Link ID cont..
Type Value of Link ID Field

1 Neighboring Router's Router

ID
2 IP address of Designated
Router
3 IP network/subnet Number
4 Neighboring Router's Router
 Router LSA Link Data
• Link Data also depends on the value of the
Link Type field,
Link Value of Link Data Field
Type

1 IP address of the originating router's interface to the

network.
2 IP address of the originating router's interface to the
network.
3 Network's IP address or subnet mask.

4 The MIB-II ifIndex value for the originating router's

interface.
Network-LSAs
 Network-LSAs
• Network LSAs are produced by the DR on every
multi-access network. DR represents the multi-
access network and all attached routers as a
pseudonode, or a single virtual router. In this
sense, a Network LSA represents a pseudonode
just as a Router LSA represents a single physical
router. The Network LSA lists all attached routers,
including the DR itself. Like Router LSAs,
Network LSAs are flooded only within the
originating area.
Network-LSAs
 Network-LSAs cont..
• Link State ID for Network LSAs is the IP address
of the DR's interface to the network.
• Network Mask specifies the address or subnet
mask used on this network.
• Attached Router lists the Router IDs of all routers
on the network that are fully adjacent with the DR,
and the Router ID of the DR itself. The number of
instances of this field (and hence the number of
routers listed) can be deduced from the LSA
header's Length field.
Summary-LSAs
 Summary-LSAs
• The Network Summary LSA (type 3) and the
ASBR Summary LSA (type 4) have an identical
format.
• The only difference in field contents is the Type
and the Link State ID. ABRs produce both types
of Summary LSA; Network Summary LSAs
advertise networks external to an area (including
default routes), whereas ASBR Summary LSAs
advertise ASBRs external to an area. Both types
are flooded only into a single area.
Summary-LSAs
 Summary-LSAs cont..
• Link State ID, for type 3 LSAs, is the IP address
of the network or subnet being advertised. If the
LSA is type 4, the Link State ID is the Router ID
of the ASBR being advertised.
• Network Mask is the address or subnet mask of
the network being advertised in type 3 LSAs. In
type 4 LSAs, this field has no meaning and is set
to 0.0.0.0.
Note : If a type 3 LSA is advertising a default route, both the Link State
ID and the Network Mask fields will be 0.0.0.0.
 Flooding LSUs to
Multiple Areas
Area 50 Stub
Area 1 Area 0

Internal ABR1 ABR2 Internal

BBone

afadjfjorqpoeru
39547439070713

Type 1
 Flooding LSUs to
Multiple Areas
Area 50 Stub
Area 1 Area 0

Internal ABR1 ABR2 Internal

BBone

afadjfjorqpoeru afadjfjorqpoeru afadjfjorqpoeru

39547439070713 39547439070713 39547439070713

Type 1 Type 3 Type 3

 Flooding LSUs to
Multiple Areas
RIP
Area 50 Stub
Area 1 Area 0

Internal ABR1 ABR2 Internal

BBone

afadjfjorqpoeru afadjfjorqpoeru afadjfjorqpoeru

39547439070713 39547439070713 39547439070713

Type 1 Type 3 Type 3

afadjfjorqpoeru
39547439070713 afadjfjorqpoeru
afa 39547439070713
39 djfjo
54
74 rqp
39 oe
07 r u
07
13

Ty
Type 5 pe Default
5
Flooding LSUs to
Multiple Areas
Routing Table

Intra-Area Area 1
Routes

Interarea Area 1 Area 0

Routes

External Area 1 RIP

(Non-OSPF
Routes)
Path Types
 Path Type
• Each route to a network destination will
also be classified as one of four path types.

– intra-area
– inter-area
– type 1 external
– type 2 external
 Path Type
• Intra-area paths are to destinations within
one of the router's attached areas.
• Inter-area paths are to destinations in
another area but within the OSPF
autonomous system. An interarea path,
tagged with an IA, will always pass through
at least one ABR.
 Path Type
• Type 1 external paths (E1) are to destinations
outside the OSPF autonomous system. When an
external route is redistributed into any
autonomous system, it must be assigned a metric
that is meaningful to the routing protocol of the
autonomous system. Within OSPF, the ASBR is
responsible for assigning a cost to the external
routes they advertise. Type 1 external paths have a
cost that is the sum of this external cost plus the
cost of the path to the ASBR.
Calculating Costs for Summary
and AS External Routes
Area 0
E1

R4 R3 R1
10 10

E1
1785

1785

R 3’s Cost to: AS1

AS1 (E1) via R1 = 1795
AS1 (E1) via R3 = 1785
 Area 1 Area 0
E1 E1

R5 R4 R3 R1
10 10 10

E1
1785

1785

R 5’s Cost to: R 3’s Cost to: AS1

AS1 (E1) via R1 = 1815 AS1 (E1) via R1 = 1795
AS1 (E1) via R3 = 1805 AS1 (E1) via R3 = 1785
 Path Type
• Type 2 external paths (E2) are also to
destinations outside the OSPF autonomous
system, but do not take into account the cost
of the path to the ASBR. E2 routes provide
the network administrator with the option of
telling OSPF to consider only the external
cost of an external route, disregarding the
internal cost of reaching the ASBR. OSPF
external routes are, by default, E2 paths.
Calculating Costs for Summary
and AS External Routes
Area 0
E1

R4 R3 R1
10 10

E1
1785

1785

R 3’s Cost to: AS1

AS1 (E2) via R1 = 1795
AS1 (E2) via R3 = 1785
 Calculating Costs for Summary
and AS External Routes
Area 1 Area 0
E1 E1

R5 R4 R3 R1
10 10 10

E1
1785

1785

R 5’s Cost to: R 3’s Cost to: AS1

AS1 (E2) via R1 = 1795 AS1 (E2) via R1 = 1795
AS1 (E2) via R3 = 1785 AS1 (E2) via R3 = 1785
 OSPF RFCs
• RFC 1131: OSPF Specification Version 1 (J. Moy, Oct. 1989)
• RFC 1245: OSPF Protocol Analysis (J. Moy, July 1991)
• RFC 1246: Experience with the OSPF Protocol (J. Moy, July 1991)
• RFC 1247: OSPF Version 2 [obsoletes 1131] (J. Moy, July 1991)
• RFC 1248: OSPF Version 2 Management Information Base (F. Baker & R. Coltun, July 1991)
• RFC 1252: OSPF Version 2 Management Information Base [obsoletes 1248] (F. Baker & R. Coltun, July 1991)
• RFC 1253: OSPF Version 2 Management Information Base [obsoletes 1252] (F. Baker & R. Coltun, Aug. 1991)
• RFC 1364: BGP OSPF Interaction [obsoletes 1247 & 1267] (K. Varadhan, Sept. 1992; IAB; L. Chapin, Oct.
1992)
• RFC 1371: Choosing a &Common IGP& for the IP Internet (IESG; P. Gross, Oct. 1992)
• RFC 1403: BGP OSPF Interaction [obsoletes 1364] (K. Varadhan, Jan. 1993)
• RFC 1583: OSPF Version 2 [obsoletes RFC1247] (J. Moy, March 1994)
• RFC 1584: Multicast Extensions to OSPF (J. Moy, March 1994)
• RFC 1585: MOSPF: Analysis and Experience (J. Moy, March 1994)
• RFC 1586: Guidelines For Running OSPF Over Frame Relay Networks (O. deSouza & M. Rodriguez, March
1994)
• RFC 1587: The OSPF NSSA Option (V. Fuller & R. Coltun, March 1994)
• RFC 1745: BGP4/IDRP for IP-OSPF Interaction (K. Varadhan, S. Hares, Y. Rekhter, Dec 94)
• RFC 1765: OSPF Database Overflow (J. Moy, March 1995)
• RFC 1793: Extending OSPF to Support Demand Circuits (J. Moy, April 1995)
• RFC 1850: OSPF Version 2 Management Information Base [obsoletes 1253] (F. Baker & R. Coltun, Nov. 1995)
• RFC 2178: OSPF Version 2 [obsoletes 1583] (J. Moy, July 1997)
• RFC 2328: OSPF Version 2 [obsoletes 2178] (J. Moy, April 1998)