Skip to content

Link-state Routing

Distribute local connectivity state so network nodes can calculate routes from a topology view.

Version
v1 · 2026-10-03 · History
Domain-specific #
13392
Domain group
Applied Sciences & Engineering
Origin domain
Computer Science & Software Engineering
Subdomains
Computer Networking, Routing Protocols → Computer Science & Software Engineering

Core Idea

Link-state routing has network nodes share descriptions of their local connectivity so each can calculate routes from the topology information it receives. The recurring pattern is local-link report → distribution within a routing scope → local path or next-hop calculation. OSPF is one protocol implementing it, not a synonym for the broader pattern.[ref-a225c8b8da21][ref-332937a2afdb][^ref-f6db1b651595]

Scope of Application

OSPFv2 floods link-state advertisements for IP routing and calculates per-router shortest-path trees, with areas limiting what topology is visible outside them. IS-IS uses Level ½ link-state packets under a different protocol scheme. OLSR adapts the pattern to mobile ad hoc networks, using multipoint relays and selected announced links to reduce control traffic. These are unlike network settings that retain the same information-and-calculation relation.[ref-a225c8b8da21][ref-332937a2afdb][^ref-f6db1b651595]

Clarity

Do not say every router always has one complete map: information can differ during convergence, be hidden across OSPF areas, or be selected rather than exhaustive in OLSR. RFC 2328's loop-free route statement is expressly after convergence, not a guarantee during every update. A specific Dijkstra implementation, sequence-number format or area hierarchy is not mandatory for the broader identity.[ref-a225c8b8da21][ref-f6db1b651595]

Manages Complexity

The abstraction separates five questions: who reports local links, how reports propagate, which state each calculator has, how it chooses routes, and what forwarding state results. This exposes whether a wrong route came from stale topology, missing information, calculation or installation. OSPF areas and OLSR relays illustrate different tradeoffs between detail and control traffic.[ref-a225c8b8da21][ref-f6db1b651595]

Abstract Reasoning

Given a routing system, test whether participants distribute local-link state and compute routes from it. RIP-style distance-vector exchange instead sends destination distances to adjacent routers. Then state the scope and time of any correctness claim: synchronized information after convergence is different from asynchronous views during a failure update.[ref-7dc9671703d9][ref-a225c8b8da21]

Knowledge Transfer

The role pattern transfers across OSPF, IS-IS and OLSR; their packet formats, hierarchy, relay optimization and exact topology coverage do not. Live Routing is the proposed strict parent because all complete instances compute and maintain network routes for forwarding. The OSPF Wikipedia candidate remains a narrower protocol identity pending separate coverage/alias adjudication, and this staged draft changes no canonical DAG.[ref-a225c8b8da21][ref-332937a2afdb][^ref-f6db1b651595]

[^ref-a225c8b8da21]: John Moy, RFC 2328, “OSPF Version 2” (1998), Abstract and §§1.1, 3, 13, 16. [^ref-332937a2afdb]: Ross Callon, RFC 1195, “Use of OSI IS-IS for Routing in TCP/IP and Dual Environments” (1990), §§3.10, 5.1 and route-calculation clauses. [^ref-f6db1b651595]: Thomas Clausen and Philippe Jacquet, RFC 3626, “Optimized Link State Routing Protocol (OLSR)” (2003), §§1, 3, 8, 10. [^ref-7dc9671703d9]: Gary Malkin, RFC 2453, “RIP Version 2” (1998), §3.4.

Relationships to Other Abstractions

Local relationship map for Link-state RoutingParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Link-state RoutingDOMAINDomain-specific abstraction: Routing — is a kind ofRoutingDOMAIN

Current abstraction Link-state Routing Domain-specific

Parents (1) — more general patterns this builds on

  • Link-state Routing is a kind of Routing Domain-specific

    Link-state routing is network routing with distributed local-link state and topology-derived route computation.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Link-state Routing sits in a sparse region of the domain-specific corpus (74th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Network Security Vulnerabilities & Trust (26 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08