EIGRP Fundamentals – DUAL Algorithm, Feasible Successors, and Metrics

Introduction

In modern networking, Enhanced Interior Gateway Routing Protocol (EIGRP) is a powerful routing protocol that combines the best of both distance-vector and link-state routing. It is widely used in enterprise and industrial networks due to its fast convergence, scalability, and efficient use of bandwidth.

At the heart of EIGRP lies the DUAL (Diffusing Update Algorithm), which ensures efficient routing and loop prevention. This blog will cover EIGRP fundamentals, including its DUAL algorithm, feasible successors, and metric calculation, helping network engineers understand its practical applications.

What is EIGRP?

Definition

EIGRP is an advanced distance-vector routing protocol developed by Cisco. Unlike traditional distance-vector protocols like RIP, EIGRP introduces features of link-state routing, making it faster, more scalable, and more efficient.

Key Features of EIGRP

✅ Fast Convergence – Uses DUAL to calculate the best routes quickly. ✅ Loop-Free Routing – Employs feasible successors to prevent routing loops. ✅ Classless Routing – Supports VLSM and CIDR. ✅ Supports Multiple Network Protocols – Works with IPv4, IPv6, AppleTalk, and IPX. ✅ Efficient Bandwidth Usage – Only sends updates when necessary. ✅ Uses Composite Metric – Factors bandwidth, delay, reliability, and load.

Understanding the DUAL Algorithm in EIGRP

What is the DUAL Algorithm?

The Diffusing Update Algorithm (DUAL) is the core of EIGRP. It is responsible for selecting the best route and maintaining backup routes, ensuring fast convergence and loop-free routing.

How DUAL Works

Neighbor Discovery – EIGRP routers exchange Hello packets to establish neighbors.
Topology Table Maintenance – Each router maintains a table of all learned routes.
Best Path Selection – The router selects the successor (best route) based on feasible distance (FD).
Backup Route Identification – A feasible successor (backup route) is chosen if it meets the feasibility condition.
Route Updates – Only updates are sent when a route change occurs, improving efficiency.

DUAL ensures EIGRP converges quickly by avoiding unnecessary recalculations and ensuring a loop-free topology.

EIGRP Topology Table and Feasible Successors

EIGRP maintains three key tables:

Neighbor Table – Lists directly connected EIGRP routers.
Topology Table – Stores all learned routes and their metrics.
Routing Table – Contains only the best (successor) routes used for forwarding traffic.

Successors vs. Feasible Successors

Type	Definition
Successor	The best route to a destination, installed in the routing table.
Feasible Successor	A backup route that meets the feasibility condition (FC) and is kept in the topology table for fast failover.

Feasibility Condition (FC)

For a route to be a feasible successor, its advertised distance (AD) must be less than the feasible distance (FD) of the current best route.

Formula:

AD < FD

This ensures loop prevention and allows routers to switch to backup routes instantly if the primary route fails.

EIGRP Metric Calculation

Unlike RIP, which only considers hop count, EIGRP uses a composite metric based on multiple factors:

EIGRP Metric Formula:

Metric = [(K1 × Bandwidth) + (K2 × Bandwidth ÷ (256 – Load)) + (K3 × Delay)] × K5 ÷ (Reliability + K4)

By default, only Bandwidth and Delay are used (K1=1, K3=1, K2=0, K4=0, K5=0), making the metric formula:

Metric = (Bandwidth + Delay) × 256

Key Metric Components:

Metric	Definition
Bandwidth	The lowest bandwidth (in kbps) along the path.
Delay	The cumulative delay (in microseconds) of all links.
Reliability	The worst reliability value of links (scaled from 0-255).
Load	The worst traffic load on the path (scaled from 0-255).
MTU	Maximum Transmission Unit (not used in metric calculation).

Using a composite metric allows EIGRP to choose the best path based on multiple factors, optimizing network performance.

EIGRP Packet Types

EIGRP uses five types of packets for communication:

Packet Type	Function
Hello	Establishes and maintains neighbor relationships.
Update	Sends routing information to neighbors.
Query	Asks neighbors for routing information when no feasible successor exists.
Reply	Responds to queries with available routing information.
ACK (Acknowledgment)	Confirms receipt of an update or query.

This optimized packet structure ensures efficient network communication.

Configuring EIGRP in a Cisco Router

Basic EIGRP Configuration

Router(config)# router eigrp 100
Router(config-router)# network 192.168.1.0 0.0.0.255
Router(config-router)# no auto-summary

EIGRP 100 – The autonomous system (AS) number.
network 192.168.1.0 – Defines the network to advertise.
no auto-summary – Disables automatic summarization.

Verifying EIGRP Configuration

Check EIGRP neighbors:Router# show ip eigrp neighbors
Display the EIGRP topology table:Router# show ip eigrp topology
View EIGRP routes in the routing table:Router# show ip route eigrp

Real-World Applications of EIGRP

1. Enterprise and Data Center Networks

Used for fast failover and scalable routing.
Supports load balancing and redundancy.

2. Industrial Automation and SCADA Networks

Ensures reliable routing between PLCs, HMIs, and sensors.
Provides low-latency communication for real-time control.

3. Campus and Service Provider Networks

Used in multi-site environments for optimal routing.
Ensures fast convergence during network failures.

Conclusion

EIGRP is a powerful and efficient routing protocol that offers fast convergence, loop prevention, and scalability. Its DUAL algorithm ensures optimal path selection, while feasible successors provide instant failover.

By leveraging EIGRP’s composite metrics, neighbor discovery, and efficient packet handling, network engineers can build high-performance and resilient networks.

Understanding DUAL, feasible successors, and metric calculation is crucial for optimizing network design, reducing downtime, and improving routing efficiency.

Are you using EIGRP in your network? Share your thoughts in the comments!

Share The Post :