1.1.

1 Introduction to OSPF

●​ OSPF is a link-state routing protocol that was developed as an alternative for the distance vector
Routing Information Protocol (RIP).
●​ RIP was an acceptable routing protocol in the early days of networking and the internet. However, the
RIP reliance on hop count as the only metric for determining best route quickly became problematic.
Using hop count does not scale well in larger networks with multiple paths of varying speeds.

*OSPF has significant advantages over RIP in that it offers faster convergence and scales to much larger
network implementations.

●​ OSPF is a link-state routing protocol that uses the concept of areas. A network administrator can divide
the routing domain into distinct areas that help control routing update traffic.
●​ A link is an interface on a router. A link is also a network segment that connects two routers, or a
stub network such as an Ethernet LAN that is connected to a single router.
●​ Information about the state of a link is known as a link-state.
●​ All link-state information includes the network prefix, prefix length, and cost.
1.1.2 Components of OSPF

Five types of packets

●​ Hello packet
●​ Database description packet
●​ Link-state request packet
●​ Link-state update packet
●​ Link-state acknowledgment packet

Three OSPF databases

●​ Adjacency database - This creates the neighbor table.
●​ Link-state database (LSDB) - This creates the topology table.
●​ Forwarding database - This creates the routing table.
The router builds the topology table using results of calculations based on the Dijkstra shortest-path
first (SPF) algorithm. The SPF algorithm is based on the cumulative cost to reach a destination.

The SPF algorithm creates an SPF tree by placing each router at the root of the tree and calculating
the shortest path to each node. The SPF tree is then used to calculate the best routes. OSPF places
the best routes into the forwarding database, which is used to make the routing table.

1.1.3 Link-State Operation

cost is used to determine the best path to the destination.

The link-state routing steps that are completed by a router

1.​ Establish Neighbor Adjacencies

2.​ Exchange Link-State Advertisements
3.​ Build the Link State Database
4.​ Execute the SPF Algorithm
5.​ Choose the Best Route

1.1.4 Single-Area and Multiarea OSPF

OSPF can be implemented in one of two ways OSPF can be implemented in one of two ways:

Single-Area OSPF - All routers are in one area. Best practice is to use area 0.

Multiarea OSPF - OSPF is implemented using multiple areas, in a hierarchical fashion. All areas
must connect to the backbone area (area 0). Routers interconnecting the areas are referred to as
Area Border Routers (ABRs).

1.1.5 Multiarea OSPF

hierarchical-topology design options with multiarea OSPF can offer the following advantages:

●​ Smaller routing tables - Tables are smaller because there are fewer routing table entries.
This is because network addresses can be summarized between areas. Route summarization
is not enabled by default.
●​ Reduced link-state update overhead - Designing multiarea OSPF with smaller areas
minimizes processing and memory requirements.
●​ Reduced frequency of SPF calculations - Multiarea OSPF localize the impact of a topology
change within an area. For instance, it minimizes routing update impact because LSA flooding
stops at the area boundary.

1.1.6 OSPFv3

●​ OSPFv2 runs over the IPv4 network layer, communicating with other OSPF IPv4 peers, and
advertising only IPv4 routes.
 ●​ OSPFv3 has the same functionality as OSPFv2, but uses IPv6 as the network layer
transport, communicating with OSPFv3 peers and advertising IPv6 routes. OSPFv3 also uses
the SPF algorithm as the computation engine to determine the best paths throughout the
routing domain.
●​ OSPFv3 has separate processes from its IPv4 counterpart. The processes and operations are
basically the same as in the IPv4 routing protocol, but run independently. OSPFv2 and
OSPFv3 each have separate adjacency tables, OSPF topology tables, and IP routing tables,
as shown in the figure.

1.2.2 Types of OSPF Packets

●​ Type 1: Hello packet - This is used to establish and maintain adjacency with other OSPF
routers.
●​ Type 2: Database Description (DBD) packet - This contains an abbreviated list of the LSDB
of the sending router and is used by receiving routers to check against the local LSDB. The
LSDB must be identical on all link-state routers within an area to construct an accurate SPF
tree.
●​ Type 3: Link-State Request (LSR) packet - Receiving routers can then request more
information about any entry in the DBD by sending an LSR.
●​ Type 4: Link-State Update (LSU) packet - This is used to reply to LSRs and to announce
new information. LSUs contain several different types of LSAs.
●​ Type 5: Link-State Acknowledgment (LSAck) packet - When an LSU is received, the router
sends an LSAck to confirm receipt of the LSU. The LSAck data field is empty.

1.2.3 Link-State Updates

●​ An LSU contains one or more LSAs.

●​ LSAs contain route information for destination networks.

1.2.4 Hello Packet

OSPF Type 1 packet is the Hello packet. Hello packets are used to do the following:
 ●​ Discover OSPF neighbors and establish neighbor 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. Point-to-point links do not require DR or BDR.

1.3.2 OSPF Operational States

When an OSPF router is initially connected to a network, it attempts to:

●​ Create adjacencies with neighbors

●​ Exchange routing information
●​ Calculate the best routes
●​ Reach convergence
1.3.3 Establish Neighbor Adjacencies

1. Down to Init State​

2. The Init State​
3. Two-Way State​
4. Elect the BR and DBR

1.3.4 Synchronizing OSPF Databases

1.​ Decide first router

2.​ Exchange DBDs
3.​ Send an LSR

1.3.5 The Need for a DR

Multiaccess networks can create two challenges for OSPF regarding the flooding of LSAs, as follows:

●​ Creation of multiple adjacencies - Ethernet networks could potentially interconnect many

OSPF routers over a common link. Creating adjacencies with every router is unnecessary and
undesirable. It would lead to an excessive number of LSAs exchanged between routers on the
same network.
●​ Extensive flooding of LSAs - Link-state routers flood their LSAs any time OSPF is initialized,
or when there is a change in the topology. This flooding can become excessive.

Number of Adjacencies = n (n - 1) / 2 ​
n = number of routers ​
Example: 5 (5 - 1) / 2 = 10 adjacencies

1.3.6 LSA Flooding With a DR

*A dramatic increase in the number of routers also dramatically increases the number of LSAs
exchanged between the routers. This flooding of LSAs significantly impacts the operation of OSPF.

LSAs and DR

The solution to managing the number of adjacencies and the flooding of LSAs on a
multiaccess network is the DR. On multiaccess networks, OSPF elects a DR to be the collection and
distribution point for LSAs sent and received. A BDR is also elected in case the DR fails. All other
routers become DROTHERs. A DROTHER is a router that is neither the DR nor the BDR.

Note: The DR is only used for the dissemination of LSAs. The router will still use the best next-hop
router indicated in the routing table for the forwarding of all other packets.