EIGRP uses which algorithm to build a routing table?

The correct answer is C. Diffusing Update Algorithm. EIGRP uses DUAL (Diffusing Update Algorithm) to select loop-free paths and determine the best route (successor) and backup routes (feasible successors). DUAL guarantees loop-free paths at every instant during route computation and enables fast convergence by allowing routers to…

Advanced Addressing and Routing Solutions

Question

Options

ADijkstra's algorithm
BFloyd-Warshall algorithm
CDiffusing Update Algorithm
DJohnson's algorithm

How the community answered

(23 responses)

A
9% (2)
C
87% (20)
D
4% (1)

Explanation

EIGRP uses DUAL (Diffusing Update Algorithm) to select loop-free paths and determine the best route (successor) and backup routes (feasible successors). DUAL guarantees loop-free paths at every instant during route computation and enables fast convergence by allowing routers to use pre-computed feasible successors immediately upon topology changes. Dijkstra's algorithm is used by link-state protocols like OSPF and IS-IS, while Bellman-Ford is used by distance-vector protocols like RIP.

Topics

#EIGRP#DUAL#routing algorithm#distance vector

Community Discussion

No community discussion yet for this question.

Full 300-320 Practice