EIGRP general operations
In an EIGRP topology table, P is good and A is the warning: Passive means no computation is running for the destination, Active means one is. RFC 7868 defines both by one test, the feasibility condition, decided before the failure. A route with a feasible successor stays passive when its successor fails; one without goes active and queries, and waits for every reply.
By Arif, founder of Daveth · Updated
The full 5 min walkthrough is in Daveth Pro (Network). See what the plan opens
What this page answers
What is the difference between EIGRP passive and active?
Passive means no EIGRP computation is being performed for the destination; active means one is. Passive is the normal state; active means the router lost its path with no feasible successor and is querying. Read it in “Which letter do you want to see?”
When does an EIGRP route go active?
When the neighbours that provide the lowest-cost path do not pass the feasibility condition, so loop freedom cannot be guaranteed. If a feasible successor exists, the route stays passive. Read it in “The two states, defined properly”
How many replies does an active EIGRP route need?
All of them. Each reply clears only that neighbour's flag, and the route stays active while any reply is still pending. Read it in “Getting out of active”
Which letter do you want to see?
Two routes in a topology table. One says P. One says A. Which one would you rather be looking at?
Hold your answer, because the words point the wrong way. A is Active, and active sounds like working, healthy, up. P is Passive, and passive sounds like idle. Here are the command reference's own definitions of the two codes:
Indicates that no EIGRP computations are being performed for this destination. Indicates that EIGRP computations are being performed for this destination.
The first is P, the second is A. Passive means the router has nothing to work out for this route, because it is settled. Active means it is working on it, because it is not. Passive is the state you want everything in.
EIGRP may be the only thing in your rack where "passive" is the compliment.
Where this sits
This page adds no new mechanism. It shows that four you have met are one machine: the feasibility condition from 1.3.b.i, queries and replies from 1.3.c.iii, what happens when a reply never comes in 1.3.c.iv, and bounding how far a query travels in 1.3.e.i. What connects them is DUAL, and its route has two states.
The two states, defined properly
RFC 7868, the published specification of EIGRP, defines both in terms of one test. Watch which test it is:
A route is considered to be in the Passive state when at least one neighbor that provides the current least-total-cost path passes the Feasibility Condition check that guarantees loop freedom. A route is considered to be in the ACTIVE state if neighbors that do not pass the Feasibility Condition check provide lowest-cost path, and therefore the path cannot be guaranteed loop free.
Read both again and find the one thing that differs. Not the metric. Not whether a path exists. Whether the best path comes from a neighbour that passes the Feasibility Condition. That test is the one from 1.3.b.i:
The Feasibility Condition is met when a neighbor's advertised cost, (RD) to a destination is less than the FD for that destination
So a router going active is not saying "I have no path". It may be looking straight at one. It is saying something narrower: I cannot prove this path is not a loop, so I will not use it until I have asked. The RFC is explicit that it stops using it:
A route in the ACTIVE state is considered unusable and this router must coordinate with its neighbors in the search for the new loop-free least-total-cost path.
Why so strict? Because of what it buys:
DUAL guarantees that each constructed path is loop free at every instant including periods of topology changes and network reconvergence.
At every instant, including while the network is still changing. Going active is the price of that sentence.
One test, decided before the failure
The walk that goes with this page runs on the RFC's own example network: destination N hanging off A, routers A and B along the top, D and C along the bottom. The figure labels each router with its cost to N, A 1, B and D 2, C 3, and draws each successor as an arrow: B and D point to A, C points to D.
Look at C and D before anything fails. C's successor is D. B reports 2, less than C's feasible distance of 3, so B passes too: C holds a feasible successor. D reaches N at 2, through A; its only other neighbour, C, reports 3, which is not less than 2.
Only D goes active. It loses its successor and nothing it has left passes the test, so it has to ask:
A QUERY is sent to all neighbors on all interfaces. The QUERY origin flag is to indicate that the router originated the QUERY.
The RFC's own account of this failure, on this network:
Only observing the destination provided by node N, D enters the ACTIVE state and sends a QUERY to all its neighbors, in this case node C.
All neighbours, on all interfaces. Not the one it used to use; all of them. Here that is one router, C. You will also meet a second form of that sentence, for a router that goes active because its own successor queried it:
A QUERY is sent to all neighbors on all interfaces that are not split horizon. Split horizon takes effect for a query or update from the successor it is using for the destination in the query.
The exception removes the successor that asked. It never bounds the spread, so when you reason about how far a query travels, treat it as everyone.
C is asked, and C answers from its own table, because B still passes:
If a Feasible Successor is found, the QUERY is not propagated and a REPLY is sent for the destination with a metric equal to the current routing table metric. C determines that it has a Feasible Successor and replies immediately with metric 3.
C's distance did not move, 3 through D before and 3 through B after in the RFC's own figures, so it has nothing new to tell anyone. On a change like this the RFC sends an UPDATE only when there is something new:
In either case, an UPDATE is sent with the new metric information if it has changed.
So a router that stays passive is not guaranteed to be silent. It sends no query. It sends an UPDATE if its metric changed. C's did not.
Now the shape of the whole thing. A question that spreads, and answers that come back:
A diffusing computation grows by querying additional routers for their current RD to the affected destination, and it shrinks by receiving replies from them. Unaffected routers send replies immediately, terminating the growth of the diffusing computation over them.
The event was one link going down. What it cost was decided earlier, by whether each router already held a path that passes the test. C did, so the question stopped at C. A and B took no part:
Notice that nodes A and B were not involved in the recalculation since they were not affected by the change.
Which reframes the feasibility condition from 1.3.b.i. It looked like a rule about which backup routes you are allowed to keep. It is the test that decides whether a failure stays with one router or becomes a question for its neighbours.
Getting out of active
Ask yourself how many replies D needs before it can finish. One good one, or all of them?
All of them. A reply only clears that neighbour's flag:
The route stays in ACTIVE state if there are more replies pending because the router has not heard from all neighbors.
Reproduced from RFC 7868's state machine legend: the reply status flag, one per neighbour per destination.
rijk REPLY status flag for each neighbor k for destination j 1 = awaiting REPLY 0 = received REPLY
D receives the REPLY and can transition out of ACTIVE state since it received replies from all its neighbors.
D had one neighbour to hear from, so C's reply was the last. Now notice something easy to miss: D goes passive without C passing the test. C reports 3; D's old FD is 2. When the router that went active is the one that started the query, the RFC resets the FD instead:
Since the QUERY origin flag indicates either the router itself originated the QUERY or FC was not satisfied with the replies received in ACTIVE state, FD is reset to infinite value and the minimum of all the reported metrics is chosen as FD and route transitions back to PASSIVE state.
D takes the lowest reported path, through C, at the cost the RFC gives, 4, and its FD becomes 4. In the transitions where what comes back does pass the test, the RFC puts it plainly:
When the Feasibility Condition is met, the route state transitions to PASSIVE.
Either way, the gate is the last reply, not the first good one. So what about a neighbour that never replies? A neighbour that has gone is not waited on: losing the link to it counts as its answer.
Continue the lesson
The whole lesson, with its drawings and its questions. The rest of this section and 5 more after it.

