0% found this document useful (0 votes)
53 views37 pages

What Is Eigrp?

Definition of EIGRP Features of EIGRP EIGRP Terminology How does EIGRP work THE DUAL ALGORITHM Configuring EIGRP

Uploaded by

sinan sinan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
53 views37 pages

What Is Eigrp?

Definition of EIGRP Features of EIGRP EIGRP Terminology How does EIGRP work THE DUAL ALGORITHM Configuring EIGRP

Uploaded by

sinan sinan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 37

EIGRP

● Sid ahmed AIBOUT


● Slimane KAID

M.BENDAOUED
Table of contents

Definition of EIGRP 01 04 How does EIGRP work

Features of EIGRP 02 05 THE DUAL ALGORITHME

EIGRP Terminology 03 06 Configuring EIGRP


WHAT IS
EIGRP?
Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance-
vector routing protocol that is used on a computer network for
automating routing decisions and configuration. The protocol was designed
by Cisco Systems as a proprietary protocol, available only on Cisco routers.
Functionality of EIGRP was converted to an open standard in 2013

EIGRP is used on a router to share routes with other routers within the
same autonomous system.

EIGRP replaced the Interior Gateway Routing Protocol (IGRP) in 1993. One of the
major reasons for this was the change to classless IPv4 addresses in the Internet
Protocol, which IGRP could not support.
Features of EIGRP

Fast convergence

Performs Partial Updates as needed

Classless Routing Protocol (VLSM, CIDR)

Better handling of routing loops – (DUAL)

EIGRP supports both IPv4 and IPv6

Saturn is made of
hydrogen and helium
Features of EIGRP

Consumes less bandwidth (no broadcasts, no periodic updates, updates contain only changes)

Sends topology changes, rather than sending the entire routing table when a route is changed.

The ability to use different authentication passwords at different times.

Reliable Transport Protocol – USE (RTP) for delivery of EIGRP packets.

MD5 and SHA-2 authentication between two routers.

Hybrid Distance Vector/Link State


EIGRP Terminology
01 05
Neighbor table Feasible Distance (FD)

02 06
Topology table Successor

03 07
Routing table Feasible successor (FS)

04 08
Advertised Distance Passive Versus Active
(AD) Routes
Neighbor Table
The neighbor table keeps a record of the IP addresses of routers that
have a direct physical connection with this router. Routers that are
connected to this router indirectly, through another router, are not
recorded in this table as they are not considered neighbors.

Routing table
Contains EIGRP successor routes.
Topology Table
The topology table stores routes that it has learned from neighbor
routing tables. The topology table also records the metrics for each of
the listed EIGRP routes. Routes in the topology table are not usable by
the router until they are inserted into the routing table. The topology
table is never used by the router to forward traffic. Routes in the
topology table will not be inserted into the routing table if they are
active
AD versus FD

Advertised Distance (AD)


Advertised distance (AD), also referred to as the Reported Distance,
is the cost between the next-hop router and the destination.

Feasible Distance (FD)


Feasible distance (FD) is the cost between the local router and the
next-hop router plus the next-hop router's AD to the destination
network.
Successor and Feasible Successor
Successor
Successor: A successor is a neighboring router that has a least-cost path to a
destination (the lowest FD) Successor routes are offered to the routing table to
be used for forwarding packets. Multiple successors can exist if they have the
same FD.
Feasible Successor
A feasible successor is a neighbor that is closer to the destination, but it is not
the least-cost path. A feasible successor ensures a loop-free topology because
it must have an AD less than the FD of the current successor route. Feasible
successors are selected at the same time as successors but are kept in the
topology table as backups to the successor routes. The topology table can
maintain multiple feasible successors for a destination.
Passive versus Active Routes

Passive Route
A route is considered passive when the router is not performing
recomputation on that route. Passive is the operational, stable state.

Active route
A route is active when it is undergoing recomputation.
How does
EIGRP work
?
EIGRP works through 3 steps

Data Collection Data Exchange Best route


selection
Collect data from nearby Data exchange with
Router neighboring devices Choose the best path to
the destination network
I. Data Collection
In the data collection stage, the EIGRP protocol collects
various data in two steps

Step 1: Step 2:
Topology Data Neighbor discovery
Collection
Topology Data Collection
1- Identifying networks
The protocol identifies the Direct Connected networks, exchanges this data with
other devices and receives the collected data from them

2-Metric Calculation
● Metric = [(K1 * Bandwidth + [(K2 * Bandwidth) / (256 – Load)] +
K3 * Delay) * K5/(K4 + Reliability)] * 256
With the default K-Values K1=1, K2=0, K3=1, K4=0, K5=0
● Metric = (Bandwidth + Delay) * 256

3 - These paths are recorded in the Topology Table


EIGRP Metric Calculation Example

• Bandwidth = (10^7 / Least bandwidth in kilobits per second)


• Delay = microseconds/10
• Metric = (Bandwidth + Delay) * 256
Bandwidth = (10,000,000 / 10,000) = 1,000
Delay = [4000 + 1000 + 5000] = 10000 [tens of microseconds]
Metric = (1000 + 10,000) * 256 = 2,816,000
Neighbor Discovery
Contents of the Hello message
• AS
• Hello Interval
• Hold Interval
• Security Options.
• The values of the K constants.

Conditions for creating a neighborly relationship


• Both devices must use the EIGRP protocol.
• Both devices must be in the same AS
• The IP address of both devices' ports must be in the same Subnet.
• In the case of using the security options, the type of encryption and the
password must be equal in both devices.
• The values of the constants K used in the equation for calculating the cost or
metric of the path (Metric) must be equal.
Monitoring the relationship with the neighborhood

After the neighbor discovery process, routers continue to exchange


hello messages for each given period called hello interval.
Hello Interval = 5 sec or 60 sec
The Hello Message is sent in a Multicast form using the IPv4 address :
224.0.0.10 Or the address of IPv6 : FF02::A

Hold Interval = 5 * 3 = 15 or 60 * 3 = 180


II. Data Collection
The “Router 1” device sends the data it collected about the
networks to the other device with which it has established a
relationship in the Update Messages

The data it sends to the other device:


• Networks he identified.
• The cost value or metric that he calculated for the path of each network.
Reliable Transport Protocol RTP
III. Best route selection
Best route
The best route to the specified destination is chosen through the topology table.
The route with the least feasible distance is chosen and placed in the routing
table.
Alternative path
One of the things that distinguishes the eigrp protocol is the presence of an
alternative path with the main path (successor). It is used when the best path is
lost. It is chosen by the route that has an AD less than the FD of the best route..
This means that we can have more than one route to the destination. It is
possible that we will not have any alternative path .. In this case there must be a
way to ensure that no loops occur in our network .. This method is represented
in the dual algorithm
THE DUAL
ALGORITHME
The DUAL algorithm

DUAL uses the Neighbor and Topology tables to calculate route information.

When a link fails, DUAL looks for a feasible successor in its Neighbor and
Topology tables.
It compares all routes advertised by neighbors by using a composite metric for
each route.
Lowest-cost paths are then inserted into the routing table.
DUAL EXAMPLE
DUAL EXAMPLE
DUAL EXAMPLE
DUAL EXAMPLE
DUAL EXAMPLE
Configuring and
Verifying Basic
EIGRP
Router>enable
Router#configure terminal
Router(config)#router eigrp 5
Router(config-router)#network 10.0.0.0 0.255.255.255
Router(config-router)#network 15.0.0.0 0.255.255.255
Router(config-router)#network 14.0.0.0 0.255.255.255
Router(config-router)#network 17.0.0.0 0.255.255.255
Router(config-router)#network 16.0.0.0 0.255.255.255
Router#show ip eigrp neighbors
IP-EIGRP neighbors for process 5
H Address Interface Hold Uptime SRTT RTO Q Seq
(sec) (ms) Cnt Num
0 14.0.0.2 Fa1/0 12 00:04:51 40 1000 0 28
1 16.0.0.2 Gig7/0 12 00:04:51 40 1000 0 25
2 17.0.0.2 Gig6/0 11 00:04:50 40 1000 0 27
3 15.0.0.2 Se2/0 10 00:04:44 40 1000 0 34
Router#show ip eigrp topology all-links
IP-EIGRP Topology Table for AS 5/ID(17.0.0.1)

Codes: P - Passive, A - Active, U - Update, Q - Query, R - Reply,


r - Reply status

P 10.0.0.0/8, 1 successors, FD is 28160


via Connected, FastEthernet0/0
P 11.0.0.0/8, 1 successors, FD is 28416
via 17.0.0.2 (28416/28160), GigabitEthernet6/0
P 12.0.0.0/8, 2 successors, FD is 30720
via 16.0.0.2 (30720/28160), GigabitEthernet7/0
via 14.0.0.2 (30720/28160), FastEthernet1/0
P 13.0.0.0/8, 1 successors, FD is 20514560
via 15.0.0.2 (20514560/28160), Serial2/0
P 14.0.0.0/8, 1 successors, FD is 28160
via Connected, FastEthernet1/0
P 15.0.0.0/8, 1 successors, FD is 20512000
via Connected, Serial2/0
P 16.0.0.0/8, 1 successors, FD is 5120
via Connected, GigabitEthernet7/0
P 17.0.0.0/8, 1 successors, FD is 2816
via Connected, GigabitEthernet6/0
P 18.0.0.0/8, 1 successors, FD is 20512256
via 17.0.0.2 (20512256/20512000), GigabitEthernet6/0
P 19.0.0.0/8, 1 successors, FD is 28416
via 17.0.0.2 (28416/28160), GigabitEthernet6/0
via 16.0.0.2 (30720/28160), GigabitEthernet7/0
Router#show ip route
Codes: C - connected, S - static, I - IGRP, R - RIP, M - mobile, B - BGP
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter area
N1 - OSPF NSSA external type 1, N2 - OSPF NSSA external type 2
E1 - OSPF external type 1, E2 - OSPF external type 2, E - EGP
i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, ia - IS-IS inter area
* - candidate default, U - per-user static route, o - ODR
P - periodic downloaded static route

Gateway of last resort is not set

C 10.0.0.0/8 is directly connected, FastEthernet0/0


D 11.0.0.0/8 [90/28416] via 17.0.0.2, 00:06:41, GigabitEthernet6/0
D 12.0.0.0/8 [90/30720] via 16.0.0.2, 00:06:41, GigabitEthernet7/0
[90/30720] via 14.0.0.2, 00:06:41, FastEthernet1/0
D 13.0.0.0/8 [90/20514560] via 15.0.0.2, 00:06:36, Serial2/0
C 14.0.0.0/8 is directly connected, FastEthernet1/0
C 15.0.0.0/8 is directly connected, Serial2/0
C 16.0.0.0/8 is directly connected, GigabitEthernet7/0
C 17.0.0.0/8 is directly connected, GigabitEthernet6/0
D 18.0.0.0/8 [90/20512256] via 17.0.0.2, 00:06:37, GigabitEthernet6/0
D 19.0.0.0/8 [90/28416] via 17.0.0.2, 00:06:41, GigabitEthernet6/0
THANKS!
Do you have any questions?
[email protected]
[email protected]
CREDITS: This presentation template was created
by Slidesgo, including icons by Flaticon,
infographics & images by Freepik and illustrations
by Stories

You might also like