Which algorithm does IS-IS use to determine the shortest path through a network?

The correct answer is C. Dijkstra's algorithm. IS-IS is a link-state routing protocol and, like OSPF, uses Dijkstra's Shortest Path First (SPF) algorithm to calculate the shortest path to all destinations in its topology database. Each router runs the SPF algorithm independently against its local Link State Database (LSDB)…

Advanced Addressing and Routing Solutions

Question

Options

ABellman-Ford routing algorithm
BJohnson's algorithm
CDijkstra's algorithm
DFloyd-Warshall algorithm

How the community answered

(28 responses)

A
4% (1)
B
4% (1)
C
93% (26)

Explanation

IS-IS is a link-state routing protocol and, like OSPF, uses Dijkstra's Shortest Path First (SPF) algorithm to calculate the shortest path to all destinations in its topology database. Each router runs the SPF algorithm independently against its local Link State Database (LSDB) to build a loop-free tree of shortest paths. Bellman-Ford is used by distance-vector protocols like RIP, and Floyd-Warshall/Johnson's algorithms are not used by standard IGPs.

Topics

#IS-IS#Dijkstra#SPF algorithm#link-state routing

Community Discussion

No community discussion yet for this question.

Full 300-320 Practice