OSPF

Definition

OSPF, Open Shortest Path First, is a link-state interior gateway routing protocol used to determine the best paths for forwarding traffic within a single autonomous system, such as a corporate or service provider network. Each router running OSPF builds a complete map of the network's topology and independently calculates the shortest path to every destination using Dijkstra's well-known shortest-path-first algorithm.

Overview

OSPF was developed as an open, standards-based alternative to earlier interior routing protocols like RIP, which suffered from slow convergence and poor scalability in larger networks because it relied on distance-vector information exchanged only between directly connected neighbors. OSPF instead uses a link-state approach, where every router floods information about its directly connected links to all other routers in the same area, giving each router a complete and identical view of the network topology rather than relying on secondhand distance estimates. Mechanically, OSPF routers exchange link-state advertisements describing their connected networks and the cost associated with each link, and every router stores this information in a link-state database. Because every router in an area has the same database, each one can independently run Dijkstra's algorithm to compute the shortest-cost path to every known destination, which produces consistent routing decisions across the network and allows for fast convergence when a link changes, since only the affected link-state information needs to propagate rather than an entire routing table. OSPF also supports authentication of its routing messages, which helps prevent an unauthorized device from injecting false routing information into the network. OSPF organizes larger networks into areas connected through a backbone area, which limits how far link-state flooding has to travel and keeps the computation manageable as a network grows. OSPF is an interior gateway protocol, meaning it operates within a single autonomous system, which distinguishes it fundamentally from BGP, the exterior gateway protocol that handles routing between separate autonomous systems on the broader internet. Within the interior routing category, OSPF's main alternative is IS-IS, another link-state protocol with a similar underlying algorithm but different message formats and address-family handling, and it also historically competed with Cisco's proprietary EIGRP. In practice, OSPF is deployed inside enterprise networks, data centers, and service provider backbones to route traffic between internal routers efficiently, often working alongside BGP, which then handles how that internal network exchanges routes with the outside internet at its edges. The main limitation is scale and complexity within very large single-area networks: link-state flooding and full-topology computation become more resource-intensive as a network grows, which is why OSPF relies on hierarchical area design to contain that cost, and very large-scale environments sometimes prefer IS-IS or additional route summarization techniques to keep the link-state database and computation manageable, and careful, deliberate area design becomes increasingly important to get right as a network continues to grow larger over time.

Specification

• Link-state protocol giving every router a complete network topology view
• Dijkstra's shortest-path-first algorithm for independent route computation
• Hierarchical area design limiting the scope of link-state flooding
• Fast convergence after link failures compared to distance-vector protocols
• Interior gateway protocol operating within a single autonomous system
• Open, vendor-neutral standard unlike Cisco's proprietary EIGRP
• Backbone area design connecting and summarizing routes between areas

Use Cases

Alternatives

Frequently Asked Questions

Related in DevOps