QuestionQ4Verified/Open Shortest Path First (OSPF)Copy linkReport a problemAsk AstroTutorSave questionWhat prevents routing loops within a single-area OSPF network?AThe Dijkstra algorithmBrouting policiesCThe Bellman-Ford algorithmDforwarding policiesShow AnswerAnswerExplanationOSPF 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.Show comments0Show commentsCommunity DiscussionNo comments yet. Be the first to start the discussion!
Community Discussion