How can EIGRP topologies be designed to converge as fast as possible in the event of a point-to- point link failure?

Question

Options

• ALimit the query domain by use of distribute lists.
• BBuild neighbor adjacencies in a triangulated fashion.
• CBuild neighbor adjacencies in squared fashion.
• DLimit the query domain by use of summarization.
• ELimit the query domain by use of default routes.

• A
  5% (2)
• B
  2% (1)
• D
  84% (37)
• E
  9% (4)

Explanation

EIGRP convergence after a link failure is governed by DUAL (Diffusing Update Algorithm). When a route is lost and no feasible successor exists in the topology table, EIGRP sends queries outward to all neighbors. Those neighbors forward the queries further until a boundary is reached. The wider the query propagates, the longer convergence takes. Route summarization creates a natural query boundary: a router that owns a summary route answers queries for subnets within that summary locally rather than forwarding them upstream. This confines the query domain to a smaller scope and dramatically speeds up convergence. Distribute lists (A) filter prefixes but do not stop query propagation. Triangulated (B) or squared (C) adjacency designs are not recognized EIGRP optimization techniques. Default routes (E) can suppress some queries but are not the standard or most effective mechanism for bounding the query domain.

No community discussion yet for this question.