What prevents routing loops within a single-area OSPF network?
OSPF uses Dijkstra’s shortest-path-first (SPF) algorithm on a shared link-state database to calculate a loop-free shortest-path tree for the area.
Community Discussion