Switching & routing

OSPF adjacency and convergence

Three routers in one OSPF area exchange hello, DBD, LSR and LSU messages until they share the same link-state database and agree on the shortest paths.

OSPF area 0Cost 10Cost 10Cost 10Cost 10Cost 10Cost 10HelloHelloHelloRouter R1198.51.100.1Router R1 — 198.51.100.1Router R2198.51.100.2Router R2 — 198.51.100.2Router R3198.51.100.3Router R3 — 198.51.100.3
Legend

Current step

Hello packets build the adjacency

Each router multicasts hellos on every OSPF link; hearing a neighbour proves the link works both ways.

Multicast address
224.0.0.5
Hello interval
10 s
Dead interval
40 s
OSPF builds a neighbour adjacency first, then synchronises link-state databases, and finally runs the SPF algorithm. Only after convergence does every router install the same shortest-path tree.

Documentation example: addresses use the RFC 5737 ranges and ASNs use the reserved private range. Nothing here connects to a real network.

Tags

  • routing
  • ospf
  • link-state
  • adjacency
  • convergence

Lessons using this diagram