Reference Guide

Open Shortest Path First (OSPFv2) | 571
27
Open Shortest Path First (OSPFv2)
Open Shortest Path First (OSPFv2) is supported on platforms z.
This chapter includes the following topics:
• Protocol Overview
• Implementing OSPF with FTOS
• Fast Convergence (OSPFv2, IPv4 only)
• Multi-Process OSPF (OSPFv2, IPv4 only)
• RFC-2328 Compliant OSPF Flooding
• OSPF ACK Packing
• OSPF Adjacency with Cisco RoutersConfiguration Information
• Configuration Task List for OSPFv2 (OSPF for IPv4)
• Sample Configurations for OSPFv2
OSPF protocol standards are listed in the Chapter 49, Standards Compliance chapter.
Protocol Overview
Open Shortest Path First (OSPF) routing is a link-state routing protocol that calls for the sending of
Link-State Advertisements (LSAs) to all other routers within the same Autonomous System (AS) Areas.
Information on attached interfaces, metrics used, and other variables is included in OSPF LSAs. As OSPF
routers accumulate link-state information, they use the SPF algorithm (Shortest Path First algorithm) to
calculate the shortest path to each node.
OSPF routers initially exchange HELLO messages to set up adjacencies with neighbor routers. The
HELLO process is used to establish adjacencies between routers of the AS. It is not required that every
router within the Autonomous System areas establish adjacencies. If two routers on the same subnet agree
to become neighbors through the HELLO process, they begin to exchange network topology information
in the form of Link State Advertisements (LSAs).
In OSPFv2 neighbors on broadcast and NBMA links are identified by their interface addresses,
while neighbors on other types of links are identified by RID.