Disadvantages of OSPF algorithm

Disadvantages of OSPF algorithm

• A. Complex
• B. Requires Highly Trained Staff To Understand And Configure
• C. Link State Database Requires Considerable Memory Due To Numerous Tables And Databases
• D. SPF Algorithm Utilizes More Processing Power As The Size Of The Topology Database Increases

Answer: (D)

The SPF calculation is the central process here. OSPF uses the SPF algorithm to build a shortest-path tree from the router to every reachable node by examining the entire link-state database. As the network grows—more routers and links—the graph becomes larger, so the SPF run has more nodes and edges to evaluate. That leads to more CPU cycles and processing power required to recompute the paths, especially when topology changes are frequent. So the main drawback tied to the algorithm is that processing requirements increase with topology size, which can impact convergence time on busy networks unless hardware is scaled accordingly.

The SPF calculation is the central process here. OSPF uses the SPF algorithm to build a shortest-path tree from the router to every reachable node by examining the entire link-state database. As the network grows—more routers and links—the graph becomes larger, so the SPF run has more nodes and edges to evaluate. That leads to more CPU cycles and processing power required to recompute the paths, especially when topology changes are frequent. So the main drawback tied to the algorithm is that processing requirements increase with topology size, which can impact convergence time on busy networks unless hardware is scaled accordingly.