OSPF
In plain English
Plain definition
OSPF (Open Shortest Path First) is a link-state interior gateway protocol that routers use to automatically compute and maintain shortest paths within a single autonomous system.
Technical Definition
OSPF is a link-state interior gateway protocol (IGP) used within a single autonomous system. Routers running OSPF exchange link-state advertisements (LSAs) describing their local links and neighbours, build an identical link-state database, and independently run a shortest-path-first computation to determine the least-cost route to each destination. Each interface carries an administratively assigned cost, and OSPF supports a hierarchical area structure, including a backbone area, to bound the scope of LSA flooding and improve scalability. OSPF is specified through the IETF RFC Series published by the RFC Editor, with separate specifications for IPv4 (commonly called OSPFv2) and IPv6 (commonly called OSPFv3). The exact RFC number, version and errata status should be confirmed against the current IETF register before being cited in a design or compliance document, because supersession can change over time.
Operational Relevance
Practitioners rely on OSPF to keep internal routing tables converged automatically when links fail or topology changes, reducing the need for manual route reconfiguration. For platform, network and site-reliability teams operating multi-router internal networks, OSPF’s convergence behaviour directly affects how quickly and predictably traffic reroutes after a failure, which has a direct bearing on service availability.
Architecture Relationship
OSPF operates at the interior gateway layer of a routed network, distinct from exterior gateway protocols such as BGP that manage routing between separate autonomous systems. Within a single OSPF domain, routers are commonly organised into a backbone area and one or more non-backbone areas connected through area border routers (ABRs); routes entering or leaving the OSPF domain via other protocols are typically handled by autonomous system boundary routers (ASBRs). This hierarchical structure is a design choice that trades some routing detail for improved scalability and faster convergence, and it should be treated as a visible architectural assumption rather than an automatic default.
Example
A platform team operating three data-centre racks might place all routers in the backbone area while the network is small, then split satellite racks into their own non-backbone areas as the topology grows, connecting each new area back to the backbone through an ABR. This keeps link-state flooding local to each area, so a single interface flap in one rack does not force every router on the network to rerun the full path computation. Any such redesign should first be validated in an isolated or non-production lab, consistent with standard change-management practice, before being applied to a live network.
Common Misunderstanding
A frequent misunderstanding is that OSPF cost is defined by a single universal formula tied strictly to interface bandwidth. The protocol allows cost to be an administratively assigned value, and any specific default-cost calculation, such as a bandwidth-referenced default, is a vendor and version-specific implementation choice rather than a protocol requirement. Treat a specific default-cost formula as a claim needing confirmation against current platform documentation, not as a universal fact about OSPF itself.
Related Terms
- Interior Gateway Protocol (IGP)
- Border Gateway Protocol (BGP)
- IS-IS
- EIGRP
- Link-State Advertisement (LSA)
- Area Border Router (ABR)
- Autonomous System Boundary Router (ASBR)
- Shortest Path First (SPF) algorithm
Further Reading
Consult the IETF RFC Series via the RFC Editor for the authoritative, version-specific OSPF specifications, and confirm which RFC and errata apply to the OSPF version in use before relying on any specific clause for a production design decision.