OSPF
— Open Shortest Path FirstOSPF is a link-state routing protocol used within an internal corporate or campus network (Interior Gateway). Routers build a complete topology map of the network and run Dijkstra shortest path first algorithm to determine optimal forwarding paths.
Interactive Session: How OSPF Works
Step through the packet exchange sequence between nodes.
Interactive Execution Sandbox
Interact with a live or clearly-labelled simulated instance of OSPF.
Threat Model & Attack Simulation
How this protocol is attacked in practice, what defenders can see, and which control stops it.
Threat model & attack simulation
SimulatedDefensive education. Every step runs in this page; no traffic is generated or sent.
OSPF LSA injection
SpoofingA rogue router forms an adjacency and floods false link-state advertisements into the area.
Form an adjacency
The attacker brings up OSPF with the correct area and parameters.
New neighbour on an unexpected interface.
Traffic redirection or routing instability.
Defences that matter
- OSPF authentication (MD5 or SHA)
- Passive interfaces on edge ports
- Area filtering and topology monitoring
This is a conceptual model for defenders, not an exploit toolkit. It contains no payloads, tooling or instructions for attacking systems you do not own.
Protocol Specification & Architecture
Key characteristics, real-world deployment patterns, and trade-offs.
Core Technical Features
- Link-state database (LSDB) synchronization
- Dijkstra Shortest Path First (SPF) calculation
- Hierarchical area design (Area 0 backbone)
- Fast convergence and loop-free routing
Real-World Use Cases
- Enterprise campus core routing
- Data center spine-and-leaf internal routing
Advantages & Strengths
- Rapid convergence when links change
- Supports Equal-Cost Multi-Path (ECMP)
Limitations & Vulnerabilities
- High memory and CPU overhead for large single-area link-state databases