Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Telecommunications›Open Shortest Path First (OSPF)
Process / pipelineRouting protocol

Open Shortest Path First (OSPF)

Open Shortest Path First · Also known as: link-state routing, intra-domain routing

OSPF is a link-state interior gateway protocol (IGP) for routing within an autonomous system. Introduced by John Moy in 1998, OSPF converges faster than distance-vector protocols and supports equal-cost multipath (ECMP). It remains widely deployed in enterprise and ISP networks for intra-domain routing, though IS-IS is increasingly preferred in large backbones.

ScholarGate
  1. Process / pipeline
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

OSPF
BGPMPLSDiffServSoftware-Defined Network…

When to use it

Use OSPF for enterprise and mid-size ISP networks. OSPF convergence is faster than RIP and scales better. For very large networks (>1000 routers), IS-IS is often preferred. OSPF areas provide hierarchical scaling but add configuration complexity.

Strengths & limitations

Strengths
  • Fast convergence: detects link changes and reconverges in seconds
  • Optimal paths: Dijkstra ensures shortest path routing
  • ECMP support: equal-cost paths used simultaneously for load balancing
  • Hierarchical design: areas reduce flooding and state
  • No hop-count limit: metric is configurable link cost, not hop count
Limitations
  • CPU/memory overhead: running Dijkstra on large topologies is expensive
  • Flooding overhead: LSA flooding consumes bandwidth, especially with many routers
  • Area design complexity: poorly designed areas can cause routing inefficiency
  • Not suitable for policy-based routing; use BGP for that
  • Limited to intra-domain routing; must use BGP for inter-domain

Frequently asked

What is an area in OSPF?

An area is a contiguous network segment. Area 0 (backbone) connects all areas. Routers flood LSAs only within areas, reducing overhead. Inter-area routing is handled by Area Border Routers (ABRs).

How does OSPF handle interface cost?

OSPF metric is the sum of link costs. By default, cost = 100 Mbps / interface bandwidth. Link cost is tunable, allowing operators to influence path selection.

What is ECMP in OSPF?

Equal-Cost Multipath: if multiple paths have the same cost, OSPF uses all of them, distributing traffic across interfaces. This provides load balancing without explicit configuration.

What are stub and NSSA areas?

Stub areas reduce LSA flooding by not receiving external routes (LSA type 5). NSSA (Not-So-Stubby Area) is a variant allowing selective external route advertisement.

Sources

  1. Moy, J. T. (1998). OSPF Version 2. RFC 2328. link ↗
  2. Coltun, R., Ferguson, D., Moy, J., & Lindem, A. (2008). OSPF for IPv6. RFC 5340. link ↗

How to cite this page

ScholarGate. (2026, June 3). Open Shortest Path First. ScholarGate. https://scholargate.app/en/telecommunications/ospf

Related methods

BGPMPLS

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • BGPTelecommunications↔ compare
  • MPLSTelecommunications↔ compare
Compare side by side →

Referenced by

BGPDiffServMPLSSoftware-Defined Networking

Similar methods

BGPMPLSSoftware-Defined NetworkingDijkstra AlgorithmDiffServNetwork Distance AnalysisBellman-Ford AlgorithmA-star Search Algorithm

Related reference concepts

Routing AlgorithmsIntra- and Inter-Domain RoutingNetwork Layer and RoutingSoftware-Defined NetworkingComputer NetworksInternet Protocol and Addressing

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — OSPF (Open Shortest Path First). Retrieved 2026-07-21 from https://scholargate.app/en/telecommunications/ospf · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
John Moy
Subfamily
Routing protocol
Year
1998
Type
link-state routing protocol
Related methods
BGPMPLS
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account