What Is Feasible Successor in Networking?
On This Page
Quick Definition
In computer networking, a feasible successor is a backup path that can take over instantly if the main path stops working. It is like having a spare tire already in the trunk, not just a promise to send help. This makes the network recover from failures much faster without extra calculations.
Commonly Confused With
The successor is the primary route with the lowest Feasible Distance to a destination. A feasible successor is a backup route that meets the feasibility condition. Only one route is the successor at a time, but there can be multiple feasible successors. The successor is actively used in the routing table, while feasible successors are kept in the topology table for backup.
If you have two routes to a store, the fastest one (10 minutes) is the successor. The slower route (15 minutes) is a feasible successor if it doesn't go through a road that loops back.
Advertised Distance is a metric value announced by a neighboring router, representing its distance to the destination. It is used to determine if a route can be a feasible successor. The AD is compared to the current Feasible Distance (FD) of the successor. AD is not a route; it is a metric used in the feasibility condition.
Your neighbor says, 'I am 5 miles from the mall.' That 5 miles is the AD. You are 3 miles from the neighbor, so your total route is 8 miles. Your current best route might be 6 miles, so the AD (5) is less than that 6, making it a feasible backup.
Feasible Distance is the total metric from the local router to the destination, calculated for each path. The lowest FD becomes the successor. All other routes with FD higher than the successor may become feasible successors if their AD is less than the successor's FD. FD includes the local router's metric to the next hop plus the AD from that neighbor.
If you are calculating the distance to a store via a friend: your distance to the friend (2 miles) plus the friend's distance to the store (4 miles) gives a total of 6 miles—that is the FD for that path.
Must Know for Exams
The feasible successor concept is a core topic in the CCNA exam, particularly under the routing protocols section. Cisco expects candidates to understand not only the definition but also the mechanics of EIGRP convergence, the feasibility condition, and how DUAL operates. The CCNA exam objectives explicitly include configuring and verifying EIGRP, and questions often test the understanding of successor and feasible successor states.
For example, a multiple-choice question might ask: 'Which condition must be met for a route to be considered a feasible successor in EIGRP?' The correct answer is that the Reported Distance from the neighbor must be less than the Feasible Distance of the successor. Another common question type presents a topology table output and asks which routes are feasible successors.
Candidates must be able to read the output and apply the feasibility condition. Troubleshooting scenarios also appear: a router does not have a feasible successor for a route, and the candidate must identify why, possibly due to a misconfiguration or incorrect metric. The exam may also test the difference between equal-cost and unequal-cost load balancing, and how feasible successors relate to the variance command.
To score well, students must memorize the feasibility condition formula: Advertised Distance < Feasible Distance. They should also practice interpreting show commands like 'show ip eigrp topology' and 'show ip route eigrp'. The exam may include drag-and-drop or simulation questions that require adding a feasible successor by adjusting interface metrics.
Beyond the CCNA, feasible successors are also relevant for the CCNP ENCOR and ENARSI exams, where deeper troubleshooting and optimization are tested. For the CCNA, this term is directly listed in the exam blueprint under 3.0 Routing Technologies.
Therefore, a solid grasp of feasible successors is not optional; it is a must-pass concept.
Simple Meaning
Imagine you drive to work every day and your usual route goes over a bridge. One morning, the bridge is closed for repairs. If you know another road that works just as well and you have that route saved in your memory, you can switch to it immediately without stopping to check a map.
That backup route is your feasible successor. In computer networks, routers use a protocol called EIGRP to find the best path to send data. The best path is called the successor, and the feasible successor is a backup path that meets certain criteria.
The main requirement is that the backup path must be guaranteed not to create a loop, meaning it is a safe, reliable alternative. The router keeps a list of these backup routes ready. If the main path fails, the router switches to the feasible successor without any delay, keeping the network running smoothly.
This is important because networks need to be reliable, and having a quick backup helps avoid interruptions. Without this feature, the router would have to recalculate all possible paths, which takes time and can slow things down. The feasible successor makes the network more resilient and efficient, which is why it is a key concept for networking professionals to understand.
Full Technical Definition
A Feasible Successor is a concept integral to the Enhanced Interior Gateway Routing Protocol (EIGRP), a Cisco proprietary distance-vector routing protocol. EIGRP uses the Diffusing Update Algorithm (DUAL) to maintain loop-free paths and provide rapid convergence. The successor is the primary route to a destination, chosen based on the lowest feasible distance (FD).
The FD is the metric value calculated for a path, typically based on bandwidth, delay, load, reliability, and maximum transmission unit (MTU), though by default only bandwidth and delay are used. A feasible successor is a backup route that is guaranteed to be loop-free. For a route to qualify as a feasible successor, it must satisfy the feasibility condition: the reported distance (RD) from the next-hop router must be less than the current feasible distance (FD) of the successor.
The RD is the metric advertised by the neighbor for that destination, representing the neighbor's own distance to the target. This condition ensures that the backup path does not route traffic back through the local router, preventing routing loops. When a successor fails, EIGRP immediately promotes a feasible successor (if one exists) to become the new successor, without needing to run DUAL and send queries to neighbors.
This provides sub-second convergence in many cases. If no feasible successor exists, EIGRP enters an active state and sends queries to all neighbors to find an alternative path. The concept of feasible successor is implemented in the EIGRP topology table, which stores all known routes to a network, including both successors and feasible successors.
The topology table is distinct from the routing table, which contains only the best routes. In real IT implementations, network engineers rely on feasible successors to design highly available networks, especially in WAN or data center environments where link failures can have significant impact. Feasible successors also influence EIGRP load balancing; by default, EIGRP can load balance across up to four equal-cost paths, but it can also be configured for unequal-cost load balancing using the variance command, which allows traffic to be shared across feasible successors with different metrics as long as they meet certain criteria.
Understanding feasible successors is critical for troubleshooting EIGRP convergence issues and for optimizing network performance.
Real-Life Example
Think of a busy airport with multiple runways. The main runway (the successor) is used for most landings and takeoffs. But the airport also has backup runways (feasible successors) that are fully maintained and ready for use.
If the main runway suddenly gets blocked by debris or weather conditions, air traffic controllers can instantly direct planes to the backup runway without any delay. They don't have to call a different airport or consult a manual to find an alternative. The backup runway was already evaluated and approved, so the switch is smooth and fast.
In the same way, a router using EIGRP evaluates all possible paths to a destination. The best path is stored as the successor, and any other path that meets the feasibility condition is kept as a feasible successor. If the main path fails, the router immediately uses the backup without recalculating.
This analogy also highlights the importance of the feasibility condition. Not every backup runway is acceptable; it must be long enough, properly lit, and not obstructed. Similarly, in EIGRP, a feasible successor must meet a strict condition to ensure it won't cause a loop.
This careful preparation makes the network resilient and efficient, just like a well-run airport. Another everyday analogy is having a spare key for your house. You don't wait to call a locksmith when you lose your keys; you simply use the spare.
The spare key is your feasible successor. It only works if it fits the lock, which is like the feasibility condition. Both examples show how having a pre-verified backup can save time and prevent frustration.
Why This Term Matters
In practical IT networking, the concept of feasible successor is essential for building reliable and fast-converging networks. When a network link goes down, every second of downtime can cost an organization money, productivity, and reputation. EIGRP's ability to use feasible successors allows routers to switch to backup paths in milliseconds, often without any noticeable interruption to users.
This is especially important in critical environments like financial trading, healthcare systems, or emergency services where network availability is paramount. Network professionals must understand feasible successors to design redundant topologies correctly. For example, if a network has multiple paths to a remote site, engineers need to ensure that at least one path qualifies as a feasible successor to achieve fast failover.
If the design does not satisfy the feasibility condition, the router will have to fall back to the slower query process, increasing convergence time. Additionally, feasible successors play a role in unequal-cost load balancing. By using the variance command, administrators can allow traffic to be distributed across multiple paths, including feasible successors, to utilize network bandwidth more efficiently.
This can improve performance without buying more circuits. However, misconfiguration can lead to suboptimal routing or even loops. Therefore, a deep understanding of feasible successors helps network engineers avoid mistakes and optimize their EIGRP deployments.
In summary, feasible successors are not just a theoretical concept; they are a practical tool that directly impacts network performance and reliability. For anyone studying for the CCNA exam, mastering this topic is crucial because it appears in multiple exam objectives and real-world troubleshooting scenarios.
How It Appears in Exam Questions
In the CCNA exam, feasible successor questions often appear in multiple-choice, drag-and-drop, and simulation formats. One typical pattern is a scenario-based question that presents a network diagram with multiple EIGRP routers. The question describes a failure of the primary link and asks which backup route will be used immediately.
The answer depends on whether any path meets the feasibility condition. Another common question displays a topology table listing multiple routes with their Feasible Distance (FD) and Advertised Distance (AD). The candidate must identify which entries are successors and which are feasible successors.
For example, the topology table might show Route A: FD 100, AD 50; Route B: FD 120, AD 90; Route C: FD 200, AD 150. If the successor has FD 100, then Route B with AD 90 is a feasible successor because 90 < 100. Route C with AD 150 is not a feasible successor because 150 is not less than 100.
There are also troubleshooting questions where a router fails to converge quickly because no feasible successor exists. The candidate must determine the cause, such as unequal metrics due to different bandwidths or delays on parallel links. Another pattern involves the variance command.
For instance, 'An EIGRP network has a successor with metric 1000 and two feasible successors with metrics 2000 and 2500. If variance is set to 3, which routes will be used for load balancing?' The candidate must know that variance multiplies the successor's metric by the variance value, and any feasible successor with a metric less than that product is eligible.
So, 1000 * 3 = 3000, so both feasible successors qualify. Simulation questions might ask to configure EIGRP and then verify feasible successors using 'show ip eigrp topology'. The candidate might be asked to adjust an interface metric to turn a non-feasible path into a feasible successor.
Understanding these question patterns helps candidates focus their study on the practical application of the feasibility condition and EIGRP convergence behavior.
Practise Feasible Successor Questions
Test your understanding with exam-style practice questions.
Example Scenario
You are a network administrator setting up EIGRP in a small company network with three routers: Router A, Router B, and Router C. The network 10.0.0.0/24 is located behind Router C.
Router A is connected to Router C via a fast Ethernet link, and also to Router B, which in turn connects to Router C. The link from A to C has a bandwidth of 100 Mbps and a delay of 100 microseconds, giving a feasible distance (FD) of 100. The path from A to C through B has a combined metric FD of 150, and Router B advertises a distance (AD) to network 10.
0.0.0/24 of 80 to Router A. Since the AD of 80 is less than the FD of 100, this backup path qualifies as a feasible successor. Now, suppose the direct link between A and C fails. Router A does not need to query its neighbors because it already has a feasible successor via B.
It immediately installs that route into its routing table and continues forwarding traffic with a short interruption. If the link failure causes a disruption of only a few milliseconds, users may not even notice. However, if the link from A to C had a FD of 100 and the path through B had an AD of 110 (which is greater than 100), that path would not be a feasible successor.
In that case, if the direct link fails, Router A would have to send queries to all neighbors, wait for replies, and compute a new route, a process that can take several seconds. This scenario shows why network design must consider the feasibility condition. By engineering links so that backup paths have a low AD relative to the primary path's FD, administrators can ensure fast convergence.
For the CCNA exam, you might be asked to identify which paths in a similar topology are feasible successors or to modify interface metrics to create feasible successors. This scenario is typical for simulation questions where you configure EIGRP and then use show commands to verify the topology table.
Common Mistakes
Thinking that any backup route is a feasible successor.
EIGRP only considers a route as a feasible successor if it strictly meets the feasibility condition: the Advertised Distance (from the neighbor) must be less than the Feasible Distance of the current successor. A backup route existing does not automatically qualify it.
Always check the AD against the FD. Only if AD < FD can it be a feasible successor.
Confusing Feasible Distance (FD) with Advertised Distance (AD).
The FD is the total metric from the local router to the destination, while the AD is the metric advertised by the neighbor. Using them interchangeably leads to incorrect calculations and network design errors.
Remember: FD is the end-to-end metric via a given path. AD is the metric from the neighbor to the destination. They are different.
Assuming a feasible successor is always a backup with a metric equal to the successor.
Feasible successors can have higher metrics than the successor. They are still viable backup routes as long as the AD < FD. The metric can be larger, but the condition ensures loop-free operation.
Focus on the condition AD < FD, not on the absolute metric value.
Believing that a router can have multiple feasible successors for the same destination in all cases.
While it is possible to have more than one feasible successor, it is not guaranteed. It depends on the network topology and whether multiple routes satisfy the feasibility condition. A common misconception is that every destination will have a feasible successor, but many networks have only a single path.
Verify the topology table using 'show ip eigrp topology' to see if feasible successors exist. Design the network to have redundant links with appropriate metrics if fast failover is needed.
Exam Trap — Don't Get Fooled
{"trap":"In an EIGRP simulation, the question might show a topology table where a route has an AD equal to the FD of the successor. Many learners assume that since the AD is not greater, the route is a feasible successor.","why_learners_choose_it":"Learners may misinterpret the condition as AD <= FD (less than or equal) instead of strictly AD < FD.
The Cisco documentation requires strictly less than.","how_to_avoid_it":"Memorize the exact condition: Advertised Distance < Feasible Distance. If AD equals FD, the route is not a feasible successor.
This prevents loops because equal distances could imply a loop in certain topologies."
Step-by-Step Breakdown
Identify all possible routes to a destination network.
EIGRP routers exchange routing information with neighbors. Each router builds a topology table containing all routes learned from neighbors. For each route, the router records the next-hop router, the Feasible Distance (FD), and the Advertised Distance (AD) from that neighbor.
Select the route with the lowest Feasible Distance as the successor.
The successor is the route that will be placed in the routing table and used to forward packets. It has the best metric (lowest FD). This is the primary path.
For each remaining route, compare its Advertised Distance to the successor's Feasible Distance.
The feasibility condition is: AD < FD_successor. Only if the AD is strictly less than the successor's FD does the backup route qualify as a feasible successor. This condition prevents loops by ensuring the alternative path does not go back through the local router.
Store the qualified routes as feasible successors in the topology table.
Routes meeting the condition are marked as feasible successors. They are kept in the topology table but not in the routing table, ready to be used if the successor fails. They are not actively used for forwarding unless the successor fails or unequal-cost load balancing is configured.
If the successor fails, promote the best feasible successor to become the new successor.
When the link to the successor goes down, EIGRP immediately promotes the feasible successor with the lowest FD into the routing table. This happens without sending queries to neighbors, resulting in very fast convergence (sub-second). If no feasible successor exists, EIGRP enters an active state and sends queries to find an alternative path.
Practical Mini-Lesson
Let us dive deeper into the practical aspects of feasible successors in EIGRP. As a network professional, you will often need to design and troubleshoot EIGRP networks. The first step is understanding how to influence the feasibility condition through link metrics.
By default, EIGRP uses bandwidth and delay. Bandwidth is inversely proportional to the metric; a higher bandwidth results in a lower cost. Delay is additive. For example, if you have two parallel links to a neighbor, one with 100 Mbps and the other with 10 Mbps, the 100 Mbps link will produce a lower FD.
If the path through the 10 Mbps link has an AD that is less than the FD of the 100 Mbps link, it becomes a feasible successor. But if the AD is too large, it does not. In practice, to ensure fast failover, you can configure the delay on backup links to be low, or adjust bandwidths, but careful planning is needed because these changes also affect path selection.
Another key point is the use of the 'variance' command for unequal-cost load balancing. Variance allows traffic to be distributed across multiple paths, including feasible successors, even if their metrics are higher. For instance, if the successor has a metric of 100 and you set variance to 2, any feasible successor with a metric up to 200 can be used for load balancing.
This can improve throughput, but you must ensure that the paths are loop-free (which they are, because they are feasible successors). However, using variance without proper planning can cause suboptimal routing if the backup path has much higher delay or loss. When troubleshooting, you should use 'show ip eigrp topology' to view the topology table.
In the output, feasible successors are indicated by the state code 'P' (Passive) and the number of successors (e.g., 1 successor, 0 feasible successors). If the output shows '0 feasible successors', it means the network lacks a loop-free backup.
You can then examine the AD values to see why certain routes do not qualify. For example, if a route has AD 120 and the successor's FD is 100, that route fails the condition. You might then adjust the bandwidth or delay on the backup link to lower its AD, perhaps by increasing the bandwidth or decreasing the delay.
But be careful: increasing bandwidth on a slow link does not speed it up; it only changes how the router calculates the metric. In practice, you should set bandwidth to match the actual speed of the link. One common mistake is using 'bandwidth' command on a serial link to trick EIGRP, but this can lead to routing inconsistencies.
Instead, adjust the delay using 'delay' command on the interface, which is a more straightforward way to tweak metrics. Remember that changing delay affects the path's metric for all routes using that interface. In summary, mastery of feasible successors requires not only theoretical knowledge but also hands-on practice with configurations and show commands.
Practice on lab equipment or simulators to see how changes in metrics affect the topology table and convergence. This practical experience will serve you well in both the exam and real-world networking.
Memory Tip
Feasible Successor: AD must be less than FD. Think 'AD is the distance from the neighbor, FD is the total. For a safe backup, the neighbor's distance must be smaller than your total. If the neighbor's distance is bigger, it might loop.'
Covered in These Exams
Current Exam Context
Current exam versions that test this topic — use these objectives when studying.
200-301Cisco CCNA →N10-009CompTIA Network+ →Related Glossary Terms
802.1Q is the networking standard that allows multiple virtual LANs (VLANs) to share a single physical network link by tagging Ethernet frames with VLAN identification information.
802.1X is a network access control standard that authenticates devices before they are allowed to connect to a wired or wireless network.
Frequently Asked Questions
Can a feasible successor be used for load balancing?
Yes, feasible successors can be used for load balancing if you enable unequal-cost load balancing using the variance command. By default, EIGRP only load balances across equal-cost paths (successors with same metric). With variance, you can include feasible successors with higher metrics.
What happens if there is no feasible successor when a successor fails?
If no feasible successor exists, the router enters an active state and sends queries to all neighbors to find an alternative path. This process takes longer than promoting a feasible successor, potentially several seconds.
Is the feasibility condition always AD < FD?
Yes, the condition is strictly Advertised Distance (from the neighbor) less than the Feasible Distance (of the successor). If AD equals FD, the route is not a feasible successor, as it could cause a routing loop.
How do I see feasible successors in a router?
Use the command 'show ip eigrp topology'. The output lists all routes with their FD and AD. Routes that are feasible successors will have a state code of 'P' (Passive) and will be listed after the successor. The number of successors and feasible successors is shown for each network.
Can a feasible successor have a lower metric than the successor?
Normally, the successor has the lowest Feasible Distance. If a backup path had a lower metric, it would be the successor. However, if the backup path has a lower FD but the AD is not less than the successor's FD (which would be higher), it might not qualify. In practice, the successor always has the lowest FD.
Does EIGRP only have one feasible successor per destination?
No, EIGRP can have multiple feasible successors for the same destination as long as each meets the feasibility condition. The topology table can store several backup routes.
Summary
A feasible successor is a backup route in EIGRP that is immediately available when the primary route (successor) fails, without requiring a full recalculation by the DUAL algorithm. The key to understanding feasible successors is the feasibility condition: the Advertised Distance from the neighbor must be strictly less than the Feasible Distance of the current successor. This condition ensures loop-free operation and allows sub-second convergence.
In networking practice, feasible successors are vital for building reliable, redundant networks that recover quickly from link failures. They also enable unequal-cost load balancing when combined with the variance command. For the CCNA exam, candidates must be able to identify feasible successors from topology tables, apply the feasibility condition, and understand how they affect convergence and load balancing.
Common mistakes include confusing AD with FD, assuming all backups are feasible successors, and misinterpreting the condition as less than or equal. By mastering this concept, network professionals can design more resilient networks and troubleshoot EIGRP issues effectively. Remember the memory tip: 'AD must be less than FD.'
This simple rule will help you answer exam questions correctly and make better design decisions.