Multiple choice

Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?

  1. DUAL

  2. Dijkstra

  3. Bellman-Ford

  4. Diffie-Hellman
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Link-state routing protocols like OSPF and IS-IS use Dijkstra shortest path first (SPF) algorithm to calculate the most efficient path to all reachable networks. The protocol builds a complete topology map (link-state database) and runs Dijkstra algorithm to compute the shortest path tree from itself to all destinations.

Keep practicing — related questions