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?
B. A link-state algorithm
Among the options provided, a link-state algorithm, such as OSPF (Open Shortest Path First) or IS-IS (Intermediate System to Intermediate System), typically provides the fastest convergence time. Link-state algorithms use a database of the network's topology to calculate the shortest path to every other node. They react quickly to changes in the network and converge faster compared to distance-vector algorithms.
B. A link-state algorithm
In the context of finding the shortest path from one node to every other node in the network with the fastest convergence time, a link-state algorithm is the most suitable. Link-state algorithms, such as OSPF (Open Shortest Path First) and IS-IS (Intermediate System to Intermediate System), provide a more efficient and faster convergence time compared to distance-vector algorithms.
upvoted 4 times
...
This section is not available anymore. Please use the main Exam Page.N10-008 Exam Questions
Log in to ExamTopics
Sign in:
Community vote distribution
A (35%)
C (25%)
B (20%)
Other
Most Voted
A voting comment increases the vote count for the chosen answer by one.
Upvoting a comment with a selected answer will also increase the vote count towards that answer by one.
So if you see a comment that you already agree with, you can upvote it instead of posting a new comment.
Jay987654
10 months, 1 week agosalah112
11 months, 1 week ago