ExamGecko
Question list
Search
Search

List of questions

Search

Related questions











Question 539 - N10-008 discussion

Report
Export

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?

A.
A static algorithm
Answers
A.
A static algorithm
B.
A link-state algorithm
Answers
B.
A link-state algorithm
C.
A distance-vector algorithm
Answers
C.
A distance-vector algorithm
D.
A path-vector algorithm
Answers
D.
A path-vector algorithm
Suggested answer: B

Explanation:

A link-state algorithm is a routing algorithm that uses information about the state of each link in the network to calculate the shortest path from one node to every other node. A link-state algorithm requires each router to maintain a complete map of the network topology and exchange link-state advertisements with its neighbors periodically or when a change occurs. A link-state algorithm uses a mathematical formula called Dijkstra's algorithm to find the shortest path based on the link costs. A link-state algorithm provides the fastest convergence time because it can quickly detect and adapt to network changes. Reference: [CompTIA Network+ Certification Exam Objectives], [Link-state routing protocol - Wikipedia]

asked 02/10/2024
monet washington
35 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first