Вы находитесь на странице: 1из 6

EIGRP uses the Diffusing Update Algorithm (DUAL) to provide the best loop-free path and loop-free

backup paths.
DUAL uses several terms, which are discussed in more detail throughout this section:

Successor

Feasible Distance (FD)

Feasible Successor (FS)

Reported Distance (RD) or Advertised Distance (AD)

Feasible Condition or Feasibility Condition (FC)

These terms and concepts are at the center of the loop avoidance mechanism of DUAL.

7.3.3.2 Introduction to DUAL

EIGRP uses convergence algorithm DUAL. Convergence is critical to a network to avoid routing
loops.
Routing loops, even temporary ones, can be detrimental to network performance. Distance vector
routing protocols, such as RIP, prevent routing loops with hold-down timers and split horizon.
Although EIGRP uses both of these techniques, it uses them somewhat differently; the primary way
that EIGRP prevents routing loops is with the DUAL algorithm.
Click Play in the figure to view the basic operation of DUAL.
The DUAL algorithm is used to obtain loop-freedom at every instance throughout a route computation.
This allows all routers involved in a topology change to synchronize at the same time. Routers that
are not affected by the topology changes are not involved in the recomputation. This method provides
EIGRP with faster convergence times than other distance vector routing protocols.
The decision process for all route computations is done by the DUAL Finite State Machine (FSM). An
FSM is a workflow model, similar to a flow chart that is composed of the following:

A finite number of stages (states)

Transitions between those stages

Operations

The DUAL FSM tracks all routes, uses EIGRP metrics to select efficient, loop-free paths, and identify
the routes with the least-cost path to be inserted into the routing table.
Recomputation of the DUAL algorithm can be processor-intensive. EIGRP avoids recomputation
whenever possible by maintaining a list of backup routes that DUAL has already determined to be
loop-free. If the primary route in the routing table fails, the best backup route is immediately added to
the routing table.

7.3.3.3 Successor and Feasible Distance

Figure 1 shows the topology for this topic. A successor is a neighboring router that is used for packet
forwarding and is the least-cost route to the destination network. The IP address of a successor is
shown in a routing table entry right after the word via.
FD is the lowest calculated metric to reach the destination network. FD is the metric listed in the
routing table entry as the second number inside the brackets. As with other routing protocols, this is
also known as the metric for the route.
Examining the routing table for R2 in Figure 2, notice that EIGRPs best path for the 192.168.1.0/24
network is through router R3, and that the feasible distance is 3,012,096. This is the metric that was
calculated in the previous topic.

7.3.3.4 Feasible Successors, Feasibility Condition, and Reported Distance


DUAL can converge quickly after a change in the topology because it can use backup paths to other
networks without recomputing DUAL. These backup paths are known as Feasible Successors (FSs).
An FS is a neighbor that has a loop-free backup path to the same network as the successor, and it
satisfies the Feasibility Condition (FC). R2s successor for the 192.168.1.0/24 network is R3,
providing the best path or lowest metric to the destination network. Notice in Figure 1, that R1
provides an alternative path, but is it an FS? Before R1 can be an FS for R2, R1 must first meet the
FC.
The FC is met when a neighbors Reported Distance (RD) to a network is less than the local routers
feasible distance to the same destination network. If the reported distance is less, it represents a loopfree path. The reported distance is simply an EIGRP neighbors feasible distance to the same
destination network. The reported distance is the metric that a router reports to a neighbor about its
own cost to that network.
In Figure 2, R1s feasible distance to 192.168.1.0/24 is 2,170,112.

R1 reports to R2 that its FD to 192.168.1.0/24 is 2,170,112.

From R2s perspective, 2,170,112 is R1s RD.

R2 uses this information to determine if R1 meets the FC and, therefore, can be an FS.

As shown in Figure 3, because the RD of R1 (2,170,112) is less than R2s own FD (3,012,096), R1
meets the FC.
R1 is now an FS for R2 to the 192.168.1.0/24 network.
If there is a failure in R2s path to 192.168.1.0/24 via R3 (successor), then R2 immediately installs the
path via R1 (FS) in its routing table. R1 becomes the new successor for R2s path to this network, as
shown in Figure 4.

7.3.3.5 Topology Table: show ip eigrp topology Command


Figure 1 shows the topology.
The EIGRP topology table contains all of the routes that are known to each EIGRP neighbor. As an
EIGRP router learns routes from its neighbors, those routes are installed in its EIGRP topology table.
As shown in Figure 2, use the show ip eigrp topology command to view the topology table.
The topology table lists all successors and FSs that DUAL has calculated to destination networks.
Only the successor is installed into the IP routing table.

7.3.3.6 Topology Table: show ip eigrp topology Command (Cont.)


As shown in Figure 1, the first line in the topology table displays:

P - Route in the passive state. When DUAL is not performing its diffusing computations to
determine a path for a network, the route is in a stable mode, known as the passive state. If
DUAL recalculates or searches for a new path, the route is in an active state and displays an A.
All routes in the topology table should be in the passive state for a stable routing domain.

192.168.1.0/24 - Destination network that is also found in the routing table.

1 successors - Displays the number of successors for this network. If there are multiple equal
cost paths to this network, there are multiple successors.

FD is 3012096 - FD, the EIGRP metric to reach the destination network. This is the metric
displayed in the IP routing table.

As shown in Figure 2, the first subentry in the output shows the successor:

via 192.168.10.10 - Next-hop address of the successor, R3. This address is shown in the
routing table.

3012096 - FD to 192.168.1.0/24. It is the metric shown in the IP routing table.

2816 - RD of the successor and is R3s cost to reach this network.

Serial 0/0/1 - Outbound interface used to reach this network, also shown in the routing table.

As shown in Figure 3, the second subentry shows the FS, R1 (if there is not a second entry, then
there are no FSs):

via 172.16.3.1 - Next-hop address of the FS, R1.

41024256 - R2s new FD to 192.168.1.0/24, if R1 became the new successor and would be the
new metric displayed in the IP routing table.

2170112 - RD of the FS, or R1s metric to reach this network. RD must be less than the current
FD of 3,012,096 to meet the FC.

Serial 0/0/0 - This is the outbound interface used to reach FS, if this router becomes the
successor.

7.3.3.7 Topology Table: No Feasible Successor


To see how DUAL uses successors and FSs, examine the routing table of R1, assuming the network
is converged, as shown in Figure 1.
Figure 2 displays a partial output from theshow ip route command on R1. The route to
192.168.1.0/24 shows that the successor is R3 via 192.168.10.6 with an FD of 2,170,112.
The IP routing table only includes the best path, the successor. To see if there are any FSs, we must
examine the EIGRP topology table. The topology table in Figure 3 only shows the successor
192.168.10.6, which is R3. There are no FSs. By looking at the actual physical topology or network
diagram, it is obvious that there is a backup route to 192.168.1.0/24 through R2. R2 is not an FS
because it does not meet the FC. Although, looking at the topology, it is obvious that R2 is a backup
route, EIGRP does not have a map of the network topology. EIGRP is a distance vector routing
protocol and only knows about remote network information through its neighbors.
DUAL does not store the route through R2 in the topology table. All links can be displayed using
the show ip eigrp topology all-links command. This command displays links whether
they satisfy the FC or not.
As shown in Figure 4, the show ip eigrp topology all-links command shows all possible
paths to a network, including successors, FSs, and even those routes that are not FSs. R1s FD to
192.168.1.0/24 is 2,170,112 via the successor R3. For R2 to be considered a FS, it must meet the
FC. R2s RD to R1 to reach 192.168.1.0/24 must be less the R1s current FD. Per the figure, R2s RD
is 3,012,096, which is higher than R1s current FD of 2,170,112.
Even though R2 looks like a viable backup path to 192.168.1.0/24, R1 has no idea that the path is not
a potential loop back through itself. EIGRP is a distance vector routing protocol, without the ability to
see a complete, loop-free topological map of the network. DUALs method of guaranteeing that a
neighbor has a loop-free path is that the neighbors metric must satisfy the FC. By ensuring that the
RD of the neighbor is less than its own FD, the router can assume that this neighboring router is not
part of its own advertised route; thus, always avoiding the potential for a loop.
R2 can be used as a successor if R3 fails; however, there is a longer delay before adding it to the
routing table. Before R2 can be used as a successor, DUAL must do further processing.

7.3.4.1 DUAL Finite State Machine (FSM)


The centerpiece of EIGRP is DUAL and its EIGRP route-calculation engine. The actual name of this
technology is DUAL Finite State Machine (FSM). This FSM contains all of the logic used to calculate
and compare routes in an EIGRP network. The figure shows a simplified version of the DUAL FSM.
An FSM is an abstract machine, not a mechanical device with moving parts. FSMs define a set of
possible states that something can go through, what events cause those states, and what events
result from those states. Designers use FSMs to describe how a device, computer program, or routing
algorithm reacts to a set of input events.
FSMs are beyond the scope of this course. However, the concept is used to examine some of the
output from EIGRPs FSM using the debug eigrp fsm command. Use this command to examine
what DUAL does when a route is removed from the routing table.

7.3.4.2 DUAL: Feasible Successor


R2 is currently using R3 as the successor to 192.168.1.0/24. In addition, R2 currently lists R1 as an
FS, as shown in Figure 1.
The show ip eigrp topology output for R2 in Figure 2 verifies that R3 is the successor and R1
is the FS for the 192.168.1.0/24 network. To understand how DUAL can use a FS when the path
using the successor is no longer available, a link failure is simulated between R2 and R3.
Before simulating the failure, DUAL debugging must be enabled using the debug eigrp
fsm command on R2, as shown in Figure 3. A link failure is simulated using
the shutdowncommand on the Serial 0/0/1 interface on R2.
The debug output displays the activity generated by DUAL when a link goes down. R2 must inform
all EIGRP neighbors of the lost link, as well as update its own routing and topology tables. This
example only shows selected debug output. In particular, notice that the DUAL FSM searches for and
finds an FS for the route in the EIGRP topology table.
The FS R1 now becomes the successor and is installed in the routing table as the new best path to
192.168.1.0/24, as shown in Figure 4. With an FS, this change in the routing table happens almost
immediately.
As shown in Figure 5, the topology table for R2 now shows R1 as the successor and there are no new
FSs. If the link between R2 and R3 is made active again, then R3 returns as the successor and R1
once again becomes the FS.

7.3.4.3 DUAL: No Feasible Successor


Occasionally, the path to the successor fails and there are not any FSs. In this instance, DUAL does
not have a guaranteed loop-free backup path to the network, so the path is not in the topology table
as an FS. If there are not any FSs in the topology table, DUAL puts the network into the active state.
DUAL actively queries its neighbors for a new successor.

R1 is currently using R3 as the successor to 192.168.1.0/24, as shown in Figure 1. However, R1 does


not have R2 listed as an FS, because R2 does not satisfy the FC. To understand how DUAL searches
for a new successor when there is no FS, a link failure is simulated between R1 and R3.
Before the link failure is simulated, DUAL debugging is enabled with the debug eigrp
fsm command on R1, as shown in Figure 2. A link failure is simulated using
the shutdowncommand on the Serial 0/0/1 interface on R1.
When the successor is no longer available and there is no feasible successor, DUAL puts the route
into an active state. DUAL sends EIGRP queries asking other routers for a path to the network. Other
routers return EIGRP replies, letting the sender of the EIGRP query know whether or not they have a
path to the requested network. If none of the EIGRP replies have a path to this network, the sender of
the query does not have a route to this network.
The selected debug output in Figure 2 shows the 192.168.1.0/24 network put into the active state and
EIGRP queries sent to other neighbors. R2 replies with a path to this network, which becomes the
new successor and is installed into the routing table.
If the sender of the EIGRP queries receives EIGRP replies that include a path to the requested
network, the preferred path is added as the new successor and added to the routing table. This
process takes longer than if DUAL had an FS in its topology table and was able to quickly add the
new route to the routing table. In Figure 3, notice that R1 has a new route to the 192.168.1.0/24
network. The new EIGRP successor is router R2.
Figure 4 shows that the topology table for R1 now has R2 as the successor with no new FSs. If the
link between R1 and R3 is made active again, R3 returns as the successor. However, R2 is still not
the FS, because it does not meet the FC.

Вам также может понравиться