CompTIA Network+ (N10-008) — Question 554

A network technician wants to find the shortest path from one node to every other node in the network. Which of the following algorithms will provide the FASTEST convergence time?

Answer options

• A. A static algorithm
• B. A link-state algorithm
• C. A distance-vector algorithm
• D. A path-vector algorithm

Correct answer: B

Explanation

The link-state algorithm is the correct choice because it quickly disseminates information about the state of the links in the network, allowing for rapid convergence. In contrast, static algorithms do not adapt to network changes, distance-vector algorithms can be slower due to their periodic updates and hop count limitations, and path-vector algorithms are primarily used in BGP, which is less focused on rapid convergence.