Protocols
Saved & recent

OSPF

Also called: Open Shortest Path First, OSPFv2, OSPFv3, link-state routing

Open Shortest Path First is a link-state routing protocol used within an autonomous system. Routers exchange information about links and maintain a topology database for their area. Each router calculates routes from that shared view using accumulated link costs. Areas limit how much detailed topology must be distributed throughout a larger deployment.

For example, a two-link route with costs 2 and 2 beats a route with costs 1 and 6 because its total cost is 4 rather than 7. Cost is a configured routing metric, not necessarily geographic distance or a count of hops. OSPFv2 serves IPv4; OSPFv3 introduced IPv6 support. BGP addresses the separate problem of routing between autonomous systems.

Read first
Routing
Related
BGP, Autonomous system, IPv6
Further reading
2 2 1 6 A B C D area topology copy area topology copy one OSPF area A–B–D · cost 4 A–C–D · cost 7
Illustrative OSPF costs: the path totaling 4 wins over the alternative totaling 7.

View in the full Protocols collection