An enterprise router joins a newly configured OSPF area. Place the operational steps of the link-state dynamic routing process in the correct order, from initial neighbor discovery to final route installation.
- 1Neighbors are discovered and neighbor relationships established via Hello protocol packets.
- 2Link-State Advertisements (LSAs) describing interface states and networks are flooded across the area.
- 3Routers assemble received LSAs into a synchronized, identical Link-State Database (LSDB).
- 4The Shortest Path First (Dijkstra) algorithm is executed against the populated LSDB.
- 5The lowest-cost paths computed by the SPF algorithm are committed to the IP routing table.
Cevap
The correct sequence is: 1) Neighbors discovered via Hello packets → 2) LSAs flooded across the area → 3) LSDB compiled and synchronized → 4) SPF (Dijkstra) algorithm executed → 5) Optimal paths installed in the routing table.
In link-state dynamic routing protocols such as OSPF, operations strictly follow a deterministic order. First, Hello packets establish neighbor relationships. Next, LSAs carrying link status details are flooded throughout the network segment. The received LSAs build an identical Link-State Database (LSDB) across all routers. Each router then executes Dijkstra's Shortest Path First (SPF) algorithm against the LSDB to construct a shortest path tree. Finally, the best-cost paths are committed to the IP routing table.
Adım Adım Çözüm
Anahtar Kavram
OSPF Link-State Operational Phases
Tahmini Süre:1m 30s