An enterprise network operating the Open Shortest Path First (OSPF) routing protocol experiences an unexpected fiber link failure between two core routers. Place the steps of the OSPF link-state convergence process in the correct chronological order from first event to final completion.
- 1The directly connected router detects the loss of physical carrier signal or missed Hello dead-interval timer expiry on the interface.
- 2The detecting router constructs a new Link-State Advertisement (LSA) reflecting the updated interface state and metric.
- 3The newly generated LSA is flooded throughout the OSPF area using Link State Update (LSU) packets.
- 4Receiving routers accept the LSA and update their local Link-State Database (LSDB).
- 5Each router runs the Dijkstra Shortest Path First (SPF) algorithm on the updated LSDB to recalculate routes and update the routing table.
Cevap
The correct order of OSPF convergence events is: 1) Physical or Hello failure detection, 2) Updated LSA creation, 3) LSA flooding across adjacent neighbors, 4) LSDB update on area routers, and 5) Dijkstra SPF algorithm execution to update the routing table.
The standard link-state convergence lifecycle follows a mandatory sequence: local link/keepalive failure detection occurs first, followed by new LSA generation, area-wide LSA flooding, LSDB database synchronization, and finally SPF (Dijkstra) calculation to compute new best routes.
Adım Adım Çözüm
Anahtar Kavram
OSPF Link-State Convergence Sequence
Tahmini Süre:1m 30s