Clase 14. EIGRP

Download as pdf or txt
Download as pdf or txt
You are on page 1of 70

REDES DE DATOS I

Class 14. EIGRP


Alberto Arellano A. Ing. Msc.
[email protected]
CCNA – CCNP – CCSP-JNCIA
Overview of EIGRP

› Enhanced IGRP is a Cisco-proprietary routing protocol released in 1992.


– EIGRP was created as a classless version of IGRP.
› EIGRP acts like a link-state routing protocol, but it’s still a distance vector
routing protocol.
› In 2013, Cisco released a basic functionality of EIGRP as an open standard to
the IETF as an informational RFC.
› Open-EIGRP: RFC 7868 (05/2016).
Main Components of Routing Protocol

Data Structures EIGRP creates and EIGRP creates and


maintains the: maintains the:
• Routing protocols create and • Neighbor table • Neighbor table
maintain tables (databases) in RAM • Topology table • Topology table
for its operations. • Submits best path(s) • Submits best path(s)
to the Routing table to the Routing table

Routing Protocol Messages

• Routing protocols use messages to


EIGRP Update
learn and maintain accurate EIGRP Query
information about the network. EIGRP Reply
• Specifically, messages are used to EIGRP Acknowledge
discover neighboring routers, EIGRP Hello
exchange routing information, and
other tasks.

Algorithm

• Routing protocols use algorithms to I will use the EIGRP I will use the EIGRP
determine the best path to various DUAL algorithm to DUAL algorithm to
destinations. identify what the best identify what the best
routes are. routes are.
EIGRP Features

 Advanced distance vector (DUAL)  Flexible network design


 Rapid convergence (<=3 seconds)  Multicast and unicast instead of broadcast
 100% loop-free classless routing address
 Easy configuration  Support for VLSM and discontiguous subnets
 Incremental updates  Manual summarization at any point in the
internetwork
 Load balancing across equal-
and unequal-cost pathways  Support for multiple network layer protocols
EIGRP Key Components

› Protocol-dependent modules (PDMs)


› Reliable Transport Protocol (RTP)
› Neighbor discovery / Recovery
› DUAL finite-state machine
Protocol-Dependent Modules
› EIGRP maintains a individual
tables for each routed
protocol.
› EIGRP uses protocol-
dependent modules (PDMs)
to provide support for IPv4,
IPv6 and legacy protocols
IPX and AppleTalk.
› Each PDM is responsible for
all functions related to its
specific routed protocol.
RELIABLE TRANSPORT PROTOCOL

› Reliable Transport Protocol (RTP) is the


EIGRP Transport layer protocol used for
the delivery and reception of EIGRP
packets.
– However, not all RTP packets are sent
reliably.
Reliable Transport Protocol
› Reliable packets require explicit acknowledgement from
destination
– Update, Query, Reply
– Reliable packets are sequenced, require an acknowledgement,
and are retransmitted up to 16 times if not acknowledged
› Unreliable packets do not require acknowledgement from
destination
– Hello, ACK
› RTP can send EIGRP packets as unicast or multicast.
– IPv4 EIGRP multicast address 224.0.0.10.
– IPv6 EIGRP multicast address FF02::A.
EIGRP Authentication

› EIGRP can authenticate the routing update source.


– Ensures router only accepts routing updates from legitimate peers.
› Note:
– Authentication does not encrypt the EIGRP routing updates.
EIGRP Packet

Frame Payload

Frame Header CRC


IP Protocol Number EIGRP EIGRP
Header (EIGRP = 88) Header Message

On a LAN, the EIGRP


The EIGRP header The EIGRP
packet is encapsulated
The destination IP address identifies the message
in an Ethernet frame
is set to the multicast type of EIGRP consists of
with a destination
224.0.0.10 and the EIGRP packet and the Type /
multicast MAC
protocol field is 88. autonomous Length /
address:
system number. Value (TLV).
01-00-5E-00-00-0A
EIGRP Packet Types
› EIGRP uses these 5 packet types to maintain its various tables and
establish complex relationships with neighbor routers:

Packet Type Description

Hello Used to discover other EIGRP routers in the network.

Used to acknowledge the receipt of any EIGRP


Acknowledgement
packet.

Update Convey routing information to known destinations.

Used to get specific information from a neighbor


Query
router.

Reply Used to respond to a query.


EIGRP Header
EIGRP PACKET TYPE
EIGRP Hello Packets

 Hello packets are used to discover & form adjacencies with neighbors.
 Multicasted to:
 IPv4: 224.0.0.10
 IPv6: FF02::A
 Hello packets are always sent unreliably. Therefore Hello packets do not require
acknowledgment.
Hello Packets

› Hello packets are sent on a regular interval. Router assumes that as long as it
is receiving Hello packets from a neighbor, the neighbor and its routes remain
viable.
› The interval depends on the interface’s bandwidth.
– Low Bandwidth = 60 seconds
› Default interval on multipoint nonbroadcast multiaccess networks (NBMA)
such as X.25, Frame Relay, and ATM interfaces with access links of T1
(1.544 Mbps) or slower.
– High bandwidth = 5 seconds
› Default interval on circuits with bandwidth greater than T1 such as
Ethernet LANs.
Hello Holdtime

› Hold time - maximum time the router should wait to receive the
next hello before declaring that neighbor as unreachable.
› Default hold time - 3 times the hello interval
› If the hold time expires:
– EIGRP declares the route as down
– DUAL searches for a new path in the topology table or by
sending out queries.
Hello Format
Update and Acknowledgement Packets

EIGRP uses
triggered
updates

› Update Packets
– Contains only the routing information needed (a change occurs)
– Sent only to those routers that require it.
– Uses reliable delivery.
› Acknowledgment (ACK) Packets
– Sent when reliable delivery is used (update, query, and reply packets).
– Unreliable unicast.
Query and Reply Packets

Why Query? Another


router could be
attached to the same
LAN.

› Used by DUAL when searching for networks and other tasks.


› Queries and replies use reliable delivery.
› Queries can use multicast or unicast, whereas Replies are always sent
as unicast.
EIGRP Message

• The EIGRP packet header


identifies the type of EIGRP
message.
• The TLV
(Type/Length/Value) field
contains EIGRP parameters,
IP internal and external
routes.
EIGRP Message - TLVs
TLV 0x0001 - EIGRP Parameters

• K values are used to calculate the EIGRP metric.


• The Hold Time advertised by a neighbor is the maximum time
a router should wait for any valid EIGRP message sent by that
neighbor before declaring it dead.
TLV 0x0002 - Internal IP Routes

• Delay: Sum of delays in units of 10 microseconds from


source to destination. A delay of 0xFFFFFFFF, or 256,
indicates an unreachable route.
• Bandwidth: Lowest configured bandwidth on any
interface along the route.
• Prefix length: Specifies the number of network bits in the
subnet mask.
• Destination: The destination address of the route.
› Hop Count – is a number between 0x01 and 0xFF indicating
the number of hops to the destination. A router will advertise a
directly connected network with a hop count of 0.
› Reserved – is an unused field and is always 0x0000
TLV 0x0003 - External IP Routes

• External Protocol ID – specifies the protocol from which


the external route was learned. 0x01 = IGRP, 0x02 = EIGRP,
0x03 = Static Route, 0x04 = RIP, 0x05 = Hello, 0x06 = OSPF,
0x07 = IS-IS, 0x08 = EGP, 0x09 = BGP, 0x0A = IDRP, 0x0B =
Connected Link.
• Flags – currently constitute just two flags. If the right-most
bit of the eight-bit field is set (0x01), the route is an
external route. If the second bit is set (0x02), the route is a
candidate default route.
• Originating Router – is the IP address or router ID of the
router that redistributed the external route into the EIGRP
autonomous system.
• Originating Autonomous System Number – is the
autonomous system number of the router originating the
route.
Neighbor Discovery and Topology
Exchange
DUAL Algorithm

J. J. Garcia-Luna-Aceves

› Diffusing Update Algorithm (DUAL) is the convergence algorithm used by EIGRP.


› First proposed by E. W. Dijkstra and C. S. Scholten.
› The most prominent work with DUAL has been done by J. J. Garcia-Luna-Aceves.
› Distance vector routing protocols such as RIP prevent routing loops with hold-
down timers and split horizon.
› Although EIGRP uses both of these techniques, it uses them somewhat differently;
the primary way that EIGRP prevents routing loops is with the DUAL algorithm.
EIGRP Operations
› EIGRP selects primary (successor) and backup (feasible successor)
routes and injects those into the topology table.
› The primary (successor) routes are then moved to the routing table.

IP EIGRP Neighbor Table List of directly connected adjacent EIGRP


Neighbor IP Address Local router exit neighbor routers and the local interface to exit
interface to neighbor to reach it.

IP EIGRP Topology Table List of all routes learned from each EIGRP
Destination 1 FD / AD via each neighbor neighbor and identifies successor routes and
feasible successor routes.

IP Routing Table List of the best (successor) routes from the EIGRP
Destination 1 Best route topology table and other routing processes.
Example: EIGRP Tables
Router C’s tables:
EIGRP Administrative Distance (AD)
› EIGRP default administrative distances

Routes manually
summarized.

Routes
redistributed into
EIGRP.
Feasible Distance & Advertised Distance
In the Example , R3 will advertise to R2 its metric towards the destination.

Basically R3 is saying to R2: “It costs me 5 to get there”. This is called


the advertised distance. R2 has a topology table and in this topology
table it will save this metric, the advertised distance to reach this
destination is 5.

The advertised distance is also called the reported distance.


Feasible Distance & Advertised Distance
R2 is sending its feasible distance towards R1 which is 15. R1 will save this
information in the topology table as the advertised distance. R2 is “telling”
R1 the distance is 15.

• Advertised distance: How far the destination is away for your neighbor.
• Feasible distance: The total distance to the destination.
The best path to the destination is called the successor!

The successor will be copied from the topology table to the routing table. With EIGRP
however it’s possible to have a backup path which we call the feasible successor.
Feasible Distance & Advertised Distance

R4 R5

• Which path is the successor (the best path)?


• Do we have any feasible successors? (backup paths)
Feasible Distance & Advertised Distance
Router Advertised Distance Feasible Distance
R1 10 15
R2 5 10
R3 9 109

The path with the lowest feasible distance will be the successor (R2) so now we
answered the first question.

Router Advertised Distance Feasible Distance


R1 10 15
R2 5 10 SUCCESSOR
R3 9 109
Feasible Distance & Advertised Distance

Advertised distance of feasible successor < Feasible distance of


successor.

Router Advertised Feasible


Distance Distance
R1 10 15
R2 5 10 Successor
R3 9 109 Feasible Successor
EIGRP Network Topology

R1#show running-config
<Output omitted>
!
interface GigabitEthernet0/0
ip address 192.168.1.1 255.255.255.0
!
interface Serial0/0/0
ip address 192.168.10.6 255.255.255.252
clock rate 64000
!
interface Serial0/0/1
ip address 192.168.10.10 255.255.255.252

R1#show running-config
<Output omitted>
! R2#show running-config
<Output omitted>
interface GigabitEthernet0/0 !
ip address 172.16.1.1 255.255.255.0 interface GigabitEthernet0/0
! ip address 172.16.2.1 255.255.255.0
interface Serial0/0/0 !
ip address 172.16.3.1 255.255.255.252 interface Serial0/0/0
clock rate 64000 ip address 172.16.3.2 255.255.255.252
! !
interface Serial0/0/1 interface Serial0/0/1
ip address 192.168.10.5 255.255.255.252 ip address 192.168.10.9 255.255.255.252
clock rate 64000
!
interface Serial0/1/0
ip address 209.165.200.225 255.255.255.224
router eigrp
Command

R1# conf t
Enter configuration commands, one per line. End with CNTL/Z.
R1(config)# router ?
bgp Border Gateway Protocol (BGP)
eigrp Enhanced Interior Gateway Routing Protocol (EIGRP)
isis ISO IS-IS
iso-igrp IGRP for OSI networks
mobile Mobile routes
odr On Demand stub Routes
ospf Open Shortest Path First (OSPF)
ospfv3 OSPFv3
rip Routing Information Protocol (RIP)

R1(config)#router eigrp 1
R1(config-router)#
Process ID

Router(config)# router eigrp autonomous-system

Router(config)# router eigrp 1 Must be same on all routers in EIGRP


routing domain

› Both EIGRP and OSPF use a process ID to represent an instance of their


respective routing protocol running on the router.
› EIGRP refers to “autonomous-system” number
– Actually, functions as a process ID.
– 1 and 65,535
EIGRP Router ID

The EIGRP router ID is used to uniquely identify each router in the EIGRP routing
domain.

Criteria for deriving the router ID:


1. Configured router ID:
 Configured with eigrp router-id router-id command
2. Highest Loopback IPv4 address:
3. Highest active interface IPv4 address:
EIGRP Router ID

RID: 2.2.2.2

RID: 1.1.1.1
RID: 3.3.3.3

R1(config)# router eigrp 1


R1(config-router)# eigrp router-id 1.1.1.1
R1(config-router)#
R3(config)# router eigrp 1
R3(config-router)# eigrp router-id 3.3.3.3
R3(config-router)#

R2(config)# router eigrp 1


R2(config-router)# eigrp router-id 2.2.2.2
R2(config-router)#
network Command

Router(config-router)# network network-address

R2(config-router)# network 192.168.10.0


› The network command in EIGRP has the same function as in other IGP routing
protocols:
› What does it do?
– Any interface on this router that matches the network address in the network
command will be enabled to send and receive EIGRP updates.
– This network (or subnet) will be included in EIGRP routing updates.
network Command

All interfaces
belonging to Including the wildcard
the classful mask would only
172.16.0.0/16 advertise that subnet.
address are
enabled for For example, to
EIGRP configure only the
subnet 192.168.10.8 /30
R1(config)# router eigrp 1
R1(config-router)# network 192.168.10.0
on the S0/0/1 interface.
R1(config-router)# network 172.16.0.0
R1(config-router)#
R2(config)# router eigrp 1
R2(config-router)# network 172.16.0.0
R2(config-router)#
*Feb 28 17:51:42.543: %DUAL-5-NBRCHANGE: EIGRP-IPv4
1: Neighbor 172.16.3.1 (Serial0/0/0) is up: new
adjacency
R2(config-router)#
network Command

Alternatively, we could of also used either:


• network 192.168.10.8 0.0.0.3
• network 192.168.10.9 0.0.0.0
R2(config)# router eigrp 1
R2(config-router)# network 192.168.10.8 255.255.255.252
R2(config-router)# end
R2#
R2# show running-config | section eigrp 1
router eigrp 1
network 172.16.0.0
network 192.168.10.8 0.0.0.3 Notice how the EIGRP converts the
eigrp router-id 2.2.2.2
entry into a wildcard mask.
R2#
Check Adjacencies
Use the show ip eigrp neighbors command to view the neighbor table and verify
that EIGRP has established an adjacency with its neighbors.
 The output displays a list of each adjacent neighbor.
 The command is very useful for troubleshooting EIGRP, followed by ping and show ip
interface brief.

Amount of time since this neighbor


was added to the neighbor table.
R1# show ip eigrp neighbors
EIGRP-IPv4 Neighbors for AS(1)
H Address Interface Hold Uptime SRTT RTO Q Seq
(sec) (ms) Cnt Num
1 192.168.10.6 Se0/0/1 11 04:57:14 27 162 0 8
0 172.16.3.2 Se0/0/0 13 07:53:46 20 120 0 10
R1#

The local
Neighbor’s interface Seconds remaining
IPv4 receiving before declaring
address EIGRP Hello neighbor down.
packets. Reset to hold time
when Hello is
received.
R1# show ip protocols
*** IP Routing is NSF aware ***

Routing Protocol is "eigrp 1"


Outgoing update filter list for all interfaces is not set
Incoming update filter list for all interfaces is not set
Default networks flagged in outgoing updates
Default networks accepted from incoming updates
EIGRP-IPv4 Protocol for AS(1) 1 Routing protocol and Process ID (AS Number)
Metric weight K1=1, K2=0, K3=1, K4=0, K5=0 2 K values used in composite metric
NSF-aware route hold timer is 240
Router-ID: 1.1.1.1 3 EIGRP Router ID
Topology : 0 (base)
Active Timer: 3 min
Distance: internal 90 external 170 4 EIGRP Administrative Distances
Maximum path: 4
Maximum hopcount 100
Maximum metric variance 1

Automatic Summarization: disabled


Maximum path: 4
Routing for Networks:
172.16.0.0
192.168.10.0 5
Interfaces enabled for this EIGRP for IPv6
Routing Information Sources:
Gateway Distance Last Update
192.168.10.6 90 00:40:20
172.16.3.2 90 00:40:20
Distance: internal 90 external 170

R1#
Check the R1 Routing
Table

R1# show ip route | begin Gateway

Gateway of last resort is not set

172.16.0.0/16 is variably subnetted, 5 subnets, 3 masks


C 172.16.1.0/24 is directly connected, GigabitEthernet0/0
L 172.16.1.1/32 is directly connected, GigabitEthernet0/0
D 172.16.2.0/24 [90/2170112] via 172.16.3.2, 00:14:35, Serial0/0/0
C 172.16.3.0/30 is directly connected, Serial0/0/0
L 172.16.3.1/32 is directly connected, Serial0/0/0
D 192.168.1.0/24 [90/2170112] via 192.168.10.6, 00:13:57, Serial0/0/1
192.168.10.0/24 is variably subnetted, 3 subnets, 2 masks
C 192.168.10.4/30 is directly connected, Serial0/0/1
L 192.168.10.5/32 is directly connected, Serial0/0/1
D 192.168.10.8/30 [90/2681856] via 192.168.10.6, 00:50:42, Serial0/0/1
[90/2681856] via 172.16.3.2, 00:50:42, Serial0/0/0
R1#
Composite
Metric and
the K
Values

› EIGRP uses the following values in its composite metric to calculate the preferred path to a
network:
– Bandwidth: The lowest bandwidth between source and destination.
– Delay: The cumulative interface delay along the path
– Reliability: Worst reliability between source and destination, based on keepalives.
– Load: Worst load on a link between source and destination, based on the packet rate and the
configured bandwidth of the interface.
› Note: Although MTU is included in the routing table updates, it is not a routing metric used by
EIGRP
EIGRP Metrics

› By default:
– K1 and K3 are set to 1,
– K2, K4, and K5 are set to 0.
› The result is that only the bandwidth and delay values are used in the computation of
the default composite metric.
Examining the Metric Values
R1# show interface serial 0/0/0
Serial0/0/0 is up, line protocol is up
Hardware is GT96K Serial
Description: Link to R2
Internet address is 172.16.3.1/30
MTU 1500 bytes, BW 1544 Kbit, DLY 20000 usec,
reliability 255/255, txload 1/255, rxload 1/255
<output omitted>

› show interface command, lets you can examine the actual values
used for bandwidth, delay, reliability, and load in the computation of the
routing metric.
› Default values:
– bandwidth
– delay
Bandwidth
R1# show interface serial 0/0/0
<output omitted>
MTU 1500 bytes, BW 1544 Kbit, DLY 20000 usec,
reliability 255/255, txload 1/255, rxload 1/255
<output omitted>

› The bandwidth metric (1544 Kbps) is a static value used by some routing
protocols such as EIGRP and OSPF to calculate their routing metric.
– Kilobits per second (Kbps).
› The value of the bandwidth might or might not reflect the actual physical
bandwidth of the interface.
– Modifying the bandwidth value does not change the actual bandwidth of
the link.
– Should reflect actual bandwidth of the link.
Delay
R1# show interface serial 0/0/0
<output omitted>
MTU 1500 bytes, BW 1544 Kbit, DLY 20000 usec,
reliability 255/255, txload 1/255, rxload 1/255
<output omitted>

› Delay is a measure of the time it takes for a packet to traverse a route.


– Based on the type of link, or interface
– Expressed in microseconds (millionths of a second).
– The router does not actually track how long packets are taking to reach the
destination.
– Like the bandwidth value, delay is a default value that can be changed by the
network administrator.
Delay
R1# show interface serial 0/0/0
<output omitted>
MTU 1500 bytes, BW 1544 Kbit, DLY 20000 usec,
reliability 255/255, txload 1/255, rxload 1/255
<output omitted>

Delay
Media
In usec
› 100 microseconds for Fast Ethernet Gigabit Ethernet 10
interfaces. Fast Ethernet 100

› Default value is 20,000 FDDI 100


microseconds for serial interfaces 16M Token Ring 630

Ethernet 1,000

T1 (Serial Default) 20,000

DS0 (64 Kbps) 20,000

1024 Kbps 20,000

56 Kbps 20,000
Reliability – Optional Metric
R1# show interface serial 0/0/0
<output omitted>
MTU 1500 bytes, BW 1544 Kbit, DLY 20000 usec,
reliability 255/255, txload 1/255, rxload 1/255
<output omitted>

› Reliability is a measure of the probability that the link will fail or how
often the link has experienced errors.
– Value between 0 and 255,
› 1 = a minimally reliable link
› 255 = 100 % reliable.
– By default EIGRP does not use reliability in its metric calculation.
Load – Optional Metric
R1# show interface serial 0/0/0
<output omitted>
MTU 1500 bytes, BW 1544 Kbit, DLY 20000 usec,
reliability 255/255, txload 1/255, rxload 1/255
<output omitted>

› Load reflects the amount of traffic using the link.


– Value between 0 and 255.
– A lower load value is more desirable because it indicates less load on the
link.
› 1/255 would be a minimally loaded link.
› 40/255 is a link at 16 percent capacity
› 255/255 is a link that is 100 percent saturated
› By default EIGRP does not use load in its metric calculation.
Using the bandwidth
Command
Configure the bandwidth commands for R1, R2
and R3.

R1(config)# inter s 0/0/0


R1(config-if)# bandwidth 64

R2(config)# inter s 0/0/0


R2(config-if)# bandwidth 64

R2(config)# inter s 0/0/1


R2(config-if)# bandwidth 1024

R3(config)# inter s 0/0/1


R3(config-if)# bandwidth 1024
Example Metric
Calculation

R2  192.168.1.0/24

 Using the default values for K1 and K3, you can simplify this calculation
to: 7
slowest bandwidth
+ cumulative sum of all the delays
------------------------------------------------
EIGRP route metric
Example Metric Calculation

BW = 9,765
Example Metric Calculation

Delay = 2,001
Example Metric Calculation
EIGRP Load Balancing
› Routes with a metric equal to the minimum metric are installed in the
routing table.
– Referred to as “equal-cost load balancing”.
– All IP routing protocols on routers can perform equal-cost load
balancing.
› The maximum-paths maximum-path command can be used to allow
up to 16 equal-cost paths.
– Default is 4.
– Setting the maximum-path option to 1 disables load balancing.
EIGRP Equal-Cost Load Balancing

Advertised Distance (AD)

R1(config)# router eigrp 100 R1 Topology Table


R1(config-router)# network 172.16.1.0 0.0.0.255
R1(config-router)# network 192.168.1.0 Network Neighbor AD FD
R1(config-router)# network 192.168.2.0 172.16.2.0/24 R2 20 40
R1(config-router)# network 192.168.3.0
R1(config-router)# network 192.168.4.0 R3 20 40
R1(config-router)# maximum–paths 3 R4 20 40
R1(config-router)#
R5 20 60
Unequal Cost Load Balancing
› EIGRP can also balance traffic across multiple routes that have
different metrics. Referred to as unequal-cost load balancing.
› The degree to which EIGRP performs load balancing is controlled
with the variance multiplier command.
– The multiplier is a value, between 1 and 128, used for load
balancing.
– The default is 1, which means equal-cost load balancing.
– Setting a variance value greater than 1 allows EIGRP to install
multiple routes without loops with an unequal cost in the routing
table, as long as these routes meet the feasible condition.
To qualify as a feasible successor, a router must have an AD less
than the FD of the current successor route

– EIGRP will always install successors (the best routes) in the


routing table.
› The variance allows feasible successors (and only feasible
successor routes) as candidate routes to potentially be
installed in the routing table.
EIGRP Unequal-Cost Load Balancing

The routers above are all running EIGRP. C1 is connected to C2, C3


and C4 using links of 50, 30 and 10 Mbps.
EIGRP Unequal-Cost Load Balancing
EIGRP Unequal-Cost Load Balancing

It is noted the different values for the feasible distance and advertised distance.
The lowest feasible distance is 51968 and it’s the path through R2 which makes
it the successor.
EIGRP Unequal-Cost Load Balancing
EIGRP Unequal-Cost Load Balancing
C3 and C4 have been selected as feasible successors because their advertised
distance of 51712 is lower than the feasible distance (51968) of C2.

If we want to enable load balancing we have to use the following formula:

FD of feasible successor < FD of successor * multiplier

Let’s say we want to load balance over C3:

• Feasible Distance of R2 (successor) = 51968


• Feasible Distance of R3 (feasible successor) =86016

Variance = 86016 / 51968 = 1,65


Variance = 2
C1(config)#router eigrp 10
C1(config-router)#variance 2
EIGRP Unequal-Cost Load Balancing
EIGRP Unequal-Cost Load Balancing
EIGRP Unequal-Cost Load Balancing
Let’s say we want to load balance over C3 and C4:

• Feasible Distance of C2 (successor) = 51968


• Feasible Distance of C4 (feasible successor) =256768

Variance = 256768 / 51968 = 4,94


Variance = 5

C1(config)#router eigrp 10
C1(config-router)#variance 5
EIGRP Unequal-Cost Load Balancing

You might also like