EIGRP

• What is EIGRP?
– Enhanced Interior Gateway Routing Protocol
– It is a hybrid routing protocol
• It takes some good features from distance vector routing
• It takes some good features from link state routing
– What does it take from link state?
• It takes the information of the neighbors.
• OSPF has hello concept. So every few seconds it sends hello
message to make sure the neighbor is still alive.
– What does it take from distance vector?
• EIGPR does not learn entire topology like OSPF
• It is just like RIP, routes by gossip.

07/22/2021 Networks and Communications 1

 EIGRP
• Little history of protocols
– 1980s
• RIPv1(Routing Information Protocol) [Distance Vector]
• IGRP (Interior Gateway Routing Protocol) [Distance Vector]
• OSPFv2 (Open Shortest Path First) [Link State]
– 1990s
• EIGRP (Enhanced Interior Gateway Routing Protocol)
• RIPv2
– 2000s
• OSPFv3
• RIPng
• EIGRPv6

07/22/2021 Networks and Communications 2

 EIGRP
• EIGRP
– It was a CISCO proprietary until 2013.
– Now EIGRP is open standard.

OSPF choose this

R1
based on cost count

RIP choose this

15
based on hope count
s
bp

4
4K
K

bp
64

EIGRP choose this

s based on load
R2 R3
1544 Kbps

07/22/2021 Networks and Communications 3

 EIGRP
• How does EIGRP works?
– From Neighbors
• Create neighbor using hello message
• Like OSPF it sent hello message in every 10 sec
– Topology Exchange
• LSA update
• LSDB Exchange
• Update by RTP (Reliable transport protocols)
• It send the update when it start and when it changes
something. (partial update)
– Build Routing Table
• Create table based on the metric value

07/22/2021 Networks and Communications 4

 EIGRP
• In hello message has some parameters. Both devices should
have
– same Authentication
– Same Autonomous System (AS)
– Same source id. (Coming from same subnet)
– K values matched

• Default values, k1=k3=1 and k2=k4=k5=0

R1 R2

10.1.1.0/24

07/22/2021 Networks and Communications 5

 EIGRP

07/22/2021 Networks and Communications 6

 EIGRP
• Feasible Distance (FD)  by using metric formula
• Reported Distance (RD)
• Successors
• Feasible Successor
R2
BW
bps :
Del 100,0
0k
0 0,0 0 ay:
100 00 kbp
0
W : 1, 10 µs µs s
B ay:
l
De R5

10.1.1.0/24
R1 R3

BW: 10,000 kbps BW: 1,000,000 kbps

BW: 100,000 kbps
Delay: 1,000 µs Delay: 10 µs
Delay: 100 µs
s
kbp
R4 ,
0
00
BW 0 0
De : 154 : 1,0 0 µs
lay
: 20 4 kbp BW ay: 1
l
,00 s De
0µ
s
07/22/2021 Networks and Communications 7
 EIGRP
• Feasible Distance  by using metric formula
• Reported Distance  FD of previous router
• Successors
• Feasible Successor
R2 RD = 2,816
RD = 28,416
FD = 28,416
FD = 28,672
BW: 100,000 kbps
BW: 1,000,000 kbps Delay: 100 µs
Delay: 10 µs
R5

10.1.1.0/24
R1 RD = 281,856 R3 RD = 2,816
FD = 284,416 FD = 281,856 FD = 2,816
BW: 10,000 kbps BW: 1,000,000 kbps
BW: 100,000 kbps
Delay: 1,000 µs Delay: 10 µs
Delay: 100 µs
BW RD = 2,816
De : 1
lay 54 R4 FD = 3,072
:2 4k BW: 1,000,000 kbps
0, bp
00 s Delay: 10 µs
0µ RD = 3,072
s FD =2,170,368
07/22/2021 Networks and Communications 8
 EIGRP
• Feasible Distance (FD)  by using metric formula
• Reported Distance (RD)  FD of previous router
• Successors  Based on the least feasible distance
• Feasible Successor
R2 RD = 2,816
RD = 28,416
FD = 28,416
FD = 28,672
BW: 100,000 kbps
BW: 1,000,000 kbps Delay: 100 µs
Delay: 10 µs
R5

10.1.1.0/24
R1 RD = 281,856 R3 RD = 2,816
FD = 284,416 FD = 281,856 FD = 2,816
BW: 10,000 kbps BW: 1,000,000 kbps
BW: 100,000 kbps
Delay: 1,000 µs Delay: 10 µs
Delay: 100 µs
BW RD = 2,816
De : 154 R4 FD = 3,072
lay
: 20 4 kbp BW: 1,000,000 kbps
,00 s Delay: 10 µs
0µ
s RD = 3,072
FD =2,170,368
07/22/2021 Networks and Communications 9
 EIGRP
• Feasible Successor
– if successor link fails, need immediate back up.
– Rule is reported distance should be less than the feasible
distance of successor. It switch immediately.
R2 RD = 2,816
RD = 28,416
FD = 28,416
FD = 28,672
BW: 100,000 kbps
BW: 1,000,000 kbps Delay: 100 µs
Delay: 10 µs
R5

10.1.1.0/24
R1 RD = 281,856 R3 RD = 2,816
FD = 284,416 FD = 281,856 FD = 2,816
BW: 10,000 kbps BW: 1,000,000 kbps
BW: 100,000 kbps
Delay: 1,000 µs Delay: 10 µs
B Delay: 100 µs
De W: 1 RD = 2,816
lay 54
:2 4k R4 FD = 3,072
0, bp BW: 1,000,000 kbps
00 s FS
0µ Delay: 10 µs
s
RD = 3,072
FD =2,170,368
07/22/2021 Networks and Communications 10
 EIGRP
• Feasible Successor
– if both successor and Feasible successor link fails, it run
DUAL algorithm.
– It sent request based on the route information.
R2 RD = 2,816
RD = 28,416
FD = 28,416
FD = 28,672
BW: 100,000 kbps
BW: 1,000,000 kbps Delay: 100 µs
Delay: 10 µs
R5

10.1.1.0/24
R1 RD = 281,856 R3 RD = 2,816
FD = 284,416 FD = 281,856 FD = 2,816
BW: 10,000 kbps BW: 1,000,000 kbps
BW: 100,000 kbps
BW Delay: 1,000 µs Delay: 10 µs
Delay: 100 µs
De : 15
lay 44 RD = 2,816
: 2 kb R4 FD = 3,072
0,0 ps
00 BW: 1,000,000 kbps
µs
Delay: 10 µs
RD = 3,072
FD =2,170,368
07/22/2021 Networks and Communications 11
 EIGRP
• Router eigrp <#>
• #
– same autonomous system number
– Number should match to form neighborship
• With wild card mask without wild card mask
• sh ip eigrp int --- tells interfaces information
• sh ip route --- tells routing path
• sh ip eigrp ne – tells about neighbors
• sh ip eigrp topology -- – tells about entire topology
• sh running-config
• sh ip protocols

07/22/2021 Networks and Communications 12

 Congestion Control
• Congestion: It may occur if the load on the network is greater
than the capacity of the network. It occurs due to queues in
router and switch.
• Congestion Control: Try to avoid traffic congestion.
Data Rate

Maximum burst size : Max. length of time the traffic is generated at peak rate.
Peak data rate: Max. data rate of traffic

Average data rate: Amount of data / Time

Seconds

Effective bandwidth: it is the bandwidth that network needs to allocate for traffic flow

07/22/2021 Networks and Communications 13

 Congestion Control
• Congestion:
– Load > Capacity
– No. of packet sent to network > No. of packet network
handle

Sender Queue Receiver Queue

07/22/2021 Networks and Communications 14

 Leaky Bucket

07/22/2021 Networks and Communications 15

 Leaky Bucket
• Traffic shaping : It is the mechanism to control the amount and
the rate of the traffic sent to the network.
• Leaky Bucket: this algorithm shapes bursty traffic into fixed-
rate traffic by averaging the data rate.
Full Burst flow of water
? Processor
Arrival v
Discard Leaky
bucket
algorithm

Discard drops of water

12 Mbps
2 Mbps
Hole
Leaky Bucket
0 2 0
7 10 10

3 Mbps for10 sec

Fixed flow of water
12 Mbps for 2 sec 2 Mbps for 3 sec
07/22/2021 Leaky L Networks and Communications 16
 Token Bucket

07/22/2021 Networks and Communications 17

 Token Bucket
• It allows bursty traffic at a regulated maximum rate

Add token per tick Remove one token and discard

for each packet transmitted

Full Processor
?

Queue

5Mbps
Constant flow of data
10Mbps

07/22/2021 Networks and Communications 18