OSPF Visualiser
Routing
Overview
OSPF neighbors exchange link-state information and each router runs shortest-path first over its link-state database. Path cost is the sum of link costs, not physical hop count alone. Area boundaries and neighbor parameters affect operation; this lesson focuses on cost comparison.
Protocol stages
- 1Neighbor adjacency
- 2Link-state database
- 3Shortest-path first
- 4Route installation
Interactive exercise
Knowledge check
A→C direct costs 30. A→B costs 10 and B→C costs 5. Which route has lower OSPF cost?
Educational model — not real hardware, traffic or official certification.