Lecture Note 10 - Dynamic Routing Protocols III (EIGRP)
Lecture Note 10 - Dynamic Routing Protocols III (EIGRP)
Introduction to EIGRP
What is EIGRP?
EIGRP is a Cisco-proprietary advanced distance-vector routing protocol.
Combines features of distance-vector and link-state protocols.
Supports IPv4, IPv6, and multiple routed protocols like IPX and AppleTalk (legacy support).
Uses the Diffusing Update Algorithm (DUAL) to ensure loop-free and efficient routing.
Key Characteristics of EIGRP:
Classless Routing: Supports VLSM (Variable-Length Subnet Masking).
Fast Convergence: Thanks to DUAL, EIGRP can quickly adapt to network changes.
Bandwidth Optimization: Sends incremental updates instead of full table updates.
Hello Packets: Used to establish and maintain neighbor relationships.
Reliability: Reliable Transport Protocol (RTP) ensures delivery of critical routing information.
Scalability: Suitable for both small and large networks.
EIGRP Components:
Neighbor Table: Lists directly connected routers running EIGRP.
Topology Table: Contains all learned routes and their metrics.
Routing Table: Stores the best routes from the topology table.
Configuring EIGRP
Basic Configuration Steps:
Enable EIGRP on the Router:
router eigrp <AS number>
Specify Networks to Advertise:
network <network-address> <wildcard-mask>
Optional Adjustments:
Set router ID, adjust metrics, etc.
Example Configuration:
Assuming the router has interfaces 192.168.1.0/24 and 192.168.2.0/24:
router eigrp 100
network 192.168.1.0 0.0.0.255
network 192.168.2.0 0.0.0.255
Note: Replace 100 with the appropriate Autonomous System (AS) number.
EIGRP for IPv6:
Enable IPv6 routing:
ipv6 unicast-routing
EIGRP setup:
ipv6 router eigrp <AS number>
Activate EIGRP on interfaces:
interface <interface-name>
ipv6 eigrp <AS number>
Passive Interface:
Prevent EIGRP updates from being sent out specific interfaces:
passive-interface <interface-name>
EIGRP Metrics:
Composite metric using the following parameters:
Bandwidth: Minimum bandwidth of the path.
Delay: Cumulative delay along the path.
Load: Dynamic measure of traffic.
Reliability: Dynamic measure of the link's quality.
Default formula:
Metric= [(K1* Bandwidth) + (K3 * Delay)] * 256
By default: K1=1 and 𝐾3=1 K3=1; 𝐾2, 𝐾4, and 𝐾5 are set to 0.
DUAL Algorithm (Diffusing Update Algorithm):
Ensures loop-free paths and rapid convergence.
Maintains a Successor (best path) and Feasible Successor (backup path).
Concepts:
Successor: Path with the lowest metric and is loop-free.
Feasible Successor: Backup route that satisfies the Feasibility Condition (FC):
o Advertise Distance < Feasible Distance
Advertised Distance (AD): Reported distance from a neighbor.
Feasible Distance (FD): Total distance to a destination through a specific path.
EIGRP Troubleshooting
Check Neighbor Relationships:
Use:
show ip eigrp neighbors
Ensure correct AS numbers, subnet masks, and interfaces are in use.
Verify Advertised Networks:
show ip eigrp topology
Ensure the desired networks appear in the topology table.
Examine Routing Table:
show ip route
Confirm EIGRP routes are present.
Debugging Commands:
Neighbor Formation Issues:
debug eigrp packets
Route Updates:
debug eigrp updates