What is EIGRP and How Does it Work
EIGRP stands for Enhanced Interior Gateway Routing Protocol and is an advanced distance-vector routing protocol. Unlike older protocols like RIP, EIGRP uses sophisticated metric calculations and achieves much faster convergence times.
How EIGRP Operates
EIGRP uses the Diffusing Update Algorithm (DUAL), which guarantees loop-free routing paths and enables rapid failover during network changes. The protocol establishes neighbor relationships using hello messages, similar to OSPF. When topology changes occur, EIGRP converges much faster than RIP because DUAL computes alternative paths efficiently.
Hybrid Protocol Characteristics
EIGRP is a hybrid routing protocol because it combines features of both distance-vector and link-state protocols. It shares routing information with neighbors like distance-vector protocols do, but also maintains detailed network topology information like link-state protocols. This hybrid approach gives EIGRP the best of both worlds: efficiency and rapid convergence.
Metric Calculation
EIGRP uses a composite metric considering bandwidth, delay, reliability, and load. By default, only bandwidth and delay influence the metric. The protocol is proprietary to Cisco but works best in Cisco-only environments. It supports both IPv4 and IPv6 routing and remains popular in modern networks due to its efficiency and reliability.
EIGRP Configuration and Key Metrics
Configuring EIGRP on Cisco routers requires memorizing fundamental commands for your CCNA exam. Start by entering router configuration mode and specifying the autonomous system number (AS), which must match across all routers sharing EIGRP routes.
Basic Configuration Commands
The primary commands are:
- router eigrp [AS-number]
- network [network-address] [wildcard-mask]
- no auto-summary
Note that the wildcard mask differs from subnet masks. It uses inverse bits: 0 means check that bit, and 1 means ignore that bit.
Understanding the Metric Formula
EIGRP's metric calculation is: metric = 256 * ((10^7 / bandwidth) + (delay / 10)). Bandwidth is the slowest link in the path (in bits per second). Delay is the sum of all interface delays along the path (in tens of microseconds). The multiply-by-256 factor maintains backward compatibility with IGRP.
K-Values and Weighting
The K-values determine which metric components influence calculations:
- K1 and K3 control bandwidth and delay (both equal 1 by default)
- K2 controls load (equals 0 by default)
- K4 and K5 control reliability (both equal 0 by default)
Only K1 and K3 are active by default, simplifying the formula to just bandwidth and delay.
Loop Prevention and Backup Routes
EIGRP uses feasible successors and feasible distances to maintain loop-free routing. The feasible distance is the lowest metric to reach a destination. A feasible successor is a backup route that meets the feasibility condition. The administrative distance for EIGRP is 90 for internal routes and 170 for external routes, making it preferred over RIP but subordinate to OSPF.
EIGRP Neighbors, Hello Intervals, and Hold Times
EIGRP neighbor relationships form the foundation of the routing protocol's operation. Routers send hello packets at regular intervals to discover and maintain neighbors. Understanding neighbor discovery is critical for CCNA exam success.
Default Hello and Hold Times
By default, EIGRP uses:
- Hello interval: 5 seconds on most interfaces
- Hello interval: 60 seconds on slower WAN links (Frame Relay)
- Hold time: 3 times the hello interval (15 seconds on LANs, 180 seconds on WAN)
The hold time determines how long a router waits before considering a neighbor down if no hello packets arrive.
Requirements for Neighbor Relationships
For two routers to become EIGRP neighbors, they must have matching values in critical fields:
- Same subnet
- Same autonomous system number
- Compatible K-values
Important Tables and Commands
Each EIGRP router maintains three key tables:
- Neighbor table (view with show ip eigrp neighbors): All directly connected EIGRP neighbors
- Topology table (view with show ip eigrp topology): All routes learned from neighbors, including feasible successors
- Routing table (view with show ip route eigrp): Routes selected for actual packet forwarding
When a neighbor goes down, EIGRP uses DUAL to quickly compute alternative paths, providing rapid network convergence. EIGRP sends hello packets using multicast address 224.0.0.10 on most interfaces. Update packets contain routing information and are sent only when network changes occur, making EIGRP very efficient compared to RIP's periodic updates. The reliable transport protocol (RTP) ensures update packets reach all neighbors.
EIGRP Authentication, Load Balancing, and Advanced Features
EIGRP includes advanced security and performance features critical for CCNA exam success and real-world deployment. These features help protect your network and optimize traffic flow.
MD5 Authentication
MD5 authentication ensures routing updates only come from authorized routers. Configure it using:
- ip authentication key-chain eigrp [AS] [keychain]
- Each interface must have a matching authentication key for neighbors to form relationships
This security feature protects against unauthorized routing updates that could compromise network stability.
Load Balancing
Load balancing in EIGRP distributes traffic across multiple paths. By default, EIGRP performs equal-cost load balancing across up to 4 paths. You can increase this to a maximum of 32 paths using the maximum-paths command.
Unequal-cost load balancing is enabled using the variance command. This multiplier determines how much worse an alternative path can be compared to the feasible distance before it's used for load balancing.
Summarization and Redistribution
EIGRP supports automatic summarization and manual route summarization to reduce routing table size. Configure manual summarization on individual interfaces using:
- ip summary-address eigrp [AS] [address] [mask]
This aggregates multiple networks into a single routing entry. EIGRP also supports redistribution of routes from other routing protocols like RIP, OSPF, and static routes.
Stub Routing
Stub routing designates certain routers as stubs to reduce query flooding during network convergence. This feature is especially useful in hub-and-spoke network topologies where remote sites don't need to pass through queries.
Troubleshooting EIGRP and Exam Preparation Strategies
Troubleshooting EIGRP requires a systematic approach and knowledge of critical show commands. These commands appear throughout your CCNA career and on the certification exam.
Essential Show Commands
Memoriz these verification commands:
- show ip eigrp neighbors: Displays active EIGRP neighbors with IP addresses and hold times
- show ip eigrp topology: Reveals the topology table with all known routes and metric values
- show ip route eigrp: Filters the routing table to display only EIGRP-learned routes
- show ip eigrp interfaces: Shows EIGRP configuration on each interface
Debug commands like debug eigrp packets and debug eigrp fsm provide detailed operation information but should be used carefully due to CPU impact.
Common EIGRP Issues
Typical troubleshooting scenarios include:
- Mismatched autonomous system numbers
- Incorrect wildcard masks preventing network advertisement
- Authentication key mismatches
- Mismatched K-values between neighbors
- Incorrect interface configuration
Using Flashcards for Exam Success
Flashcards are particularly effective for EIGRP because the protocol involves numerous configuration commands, metric calculations, and default values requiring memorization. Break EIGRP topics into small, focused flashcard questions covering:
- Show command outputs and their meanings
- Configuration command syntax
- Metric calculation formulas
- Default values like hello intervals and administrative distance
- DUAL algorithm concepts
- Troubleshooting decision trees
Review flashcards in multiple sessions rather than cramming. Space your studying over several weeks to improve long-term retention. Practice hands-on lab configurations alongside flashcard study to reinforce conceptual knowledge with practical experience. Focus special attention on DUAL algorithm concepts, metric calculations, and feasible distance relationships, as these are frequently tested topics.
