OSPF: routers sharing the same map
▶ Start the interactive lesson
Burrow is opening its 8th depot. Updating static routes on every router by hand is getting dangerous. Last week someone missed one. Maya: "Time for routers to talk to each other. OSPF: everyone shares a map of the roads, then each one works out its own shortest route."
Key points
- OSPF is a link-state protocol. Routers say hello, form neighbours, flood LSAs (descriptions of their links), and every router in the area builds the same map (the LSDB).
- Each router then runs Dijkstra's SPF to find its own shortest paths. Cost = reference bandwidth ÷ interface bandwidth, so faster links are cheaper.
- Area 0 is the backbone. Other areas must connect to it. Areas keep maps small in big networks.
- Neighbour checklist: same area, same subnet, same hello/dead timers (10/40s on Ethernet), same auth, and matching MTU. A neighbour stuck in ExStart/Exchange often means an MTU mismatch.
The full lesson has more: animations, a hands-on exercise, 3 quiz questions and spaced review cards. Open it free →