38-37
Cisco Catalyst Blade Switch 3130 for Dell Software Configuration Guide
OL-13270-01
Chapter38 Configuring IP Unicast Routing Configuring EIGRP
EIGRP offers these features:
•Fast convergence.
•Incremental updates when the state of a destination cha ng es , i nst ea d of s en ding t he en tir e cont e nts
of the routing table, minimizing the bandwidth required f or EI GRP p ac kets.
•Less CPU usage because full update packets need not be processed each time they are received.
•Protocol-independent neighbor discovery mechanism to learn about neigh borin g routers.
•Variable-length subnet masks (VLSMs).
•Arbitrary route summarization.
•EIGRP scales to large networks.
EIGRP has these four basic components:
•Neighbor discovery and recovery is the process that routers use to dynamically learn of other routers
on their directly attached networks. Routers must also di scover wh en thei r nei gh bors be co me
unreachable or inoperative. Neighbor discovery and recovery is achieved with low overhead by
periodically sending small hello packets. As long as hello packets are received, the Cisco IOS
software can learn that a neighbor is alive and functioning. When this status is determined, the
neighboring routers can exchange routing information.
•The reliable transport protocol is responsible for guaranteed, ordered delivery of EIGRP packets to
all neighbors. It supports intermixed transmission of multicast and unicast packets. Some EIGRP
packets must be sent reliably, and others need not be. For efficiency, reliability is provided only
when necessary. For example, on a multiaccess network that has multicast capabilities (such as
Ethernet), it is not necessary to send hellos reliably to all neighbors individually. Therefore, EIGRP
sends a single multicast hello with an indication in the packet informing the receivers that the packet
need not be acknowledged. Other types of packets (such as updates) require acknowledgment, which
is shown in the packet. The reliable transport has a provision to send multicast packets quickly when
there are unacknowledged packets pending. Doing so helps ensure that convergence time remains
low in the presence of varying speed links.
•The DUAL finite state machine embodies the decision process for all route computations. It tracks
all routes advertised by all neighbors. DUAL uses the distance information (known as a metric) to
select efficient, loop-free paths. DUAL selects routes to be inserted into a routing table based on
feasible successors. A successor is a neighboring router used for packet forwarding that has a
least-cost path to a destination that is guaranteed not to be part of a routing loop. When there are no
feasible successors, but there are neighbors advertising the d estinatio n, a reco mputat ion must o ccur.
This is the process whereby a new successor is determined. The amount of time it takes to recompute
the route affects the convergence time. Recomputation is processor-intensive; it is advantageous to
avoid recomputation if it is not necessary. When a topology change occurs, DUAL tests for fea sible
successors. If there are feasible successors, it uses any it finds to avoid unnecessary recomputation.
•The protocol-dependent modules are responsible for network layer protocol-specific tasks. An
example is the IP EIGRP module, which is responsible for sending and receiving EIGRP packets
that are encapsulated in IP. It is also responsible for parsing EIGRP packets and informing DUAL
of the new information received. EIGRP asks DUAL to make routing decisions, but the results are
stored in the IP routing table. EIGRP is also responsible for redistributing routes learned by other
IP routing protocols.
These sections contain this configuration information:
•Default EIGRP Configuration, page 38-38
•Configuring Basic EIGRP Parameters, page38-40
•Configuring EIGRP Interfaces, page 38-41