Courseiva
EIGRPRoutingIntermediate29 min read

What Is Successor in Networking?

Reviewed byJohnson Ajibi· Senior Network & Security Engineer · MSc IT Security
On This Page

Quick Definition

A successor is the best next hop for a network destination in EIGRP. It is the route with the lowest cost that is guaranteed to be loop-free. When traffic needs to reach a specific network, the router sends it to the successor router. If that path fails, EIGRP immediately uses a backup called a feasible successor.

Commonly Confused With

A successor is the primary route with the lowest feasible distance (FD) and is installed in the routing table. A feasible successor is a backup route that meets the feasibility condition (advertised distance < feasible distance) but has a higher FD and is not active unless the successor fails. Many learners think they are the same, but only one route is the active successor at any moment.

If your primary route to a destination has FD 1000, and a secondary route has FD 1500 but its AD is 800 (which is < 1000), the secondary is a feasible successor. It's ready to take over, but it is not the successor.

SuccessorvsAdvertised Distance (AD)

Advertised distance is the metric that a neighbor router reports to get to the destination (from its own perspective). The successor uses the neighbor's AD plus the local link cost to compute FD. People sometimes confuse AD with the metric of the entire path, but AD is only the portion from the neighbor to the destination, not including the local router's link.

If Router B tells Router A that it can reach network X with metric 5000, that 5000 is the AD. Router A then adds its own link cost of 1000 to get FD 6000. Router B is the successor if 6000 is the lowest FD among all paths.

SuccessorvsMetric

The metric is the value computed by EIGRP (based on bandwidth, delay, etc.) that represents the cost of a path. The successor is selected based on the metric (the lowest metric path is the successor). However, metric alone does not identify the successor if you do not know which neighbor is providing that metric. The successor is the next-hop router that offers that best metric.

Two paths may have metrics 1000 and 1200. The path with metric 1000 is the successor, but the successor is the specific router (next hop) that provides that metric, not just the number.

SuccessorvsDiffusing Update Algorithm (DUAL)

DUAL is the algorithm that EIGRP uses to calculate and maintain routes, including the selection of successors and feasible successors. The successor is a result of DUAL's computation, not the algorithm itself. DUAL also handles route recomputation when the successor fails.

DUAL is like the engine that processes route information; the successor is one of the outputs of that engine. Knowing DUAL helps you understand why a successor is chosen, but they are not interchangeable terms.

SuccessorvsRouting Table Entry

The routing table contains the best path(s) for each destination, which includes the successor(s). However, the routing table does not list feasible successors. Some learners think any route in the routing table is the successor, but if there are multiple equal-cost paths, all are successors. If there is only one, that is the successor. But the routing table also contains routes from other protocols; the successor term is specific to EIGRP.

If 'show ip route' shows a route with next-hop 10.0.0.1 and metric 30720, that next-hop is the successor for that EIGRP learned route. But if you see another EIGRP route with metric 30720 as well, both next-hops are successors.

Must Know for Exams

The successor concept is a high-frequency topic in the CCNA exam (200-301), specifically under the routing technologies domain. Cisco explicitly expects candidates to describe EIGRP operation, including the DUAL algorithm and the role of successor and feasible successor. In the exam objectives, you will find items like ‘Compare and contrast EIGRP and OSPF’ and ‘Configure and verify EIGRP (classic and named mode)’. Within these, you need to know how EIGRP selects the best path, which is directly the successor selection. The exam often presents topology tables or outputs from show ip eigrp topology or show ip route eigrp and asks you to identify the successor, feasible successor, or explain why a given route is not a feasible successor. For example, you might see a topology table with three routes to 10.1.1.0/24: Route via 192.168.1.1 with FD 30720 and AD 28160, via 192.168.1.2 with FD 33280 and AD 30720, via 192.168.1.3 with FD 30720 and AD 28160. The question might ask: ‘Which route is the successor?’ and you would need to pick the one with the lowest FD (30720), but you also need to check if any of those are feasible successors (AD < FD). In this case, both routes via 192.168.1.1 and 192.168.1.3 have FD 30720? That would be equal, so they could both be successors if EIGRP supports equal-cost load balancing. But if FD values differ, the lowest is successor.

Another common question type involves troubleshooting scenarios. For instance, a network engineer reports that after a link failure, traffic takes longer than expected to recover. You are given routing tables and EIGRP debug output showing queries. The exam expects you to realize that there was no feasible successor for that prefix, forcing EIGRP to go active and send queries, which caused the delay. So you need to understand when a feasible successor exists and when it does not. Other times, the exam might give you a scenario with multiple routers and ask you to manually compute the metric (using bandwidth and delay) to determine which neighbor becomes the successor. This requires you to know the metric formula (at least the simplified version) and how to derive bandwidth and delay from show interfaces output. You may also see questions about the difference between successor and feasible successor in terms of AD and FD. For example: ‘What condition must be met for a route to be a feasible successor?’ Answer: ‘The advertised distance must be less than the feasible distance.’

In the CCNA, these questions are typically multiple-choice, but there are also drag-and-drop and simlet (simulation) questions where you type commands. The exam might also ask about EIGRP convergence — for example, ‘What happens when the successor for a network becomes unreachable and a feasible successor exists?’ The correct answer is that the router immediately installs the feasible successor into the routing table without sending queries. Understanding these nuances is essential to passing the routing section of the exam. Additionally, the successor concept appears in the context of EIGRP load balancing (variance), where you must know that routes with a metric less than or equal to the successor’s metric multiplied by the variance can be used for unequal-cost load balancing. So mastering successor helps you answer a wide variety of questions, not just direct identification ones.

Simple Meaning

Think of a successor as your go-to person for a specific task. Imagine you need to get a package delivered across town. You have a list of couriers, each with a different delivery time. The successor is the courier that promises the fastest and most reliable service — the one you always hand the package to first. If that courier is unavailable, you have a backup courier (called a feasible successor) ready to step in without you having to call every courier again. In networking terms, a router maintains a routing table with all known destinations. For each destination, EIGRP picks one best path — the successor — and may have one or more backup paths ready. This ensures that if the primary router fails, traffic can be rerouted almost instantly. The successor is chosen based on something called the composite metric, which EIGRP calculates from bandwidth, delay, reliability, load, and MTU along the path. The successor path must also be loop-free, which is guaranteed by a condition called the feasibility condition. This is important because in a complex network, a router might receive information about a path that looks good but is actually a loop — EIGRP’s algorithm prevents that. The successor concept is central to EIGRP’s fast convergence, meaning the network recovers quickly from failures without losing data packets or causing slowdowns. For IT professionals, understanding successors helps in designing resilient networks that can handle outages without interruption.

In simpler terms, the successor is the router that gets your data first because it offers the shortest, safest path to the final destination. It’s like a highway’s express lane that gets you there fastest. If that lane is closed, EIGRP already has an alternative route ready, so traffic keeps flowing smoothly. This is why EIGRP is favored in many enterprise networks — it doesn’t waste time recalculating everything after a failure. The successor is always the best choice, but it’s not permanent; if network conditions change (like a link becomes slower), EIGRP recalculates and may pick a new successor. In exam questions, you will be asked to identify which route is the successor based on given metrics, or to determine whether a backup path qualifies as a feasible successor. Mastering this concept helps you understand how EIGRP keeps networks stable and efficient, which is a core skill for CCNA candidates.

Full Technical Definition

In EIGRP (Enhanced Interior Gateway Routing Protocol), a successor is the next-hop router that satisfies the feasibility condition and has the lowest feasible distance (FD) for a given destination network. The successor is derived from the EIGRP Diffusing Update Algorithm (DUAL), which guarantees loop-free paths at every instant. The feasible distance (FD) is the metric of the best path known to the router for a specific destination, calculated using the EIGRP composite metric formula: Metric = [K1 * bandwidth + (K2 * bandwidth) / (256 - load) + K3 * delay] * (K5 / (reliability + K4)). By default, only K1 and K3 are used, simplifying to metric = bandwidth + delay. bandwidth is computed as (10^7 / minimum bandwidth along the path) * 256, and delay is the sum of all outgoing interface delays in tens of microseconds, multiplied by 256. The successor must have an advertised distance (AD) — the metric reported by the neighbor to the destination — that is strictly less than the local router’s FD. This is the feasibility condition (FC), which ensures the neighbor is closer to the destination and does not route back through the local router, thus preventing routing loops.

EIGRP maintains three tables: the neighbor table, the topology table, and the routing table. The topology table contains all routes learned from neighbors, each with a reported distance (AD) and the local feasible distance (FD). Routes that meet the feasibility condition are marked as feasible successors and are stored as backup routes. The route with the lowest FD is selected as the successor and placed into the routing table with the next-hop address of the successor router. If the successor becomes unreachable (due to link failure or neighbor loss), EIGRP immediately promotes the best feasible successor to the successor role, which is called a local computation. This happens without sending any queries, enabling sub-second convergence. If no feasible successor exists, the router enters active state and sends queries to all neighbors to find a new path, which is slower and requires careful design to avoid queries flooding.

In real IT implementation, EIGRP is deployed in Cisco networks for its fast convergence and low overhead. Network engineers configure EIGRP with a process ID and network statements on interfaces. The successor concept affects route summarization, load balancing (EIGRP supports unequal-cost load balancing via variance), and interaction with other protocols like OSPF. In CCNA exams, candidates must calculate metrics from given bandwidth and delay values to identify the successor, or analyze which path qualifies as a feasible successor. Understanding successor vs feasible successor is critical for troubleshooting EIGRP convergence issues and for designing networks that meet service-level agreements. EIGRP’s use of successor ensures that routing decisions are deterministic and based on solid mathematical foundations, making it a reliable choice for many organizations.

DUAL uses the successor as the primary path for all traffic. When a route changes, DUAL performs a diffusing computation only if needed. The successor might change after a topology change (e.g., a link speed change or a neighbor removal). The router recalculates the FD and selects a new successor from the topology table. This dynamic adjustment ensures the routing table always reflects the best possible path without administrative intervention. In summary, the successor is the backbone of EIGRP’s routing decision — it is the single best path that guarantees loop-free, efficient forwarding.

Real-Life Example

Imagine you are the manager of a team of delivery drivers, and your job is to get packages from your warehouse to customers across a large city. You have a map with several possible routes to each customer, each with its own travel time. One particular customer, say a downtown office building, has three potential drivers you can assign. Driver A takes 20 minutes, Driver B takes 25 minutes, and Driver C takes 30 minutes. Driver A is your successor — the one you assign first every time because they are fastest. But you also need a backup in case Driver A’s truck has a problem. You check Driver B: their route is longer but they do not go through any area that would loop back to your warehouse (like a dead end that leads them back). So Driver B qualifies as a feasible successor — they can step in immediately without you having to call all drivers to find a new route. If Driver A is unavailable, you simply tell Driver B to take the package without any delay.

Now, if Driver C also wanted the job, but their route goes through a congested area that eventually leads back to the warehouse, that would create a loop — the package would never reach the customer. In networking terms, that would be a route that does not meet the feasibility condition, so it can’t be a feasible successor. The successor (Driver A) is the best choice based on the fastest time, but you also need to ensure that backup routes are loop-free. This analogy maps directly to EIGRP: each router is like a warehouse, each neighbor driver is a neighboring router, the travel time is the metric (bandwidth and delay), and the condition that backup drivers don’t loop back is the feasibility condition. In your network, the successor is the neighbor router that offers the fastest, loop-free path to a destination. If that neighbor fails, a feasible successor (a backup that also meets the feasibility condition) can be used instantly. This is why EIGRP can converge so quickly after a failure — it already has the backup plan ready, just like you having Driver B ready to go.

The real-life analogy also helps explain the metric calculation. If you had to choose between Driver A and Driver B not just on time but also on fuel efficiency (bandwidth) and reliability (delay), you might use a formula. EIGRP uses bandwidth and delay by default, plus optional load and reliability. So the successor is not just the fastest but the one that balances these factors. In the exam, you will often be given numbers for bandwidth (like a fast 1 Gbps link) and delay (like 100 microseconds) and asked to compute which neighbor is the successor. Understanding this real-life mapping makes it easier to remember why the successor is important and how it is selected.

Why This Term Matters

The concept of a successor is fundamental to EIGRP because it directly influences how quickly a network can recover from a failure. In enterprise networks, downtime costs money — every minute that a link is down can mean lost sales, reduced productivity, or even safety risks in critical systems. EIGRP’s successor mechanism ensures that there is always one best path (the successor) and that backup paths (feasible successors) are pre-computed and loop-free. This means that when a primary link fails, the router can switch to a backup within milliseconds, without having to recalculate routes from scratch or flood the network with query messages. For network administrators, this translates to high availability and predictable performance. Without the successor concept, routing protocols would need to run full SPF calculations (like OSPF) or send queries to all neighbors (like old EIGRP without DUAL), which can cause network instability and slower convergence.

Another reason the successor matters is that it helps manage network traffic efficiently. By always forwarding packets through the best path, the network uses its resources (bandwidth and router processing) optimally. EIGRP also supports unequal-cost load balancing, where you can configure a variance parameter to allow traffic to be distributed among multiple successors (if they meet certain conditions). This is useful when you have links of different speeds and want to use them all without overloading the fastest one. The successor concept also simplifies troubleshooting: if a route is not working, you can check the routing table to see which next-hop is the successor and whether a feasible successor is available. This gives you immediate insight into the network’s redundancy. Moreover, understanding successors is crucial for designing networks that meet service-level agreements (SLAs). If you have two links to an ISP, you can ensure that one is the successor and the other is a feasible successor, so that if the primary link fails, traffic fails over instantly without user impact.

In summary, the successor is not just an abstract concept; it is the practical tool that EIGRP uses to provide fast convergence, efficient routing, and network resilience. For anyone studying for CCNA, it is a core building block for understanding how dynamic routing works in real environments. When you configure EIGRP in a lab or at work, you are relying on this mechanism to keep your network running smoothly.

How It Appears in Exam Questions

Exam questions about the successor typically fall into three main patterns: identification, computation, and troubleshooting.

Identification questions present you with a topology table or a routing table and ask you to point out the successor for a given destination network. For example, you might see output from ‘show ip eigrp topology 10.0.0.0/16’ showing multiple paths. One path has FD 409600, AD 281600. Another has FD 512000, AD 409600. A third has FD 281600? Wait, if FD is 281600, that is lower than 409600, so that would be the successor. But the trick is that you must check that the AD of the successor is less than the local FD (which it always is for the route installed as successor). The question might ask: ‘Which of the following is the successor for network 10.0.0.0/16?’ and you choose the entry with the lowest FD. Multiple-choice options might list the next-hop IP addresses along with their metrics. Another variation: ‘How many successors are there for 192.168.2.0/24?’ If the topology shows two routes with equal FD (same metric), they are both successors and EIGRP load balances across them (by default up to 4 equal-cost paths). So you must count the routes with the lowest FD.

Computation questions give you the bandwidth and delay of each link along a path. For example: ‘Router A has two paths to network 10.1.1.0/24. Path 1: Bandwidth 100000 Kbps, Delay 1000 microseconds. Path 2: Bandwidth 10000 Kbps, Delay 500 microseconds. Which path is the successor?’ You need to compute the metric using the formula: metric = (10^7/bandwidth in Kbps)*256 + (delay in tens of microseconds)*256. For Path 1: (10^7/100000)*256 = 100*256 = 25600. Delay 1000 microseconds = 100 tens of microseconds, so 100*256 = 25600. Total = 51200. For Path 2: (10^7/10000)*256 = 1000*256 = 256000. Delay 500 microseconds = 50 tens of microseconds, so 50*256 = 12800. Total = 268800. So Path 1 has the lower metric and is the successor. Sometimes they give you comparative values and ask you to select which neighbor would become the successor. These questions test your ability to apply the metric formula quickly.

Troubleshooting questions often present a scenario where the network is experiencing slow convergence after a link failure. The question might show the output of ‘show ip eigrp topology all-links’ and ask: ‘Why did EIGRP have to perform a query for network 10.0.0.0/8 after the failure of Router B?’ The answer would be that no feasible successor existed for that network because all alternative paths had an AD >= FD. Alternatively, you might see a show command output that lists active routes, and the question asks: ‘Which router is the successor for 10.0.0.0/8?’ You would need to look at the routing table entries and identify the one with the next-hop that has the lowest metric. Another common trap: the output shows a route that is listed as both successor and feasible successor? No, only one is the successor; others are feasible successors. But if a route meets the feasibility condition (AD < FD) but has a higher FD than the successor, it is a feasible successor, not a successor. Some questions deliberately confuse these terms. They might say ‘Which of the following is the feasible successor?’ and list the successor, expecting you to know the difference. So careful reading is required.

Practise Successor Questions

Test your understanding with exam-style practice questions.

Practise

Example Scenario

Consider a small company network with three routers: R1, R2, and R3. The goal is to reach the internal server network 10.10.10.0/24 connected to R3. R1 is the main office router, R2 is a branch router, and R3 is the server room router. R1 has two paths to reach 10.10.10.0/24. The first path: R1 -> R3 directly, with a fast 1 Gbps link. The second path: R1 -> R2 -> R3, with a slower 100 Mbps link from R1 to R2 and then 1 Gbps from R2 to R3. EIGRP is configured on all routers. R1 learns about network 10.10.10.0/24 from both R3 and R2.

From R3, the route has: FD = (10^7 / 1000000)*256 + (delay sum). Assume delay 10 microseconds = 1 tens, so 1*256 = 256. total = 10*256? Actually (10^7/1,000,000)=10, 10*256=2560, plus delay 1*256=256, total = 2816. From R2, the route has: FD = (10^7/100000)*256 (100 Mbps) = 100*256=25600, plus delay from R1 to R2 (say 100 microseconds = 10 tens, so 10*256=2560) plus delay from R2 to R3 (10 microseconds = 1 tens, 1*256=256) total delay = 11*256=2816, so total metric = 25600 + 2816 = 28416. So the route via R3 has FD 2816, which is lower than 28416, so R3 is the successor. The route via R2 has AD = the metric that R2 reports to R1. R2 reports its own FD to 10.10.10.0/24 from its perspective (say 2816 from R3 to R2? Actually careful: R2’s best path to 10.10.10.0 is via R3 with metric similar to 2816. So R2 advertises an AD of 2816 to R1. That AD (2816) is less than R1’s FD (2816)? Wait, the FD is 2816 from the successor, and the AD from R2 is 2816 also? That would be equal, so it does not satisfy AD < FD, so the route via R2 is NOT a feasible successor. This means if the link between R1 and R3 fails, R1 will have to go active and send queries to R2 (and others) to find a new path, causing a delay.

Now, if we change the scenario: suppose the link from R1 to R3 is 100 Mbps, so the metric via R3 becomes (10^7/100000)*256 = 25600, plus delay 10*256 = 2560? Actually let’s assume delay 100 microseconds total, metric = 25600 + 2560 = 28160. And the path via R2 remains with FD 28416, AD from R2 is still 2816? Wait, R2’s own FD to 10.10.10.0 would be (10^7/1000000)*256 = 2560 plus delay? so around 2816. That gives AD=2816 which is less than R1’s FD of 28160, so now the route via R2 qualifies as a feasible successor. If the primary link (R1->R3) fails, R1 can immediately use R2 as the new successor without any queries. This example shows how the feasibility condition works and why it matters for convergence.

Common Mistakes

Thinking that the route with the lowest advertised distance (AD) is the successor.

The successor is the route with the lowest feasible distance (FD), not the lowest advertised distance. AD is the metric reported by the neighbor, while FD is the metric from the local router. The local router calculates FD by adding its own link cost to the AD. So the successor must have the lowest total cost (FD).

Always check the FD (feasible distance) in the topology table. The route with the smallest FD is the successor, regardless of AD.

Assuming that any backup route is automatically a feasible successor.

A backup route only becomes a feasible successor if it satisfies the feasibility condition: the advertised distance (AD) must be strictly less than the local router’s feasible distance (FD) for that destination. If the AD is equal to or greater than the FD, that route cannot be used as an immediate backup and requires querying.

Compare AD against the FD of the current successor. If AD < FD, it is a feasible successor. Otherwise, it's just a potential route that requires further computation.

Believing that EIGRP always load balances across multiple successors equally.

EIGRP does load balance across multiple successors (equal-cost paths) by default, but only if they have identical FD metrics. If the metrics differ, they are not both successors. Only routes with the exact same metric are considered successors in equal-cost load balancing. Unequal-cost load balancing requires the 'variance' command and still uses the successor's metric as the baseline.

For equal-cost load balancing, only routes with the same FD are successors. Use 'show ip route eigrp' to see multiple next hops with the same metric.

Confusing the successor with the next-hop router in the routing table without checking if it's the best path.

The routing table only shows the active successor for each network. But if a student misidentifies a route as the successor just because it appears in the routing table, that is correct only if it's the best path. However, the confusion arises when there are multiple routes in the topology table, and a student picks one that is not the lowest FD. The routing table always contains the successor, but the topology table lists all routes.

Use 'show ip eigrp topology' to see all routes and their FD/AD values. The route with the lowest FD is the successor that will appear in the routing table.

Thinking that the feasibility condition is the same as the metric being lower.

The feasibility condition is not based on FD comparison but on AD < FD. A route might have a higher FD but still satisfy AD < FD, making it a feasible successor. Conversely, a route with a lower FD than another route might not satisfy the feasibility condition if its AD is greater than the local FD.

Remember: FD is total cost from local router; AD is cost reported by neighbor. Feasibility condition: AD < local FD.

Exam Trap — Don't Get Fooled

{"trap":"In some exam questions, they show a topology table entry where the route has an FD that is lower than the current successor's FD, but the AD is also higher than the local FD. The question asks: 'Is this route a successor?' The natural answer might be 'yes' because FD is lower, but the trap is that the AD condition is violated."

,"why_learners_choose_it":"Learners often focus only on FD value because that determines the best path. They forget that for a route to be considered as a possible successor, it must first be present in the topology table and meet basic conditions, but more importantly, if a route has a lower FD, it should become the successor unless there is a loop condition. However, if its AD >= FD, that indicates a potential loop, so EIGRP cannot use it as a successor without further checks.

In the exam, they present the FD and AD numbers in a way that looks like the route should be better, but the AD condition violates the feasibility condition.","how_to_avoid_it":"Always evaluate both FD and AD. A candidate successor must have AD < FD of the current best route (or more precisely, the local FD).

If the route has a lower FD than the current successor but does not meet AD < FD (maybe due to some topology change), it cannot be installed as successor until DUAL performs a diffusing computation. In the exam, when presented with numbers, check the AD against the FD of the current active route. If AD is greater or equal, that route is not a feasible successor and cannot become successor automatically."

Step-by-Step Breakdown

1

Step 1: Router learns about a destination network from its neighbors.

EIGRP-enabled routers exchange routing information using Hello packets to form neighbor adjacencies. Each neighbor sends updates containing the networks it can reach and the metric (advertised distance) from its perspective. The local router receives these updates and stores them in the topology table.

2

Step 2: Router calculates the feasible distance (FD) for each route.

For each route learned from a neighbor, the local router adds the cost of the link to that neighbor (derived from interface bandwidth and delay) to the advertised distance (AD). The result is the feasible distance (FD). The AD is the metric the neighbor uses to reach the destination, and the local router's link cost is added to represent the full path cost.

3

Step 3: Router compares FDs to identify the route with the lowest FD.

Among all routes for a given destination, the one with the smallest FD is considered the best path. This route's next-hop router is the successor candidate. If there are multiple routes with the exact same lowest FD, they are all candidates and will be used for equal-cost load balancing.

4

Step 4: Router verifies feasibility condition for each potential successor candidate.

For a route to be installed as the successor, its AD must be strictly less than the local router's FD? Actually, that condition is for a route to become a feasible successor. For the route with the lowest FD, it automatically becomes the successor because it's the best path. But for other routes to be feasible successors, they must satisfy AD < FD (of the successor). The successor itself always has AD <= FD (actually AD is always less than FD unless the link cost is zero, which is unlikely).

5

Step 5: Successor is installed in the routing table.

The route with the lowest FD (the successor) is added to the IP routing table. The next-hop IP address of this successor router is used for forwarding packets. The local router begins sending traffic to the destination via this successor.

6

Step 6: Router identifies any feasible successors from the topology table.

For each alternative route in the topology table, the router checks if the AD is less than the FD of the current successor. If true, that route is marked as a feasible successor and kept as a backup. If not, the route is considered a possible route but not immediately usable as a backup.

7

Step 7: If the successor becomes unreachable, router promotes the best feasible successor.

When the link to the successor fails or the neighbor goes down, EIGRP checks if there is any feasible successor. The best feasible successor (with the lowest FD among those) is immediately installed in the routing table as the new successor, without sending queries. This allows sub-second convergence. If no feasible successor exists, the router goes into active state and sends queries to find a new path.

Practical Mini-Lesson

In practice, understanding the successor is essential for designing and troubleshooting EIGRP networks. When you configure EIGRP on a Cisco router, you will use commands like router eigrp [ASN], network [network] to enable the protocol. The router automatically discovers neighbors and builds the topology table. To see the successor for a specific network, you use show ip route eigrp or show ip eigrp topology. The output shows you the feasible distance (FD) and the next-hop router. For example, if you see 'D 10.0.0.0/16 [90/30720] via 192.168.1.1, 00:01:23, GigabitEthernet0/0', the successor is 192.168.1.1 with metric 30720. The 'D' indicates EIGRP, and the 90 is the administrative distance. The FD is 30720.

When testing redundancy, you might simulate a link failure by shutting down an interface. If a feasible successor exists, the routing table will update almost instantly, and you can verify with show ip route that the next-hop changed to the backup router. If there is no feasible successor, you will see the route go down temporarily as EIGRP sends queries and recalculates. This can be observed with debug eigrp or by timing the convergence.

Network professionals often need to influence which router becomes the successor. You can adjust the bandwidth or delay on interfaces to change the metric. For example, if you want to prefer a specific link, you can set a lower delay on that interface. Or to avoid a link, set a higher delay. This is called administrative metric manipulation. Another common practice is to use the 'variance' command to allow unequal-cost load balancing. For instance, if the successor's FD is 1000, and you set variance 2, any route whose FD is less than or equal to 2000 and that meets the feasibility condition can be used as a backup (load balancing). However, be careful: variance only applies to routes that are feasible successors, not just any route with a lower FD. The feasibility condition (AD < FD) must still hold.

What can go wrong? One common issue is that a feasible successor is not available because the AD of an alternative route is too high (equal to or greater than FD). This may happen if the alternative path includes a link that goes through the local router (forming a loop) or if the bandwidth/delay are very asymmetric. In such cases, convergence can be slow (active state). To fix this, you might redesign the network to ensure that backup paths have lower AD by adding faster links or adjusting routing so that the alternate neighbor has a better view of the destination. Another potential problem is that too many successors can cause routing instability if the metric fluctuates. EIGRP uses a holddown-like mechanism (but not exactly) to avoid flapping. Also, if you misconfigure the delay value (e.g., setting it too high), you might inadvertently make a slow path look better than a fast path, causing suboptimal routing.

In summary, mastering the successor concept in practice means you can control path selection, design for fast failover, and troubleshoot convergence issues. It's not just theory—it's a daily tool for network engineers.

Memory Tip

Think 'Successor = Lowest FD' and 'Feasible Successor = AD < FD'. Remember: FD is total cost, AD is neighbor's cost.

Covered in These Exams

Current Exam Context

Current exam versions that test this topic — use these objectives when studying.

Related Glossary Terms