JN0-364: Service Provider Routing and Switching, Specialist (JNCIS-SP)Demo

By Juniper · Question Mode

QuestionQ4

Open Shortest Path First (OSPF)

What prevents routing loops within a single-area OSPF network?

  • A The Dijkstra algorithm
  • B routing policies
  • C The Bellman-Ford algorithm
  • D forwarding policies
Explanation

OSPF uses Dijkstra’s shortest-path-first (SPF) algorithm on a shared link-state database to calculate a loop-free shortest-path tree for the area.

Community Discussion

No comments yet. Be the first to start the discussion!