What happens when an EIGRP router loses its successor and has no feasible successor?
Show the answer
Say this first
The route goes active. The router sends a Query for that prefix to its neighbors and must get a Reply from every one of them before it picks a new path. Each neighbor either answers straight away from its own topology table, or, if it was using the querying router as its own successor and has no backup, goes active itself and queries its neighbors. When all replies are in, the router picks the best answer, installs it and the route goes passive again.
Go deeper
Step by step
- The successor's link goes down, or it reports infinity. No feasible successor exists.
- The router marks the prefix A (active) in the topology table and sends queries.
- Each neighbor decides:
- It does not know the prefix: replies "unreachable" at once and does not query anyone.
- Its own successor is someone else: replies with its current distance at once.
- Its successor was the querying router: it checks for a feasible successor; if it has one it replies with that distance, otherwise it goes active too and queries its own neighbors.
- The original router waits for all replies, chooses the lowest, and goes passive (P).
What it looks like while it is happening
R1# show ip eigrp topology activeActive routes show A, and neighbors that still owe a reply are listed under "Remaining replies"
with an r.
Why it can hurt
The query spreads until it reaches routers that can answer without asking anyone. In a large flat network with no summarization and no stubs, one flapping subnet makes hundreds of routers work, and one slow router anywhere in the chain holds up the answer. That is the setup for stuck in active.
They will ask next
What does a router put in a reply when it has no path?
An infinite metric, shown as
Infinityin the topology table. It tells the querier "not through me".Why must the router wait for every reply instead of taking the first good one?
DUAL is a diffusing computation: its loop-freedom proof depends on every neighbor having updated its state for the change before a new path is chosen. Taking an early answer could pick a neighbor whose information is still based on the old path.
Traps
- Saying the router sends the query only to the neighbor it hopes has a path. It queries all its neighbors.