Agenda
IGRP
EIGRP
Page 43 - 1
Institute of Computer Technology - Vienna University of Technology
IGRP Background
IGRP at a glance
Page 43 - 2
Institute of Computer Technology - Vienna University of Technology
Bandwidth
unit:
bits/sec
default values for LANs
corresponding to real bandwidth
default values for serial lines
corresponding to bandwidth of 1.544Mbps (T1 line)
configuration of the real bandwidth on serial lines is a must!!!
cisco interface command: bandwidth <number in kbit/s>
minimum bandwidth along a path is taken
BWIGRP is expressed by (1/bandwidth)*1017
BWEIGRP is expressed by (1/bandwidth)*1017*256
Page 43 - 3
Institute of Computer Technology - Vienna University of Technology
Page 43 - 4
Institute of Computer Technology - Vienna University of Technology
Reliability
arbitrary number
255 means 100%
1 means 0%
worstreliability between source and destination
dynamically measured
keepalives are sent off the interface every 10 seconds, frame has
CRC
samples are calculated over 5 minutes
time interval needs reconfiguration, when Reliability is
used
Loading
arbitrary number
Load is given as a fraction of 255. A load of 255 indicates a
completely saturated link
dynamically measured
calculated over 5 minutes
time interval needs reconfiguration, when Loading is used
Page 43 - 5
Institute of Computer Technology - Vienna University of Technology
k 2 ∗ min BWIGRP
metric1 = k1 ∗ min BWIGRP + + k 3 ∗ sumDelay IGRP
256 - load
If k5 doesn´
doesn´t equal 0, an additional operation is done
k5
compositem etric = metric1 ∗
reliabilit y + k 4
Prefered Path!!!
Metric=BW+delay=78125+2000=
Metric=BW+delay=78125+2000=80125
80125
128kbps
128kbps 64kbps
Metric=min.BW
Metric=min.BW along the path+sum of delays =156250+2000+2000=160250
=156250+2000+2000=160250
Page 43 - 6
Institute of Computer Technology - Vienna University of Technology
Metric=BW+delay=78125+2000=
Metric=BW+delay=78125+2000=80125
80125
128kbps
1,544Mbps 1,544Mbps
Pr !!!
efe a th
re P
dP d
ath ere
ef
!!! Pr
Metric=min.BW
Metric=min.BW along the path+sum of delays =6476+2000+2000=10476
=6476+2000+2000=10476
Page 43 - 7
Institute of Computer Technology - Vienna University of Technology
Metric=BW+delay=78125+2000=
Metric=BW+delay=78125+2000=80125
80125
IP IP
IP
IP IP
IP 128kbps IP
IP
IP
128kbps 64kbps
Metric=min.BW
Metric=min.BW along the path+sum of delays =156250+2000+2000=160250
=156250+2000+2000=160250
IGRP Metric
Page 43 - 8
Institute of Computer Technology - Vienna University of Technology
Page 43 - 9
Institute of Computer Technology - Vienna University of Technology
OSI stack
IGRP
9 IP protocol number 9 (decimal)
IP
Physical layer
Page 43 - 10
Institute of Computer Technology - Vienna University of Technology
Agenda
IGRP
EIGRP
EIGRP Background
Page 43 - 11
Institute of Computer Technology - Vienna University of Technology
EIGRP at a glance
EIGRP at a glance
Page 43 - 12
Institute of Computer Technology - Vienna University of Technology
EIGRP Concepts
EIGRP Concepts
Point-
Point-to-
to-Point:
Point: Neighbor relationship is formed
with the router on the other end
Hello time interval: 5 sec
Broadcast multiaccess:
multiaccess: Neighbor relationships
are formed dynamically using multicast hellos
Hello time interval: 5 sec
Multicast address: 224.0.0.10
F/R
Nonbroadcast multiaccess:
multiaccess: Neighbor relationships X.25
are formed by manual configuration ATM
Hello time interval: 60sec
Dest. Address: Unicast address of the
neighbor
© 2005, D.I. Manfred Lindner IGRP-EIGRP, v3.5 26
Page 43 - 13
Institute of Computer Technology - Vienna University of Technology
EIGRP Concepts
R2 R8
Hello Hello Hello
Hello N
e
t
w
Hello
R3 R5 R6 o
Hello Hello Hello Hello r
R1
Hello k
Hello Hello
X
Token
R4 R7 Ring
Hello Hello Hello
FDDI
Hello
EIGRP Concepts
Page 43 - 14
Institute of Computer Technology - Vienna University of Technology
EIGRP Concepts
Update packets
In contrast to OSPF every EIGRP router is modifying any
received update packet. It adds its own local distance to
the information and sends the packet with an own
sequence number to its neighbors.
EIGRP Concepts
R2 NetY ad:20 R8
Ack. Update 16 Ack. N
e
10 NetY t
ad:40 w
NetY ad:20 NetY ad:120 Update
R3 Update R5 Update R6 NetY ad:220 o
NetY ad:10 Ack. Update r
R1 Update 100 100 k
10
Ack. Ack.
X
Token 6
R4 NetY ad:20 1 R7
10
Ack. Update
Ring
New network Y FDDI
Ack. Update
NetY ad:21
Update propagation
ad = advertised distance
Page 43 - 15
Institute of Computer Technology - Vienna University of Technology
EIGRP Concepts
Topology Table
Stores routing information that neighbors exchange after
the first Hello exchange (=> smaller compared to an
OSPF topology table). DUAL acts on the Topology table
to determine Successors and FSs.
Successor:
{ A neighbor that has been selected as the next hop for a destination,
it ends up in the Routing Table
Feasible Successor (FS):
{ A neighbor that has satisfied the Feasibility Condition and has a path
to the destination (is an alternate route to the current successor)
Feasibility Condition (FC):
{ A condition that is met when the lowest of all the neighbors' costs
plus the link cost to that neighbor is found, and the neighbor's
advertised cost is less than the current successor's cost.
© 2005, D.I. Manfred Lindner IGRP-EIGRP, v3.5 31
X
Token 6
R4 1 R7
Net X ad:17
Ring
FDDI
Part of R1´
R1´s Topology Table
Network Advertised Distance Feasible Distance Neighbor
Successor X 17 27 R4
X 216 226 R3
Feasible Successor X 26 36 R2
© 2005, D.I. Manfred Lindner ad = advertised distance
IGRP-EIGRP, v3.5 32
Page 43 - 16
Institute of Computer Technology - Vienna University of Technology
X
Token 6
R4 1 R7
Net X ad:17
Ring
FDDI
Part of R1´
R1´s Topology Table
Successor X 17 27 R4
X 216 226 R3
no Feasible
Successor!!! X 36 46 R2
© 2005, D.I. Manfred Lindner ad = advertised distance
IGRP-EIGRP, v3.5 33
Page 43 - 17
Institute of Computer Technology - Vienna University of Technology
Active state
A router's state for a destination when it has lost its successor to
that destination and has no other feasible successor (FS)
available. The router is forced to compute a route to the
destination.
It´s sending a query packet to all its neighbors.
Query packet (will be acknowledged from the receiver)
{ Sent to all neighbors when a router goes into Active for a destination
and is asking for information on that destination. Unless it receives
replies back from all its neighbors, the router will remain in Active
state and not start the computation for a new successor.
Reply packet (will be acknowledged from the receiver)
{ Sent by every EIGRP neighbor which receives a query. If the
neighbor doesn't have the information, it queries its neighbors
indicating that it is also performing route recomputation
Ack 17 Token 6
R4 1 R7 Ring
10 FDDI
Part of R1´
R1´s Topology Table
Network Advertised Distance Feasible Distance Neighbor
Successor X 17 27 R4
X 216 226 R3
no Feasible
Successor!!! X 36 46 R2
© 2005, D.I. Manfred Lindner IGRP-EIGRP, v3.5 36
Page 43 - 18
Institute of Computer Technology - Vienna University of Technology
Part of R1´
R1´s Topology Table
X 216 226 R3
Successor X 36 46 R2
© 2005, D.I. Manfred Lindner IGRP-EIGRP, v3.5 37
EIGRP Compatibility
Route tagging
EIGRP has the notion of internal and external routes.
Internal routes
are ones that have been originated within an EIGRP autonomous
system (AS).
External routes
are ones that have been learned by another routing protocol or
reside in the routing table as static routes.
Route redistribution
in the case of IGRP is done automatically, when EIGRP
and IGRP are belonging to the same Autonomous
System (compatible metric!!!). IGRP derived routes are
treated as external routes in EIGRP (also OSPF, RIP,
EGP, BGP...)
© 2005, D.I. Manfred Lindner IGRP-EIGRP, v3.5 38
Page 43 - 19
Institute of Computer Technology - Vienna University of Technology
EIGRP Compatibility
automatic redistribution
IGRP
EIGRP AS100
AS100
manual redistribution
IGRP
EIGRP AS 397
AS100
manual redistribution
all other IP
EIGRP routing
AS100 protocols
OSI stack
EIGRP
88 IP protocol number 88 (decimal)
IP
Physical layer
Page 43 - 20