Cisco - Deploying EIGRP, IGRP 307

Copyright © 1998, Cisco Systems, Inc. All rights reserved. Printed in USA.Presentation_ID.scr 1

1© 1999, Cisco Systems, Inc. 3070978_05F9_c2 1© 1999, Cisco Systems, Inc. 3070978_05F9_c2

2© 1999, Cisco Systems, Inc. 3070978_05F9_c2

Deployment ofDeployment ofIGRP/EIGRPIGRP/EIGRP

Session 307Session 307



Understanding EIGRPUnderstanding EIGRP

Understanding and deployingEIGRP is like driving a car


AgendaAgenda

• Fundamentals of EIGRP• DUAL• Summarization and Load Balancing• EIGRP/IGRP Interaction• Query Process• Deployment Guidelines with EIGRP• Summary



IGRP: Interior GatewayIGRP: Interior GatewayRouting ProtocolRouting Protocol

• Cisco proprietary

• Distance vector

• Broadcast based

• Utilizes link bandwidth and delay15 hops is no longer the limit

• 90 seconds updates (RIP is 30 sec.)

• Load balance over unequal cost paths


IGRP Metrics CalculationIGRP Metrics Calculation

• Metric = [K1 x BW + (K2 x BW) / (256 - Load) +K3 x Delay] x [K5 / (Reliability + K4)]

By Default: K1 = 1, K2 = 0, K3 = 1, K4 = K5 = 0

• Delay is sum of all the delays of the link alongthe paths

Delay = Delay/10

• Bandwidth is the lowest bandwidth of the linkalong the paths

Bandwidth = 10000000/Bandwidth



Problems with RIP and IGRPProblems with RIP and IGRP

• Slow convergence

• Not 100% loop free

• Don’t support VLSM anddiscontiguous network

• Periodic full routing updates

• RIP has hop count limitation


Advantages of EIGRPAdvantages of EIGRP

• Advanced distance vector

• 100% loop free

• Fast convergence

• Easy configuration

• Less network design constraints than OSPF

• Incremental update

• Supports VLSM and discontiguous network

• Classless routing

• Compatible with existing IGRP network

• Protocol independent (support IPX and appletalk)



Advantages of EIGRPAdvantages of EIGRP

• Uses multicast instead of broadcast• Utilize link bandwidth and delay

EIGRP Metric = IGRP Metric x 256(32 bit Vs. 24 bit)

• Unequal cost paths load balancing• More flexible than OSPF

Full support of distribute listManual summarization can be done in anyinterface at any router within network


EIGRP PacketsEIGRP Packets

• Hello: Establish neighbor relationships

• Update: Send routing updates

• Query: Ask neighbors aboutrouting information

• Reply: Response to query aboutrouting information

• Ack: Acknowledgement of a reliable packet



EIGRP Neighbor RelationshipEIGRP Neighbor Relationship

• Two routers become neighbors when theysee each other’s hello packet

Hello address = 224.0.0.10

• Hellos sent once every five seconds on thefollowing links:

Broadcast Media: Ethernet, Token Ring, fddi, etc.Point-to-point serial links: PPP, HDLC, point-to-point frame relay/ATM subinterfacesMultipoint circuits with bandwidth greater thanT1: ISDN PRI, SMDS, Frame Relay



• Hellos sent once every 60 seconds on thefollowing links:

Multipoint circuits with bandwidth less than T1:ISDN BRI, Frame Relay, SMDS, etc.

• Neighbor declared dead when no EIGRPpackets are received within hold interval

Not only Hello can reset the hold timer

• Hold time by default is three times thehello time




• EIGRP will form neighbors even thoughhello time and hold time don’t match

• EIGRP sources hello packets from primaryaddress of the interface

• EIGRP will not form neighbor if K-valuesare mismatched

• EIGRP will not form neighbor if ASnumbers are mismatched

• Passive interface (IGRP vs. EIGRP)


Discovering RoutesDiscovering Routes

I am Router A, Who Is on the Link?afadjfjorqpoeru39547439070713

11Hello

AA BB




Update

afadjfjorqpoeru39547439070713

Here Is My Routing Information (Unicast) 22


11Hello

AA BB



Thanks for the Information!Ack


33

Update




11Hello

AA BB



Topology Table

Topology Table

44




33

Update




11Hello

AA BB


Here Is My Route Information (Unicast)Update


55Topology

TableTopology

Table

44 Thanks for the Information!Ack


33

Update




11


Hello

AA BB



Converged

Thanks for the Information! Ack


66

Topology Table

Topology Table

44

AA BB

Here Is My Route Information (Unicast)Update


55



33

Update




11Hello



AgendaAgenda




EIGRP DUALEIGRP DUAL

• Diffusing update algorithm

• Finite-State-MachineTrack all routes advertised by neighbors

Select loop-free path using a successor andremember any feasible successors

If successor lost

Use feasible successor

If no feasible successor

Query neighbors and recompute new successor


EIGRP Feasible Distance (FD)EIGRP Feasible Distance (FD)

• Feasible distance is the minimumdistance (metric) along a path to adestination network



TopologyTable

DestinationDestination Feasible Distance (FD)Feasible Distance (FD) NeighborNeighbor

77

77

77

HH

BB

DD

100+20+10=130100+20+10=130

100+1+10+10=121100+1+10+10=121

100+100+20+10+10=240100+100+20+10+10=240

Feasible Distance ExampleFeasible Distance Example

Network 7

FDDI

(10)(20)

(1) GG

CC

FFEE

BB

HH

DD

AA

(100)

(10)(20)(100)

(100)

(100)


EIGRP Reported Distance (RD)EIGRP Reported Distance (RD)

• Reported distance is the distance(metric) towards a destination asadvertised by an upstream neighbor

Reported distance is the distancereported in the queries, the replies andthe updates



DestinationDestination Reported Distance (RD)Reported Distance (RD) NeighborNeighbor

77

77

77

20+10=3020+10=30

1+10+10=211+10+10=21

100+20+10+10=140100+20+10+10=140

HH

BB

DD

TopologyTable

Reported Distance ExampleReported Distance Example

FDDI

GG

CC

FFEE

BB

HH

DD

AA

Network 7(10)(20)

(1)(100)

(10)(20)(100)

(100)

(100)


EIGRP Feasibility Condition (FC)EIGRP Feasibility Condition (FC)

• A neighbor meets the feasibilitycondition (FC) if the reporteddistance by the neighbor is smallerthan the feasible distance (FD) ofthis router



EIGRP SuccessorEIGRP Successor

• A successor is a neighbor that has metthe feasibility condition and has theleast cost path towards the destination

• It is the next hop for forwarding packets

• Multiple successors are possible(load balancing)


EIGRP Feasible Successor (FS)EIGRP Feasible Successor (FS)

• A feasible successor is a neighborwhose reported distance (RD) is lessthan the feasible distance (FD)



12112177 BB

Router A’sRouting Table

Successor ExampleSuccessor Example

• B is current successor (FD = 121)• H is the feasible successor (30 < 121)

DestinationDestination NeighborNeighbor

77

77

77

HH

BB

DD

TopologyTable

FDFD RDRD

3030130130

121121

240240

2121

140140

FDDI

GG

CC

FFEE

BB

HH

DD

AA

(20)(100)

Network 7(10)(20)

(1)(100)

(10)

(100)

(100)


Passive, Active, and StuckPassive, Active, and Stuckin Active (SIA)in Active (SIA)

• Passive routes are routes that havesuccessor informationPassive route = Good

• Active routes are routes that have lost theirsuccessors and no feasible successors areavailable. The router is actively looking foralternative pathsActive route = Bad

• Stuck in Active means the neighbor still has notreplied to the original query within three minutesStuck in active = Ugly



Dual AlgorithmDual Algorithm

• Local computationWhen a route is no longer available viathe current successor, the router checksits topology tableRouter can switch from successor tofeasible successor without involvingother routers in the computationRouter stays passiveUpdates are sent


DUAL: Local ComputationDUAL: Local Computation

(1)

#2

#3

#4 #5

B C

FD E

#1

#6

GA

#7

(100)

(100) (20)

(10)

(10)

(10)

H#8

(20)

#7 121/21 B#7 130/30 H. . .. . .. . .

#7 121/21 B#7 130/30 H. . .. . .. . .

FDDIXX



Dual AlgorithmDual Algorithm

• Diffused ComputationWhen a route is no longer available via itscurrent successor and no feasible successor isavailable, queries are sent out to neighborsasking about the lost routeThe route is said to be in active stateNeighbors reply to the query if they haveinformation about the lost route. If not, queriesare sent out to all of their neighbors.The router sending out the query waits for all ofthe replies from its neighbors and will makerouting decision based on the replies


(1)

#2

#3

#4 #5

B C

FD E

#1

#6

GA

#7

(100)

(100) (20)

(10)

(10)

(10)

H#8

(20)

#7 121/21 B#7 130/30 H. . .. . .. . .

#7 121/21 B#7 130/30 H. . .. . .. . .

FDDIXX

DUAL: Diffused ComputationDUAL: Diffused Computation

XX



D EIGRP Topology(a) Cost (2) (fd)

via B Cost (2/1) (Successor)via C Cost (5/3)

D D EIGRP TopologyEIGRP Topology(a) (a) Cost (2)Cost (2) (fd) (fd)

via Bvia B Cost (2/1) (Successor)Cost (2/1) (Successor)via Cvia C Cost (5/3)Cost (5/3)

E EIGRP Topology (a) Cost (3) (fd)

via D Cost (3/2) (Successor)via C Cost (4/3)

E E EIGRP Topology EIGRP Topology (a) (a) Cost (3)Cost (3) (fd) (fd)

via Dvia D Cost (3/2) (Successor)Cost (3/2) (Successor)via Cvia C Cost (4/3)Cost (4/3)

C EIGRP Topology(a) Cost (3) (fd)

via B Cost (3/1) (Successor)via D Cost (4/2) (fs)via E Cost (4/3)

C EIGRP TopologyC EIGRP Topology(a) (a) Cost (3)Cost (3) (fd) (fd)

via Bvia B Cost (3/1) (Successor)Cost (3/1) (Successor)via Dvia D Cost (4/2) (fs)Cost (4/2) (fs)via Evia E Cost (4/3)Cost (4/3)

(1)

DUAL ExampleDUAL Example

XXX

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)


D EIGRP Topology(a) **ACTIVE** Cost (-1) (fd)

via E (q)via C Cost (5/3) (q)

D D EIGRP TopologyEIGRP Topology(a) (a) ****ACTIVEACTIVE**** Cost (-1) (Cost (-1) (fdfd))

via Evia E (q)(q)via Cvia C Cost (5/3) Cost (5/3) (q)(q)






via B Cost (3/1) (Successor)via Dvia E Cost (4/3)


via Bvia B Cost (3/1) (Successor)Cost (3/1) (Successor)via Dvia Dvia Evia E Cost (4/3)Cost (4/3)

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)


QQQQQQ




via E (q)via C Cost (5/3)

D D EIGRP TopologyEIGRP Topology(a) (a) ****ACTIVEACTIVE**** Cost (-1) (fd)Cost (-1) (fd)

via Evia E (q)(q)via Cvia C Cost (5/3)Cost (5/3)

E EIGRP Topology (a) **ACTIVE** Cost (-1) (fd)

via Dvia C Cost (4/3) (q)

E E EIGRP Topology EIGRP Topology (a) (a) ****ACTIVEACTIVE**** Cost (-1) (fd)Cost (-1) (fd)

via Dvia Dvia Cvia C Cost (4/3)Cost (4/3) (q)(q)


via B Cost (3/1) (Successor)via Dvia E


via Bvia B Cost (3/1) (Successor)Cost (3/1) (Successor)via Dvia Dvia Evia E


RRR

QQQ

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)



via E (q)via C Cost (5/3)

D D EIGRP TopologyEIGRP Topology(a) (a) ****ACTIVEACTIVE**** Cost (-1) (fd)Cost (-1) (fd)

via Evia E (q)(q)via Cvia C Cost (5/3)Cost (5/3)


via C Cost (4/3) (Successor)via D


via Cvia C Cost (4/3) (Successor)Cost (4/3) (Successor)via Dvia D






RRR

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)




via C Cost (5/3) (Successor) via E Cost (5/4) (Successor)


via Cvia C Cost (5/3) (Successor)Cost (5/3) (Successor) via Evia E Cost (5/4) (Successor)Cost (5/4) (Successor)










RRR

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)



via C Cost (5/3) (Successor) via E Cost (5/4) (Successor)


via Cvia C Cost (5/3) (Successor)Cost (5/3) (Successor) via Evia E Cost (5/4) (Successor)Cost (5/4) (Successor)










(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)



(1)

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)






via B Cost (2/1) (Successor)via C Cost (5/3)


via Bvia B Cost (2/1) (Successor)Cost (2/1) (Successor)via Cvia C Cost (5/3)Cost (5/3)


via B Cost (3/1) (Successor)via D Cost (4/2) (fs)via E Cost (4/3)

C C EIGRP TopologyEIGRP Topology(a) (a) Cost (3)Cost (3) (fd) (fd)

via Bvia B Cost (3/1) (Successor)Cost (3/1) (Successor)via Dvia D Cost (4/2) (fs)Cost (4/2) (fs)via Evia E Cost (4/3)Cost (4/3)

DUAL Example (Start)DUAL Example (Start)


(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

E EIGRP Topology(a) Cost (4) (fd)


E E EIGRP TopologyEIGRP Topology(a)(a) Cost (4)Cost (4) (fd) (fd)



via C Cost (5/3) (Successor)via E Cost (5/4) (Successor)


via Cvia C Cost (5/3) (Successor)Cost (5/3) (Successor)via Evia E Cost (5/4) (Successor)Cost (5/4) (Successor)



C C EIGRP TopologyEIGRP Topology(a) (a) Cost (3)Cost (3) (fd) (fd)


DUAL Example (End)DUAL Example (End)



EIGRP ReliableEIGRP ReliableTransport ProtocolTransport Protocol

• EIGRP reliable packets are packets thatrequires explicit acknowledgement:

Update

Query

Reply

• EIGRP unreliable packets are packets thatdo not require explicit acknowledgement:

Hello

Ack



• The router keeps a neighbor list and aretransmission list for every neighbor

• Each reliable packet (Update, Query,Reply) will be retransmitted when packetis not acked

• EIGRP transport has window size of one(stop and wait mechanism)

Every single reliable packet needs to beacknowledged before the next sequencedpacket can be sent




• With reliable multicast traffic, one mustwait to transmit the next reliable multicastpackets, until all peers haveacknowledged the previous multicast

• If one or more peers are slow inacknowledging, all other peers sufferfrom this

• Solution: The nonacknowledged multicastpacket will be retransmitted as a unicast tothe slow neighbor



• Per neighbor, retransmission limitis 16

• Neighbor relationship is reset whenretry limit (limit = 16) for reliablepackets is reached



AgendaAgenda



EIGRP SummarizationEIGRP Summarization

• Purpose: Smaller routing tables, smallerupdates, query boundary

• Auto summarization:On major network boundaries, networks aresummarized to the major networks

Auto summarization is turned on by default

150.150.X.X

150.150.X.X

151.151.X.X




• Manual summarizationConfigurable on per interface basis in anyrouter within network

When summarization is configured on an interface, therouter immediate creates a route pointing to null zerowith administrative distance of five

Loop prevention mechanism

When the last specific route of the summary goes away,the summary is deleted

The minimum metric of the specific routes is used asthe metric of the summary route


50.2.0.0/16

50.3.0.0/16

50.2.0.0/15

interface s0ip address 50.1.1.1 255.255.0.0ip summary-address eigrp 1 50.2.0.0 255.254.0.0

S0

AS 1


• Manual summarization command:ip summary-address eigrp <as number><address> <mask>



EIGRP Load BalancingEIGRP Load Balancing

• Routes with equal metric to theminimum metric, will be installed inthe routing table (Equal Cost LoadBalancing)

• There can be up to six entries in therouting table for the same destination(default = 4)

ip maximum-paths <1-6>


EIGRP UnequalEIGRP UnequalCost Load BalancingCost Load Balancing

• EIGRP offers unequal cost loadbalancing feature with the command:

Variance <multiplier>• Variance command will allow the router

to include routes with a metric smallerthan multiplier times the minimummetric route for that destination, wheremultiplier is the number specified bythe variance command



10

20

10

10

20

25

A

B

C

D

E

Variance 2

Variance ExampleVariance Example

• Router E will choose router C to get tonet X FD=20

• With variance of 2, router E will also chooserouter B to get to net X

• Router D will not be used to get to net X

Net X


AgendaAgenda




EIGRP and IGRP InteractionEIGRP and IGRP Interaction

• Administrative distance vs. routing metricsAdministrative distance is used to compare withroutes coming from two different routing protocols

Connected = 0Static route = 1EIGRP summary route = 5EBGP = 20Internal EIGRP = 90IGRP = 100OSPF = 110RIP = 120External EIGRP = 170IBGP = 200



• Metric is used to compareroutes coming from thesame routing protocol

RIP = Hop count

EIGRP/IGRP = Bandwidth and delay

OSPF = Link cost




• External vs. Internal EIGRPExternal EIGRP:

Any routes being redistributed into an EIGRPprocess from another routing protocol or EIGRPprocess is considered as external EIGRP routesAdministrative distance = 170

Internal EIGRP:Any routes that originated from its own EIGRPprocess is considered as internal EIGRP routesAdministrative distance = 90



• To make EIGRP compatible withexisting IGRP network with minimuminterruption, EIGRP and IGRP withthe same process number will beautomatically redistributed intoeach other




• Rules for IGRP/EIGRP interaction to avoidrouting loops:

Internal EIGRP routes preferred overIGRP routes

Administrative distance considered(90 vs. 100)

External EIGRP routes preferred over IGRProutes on same AS number and same scaledroute metric

Administrative distance not considered


EIGRP 1EIGRP 1IGRP 2IGRP 2External EIGRP

Net X

External EIGRPNet X

EIGRP/IGRP ExampleEIGRP/IGRP Example

• Network X is external EIGRP route

• Router A forwards external EIGRP routesto router B and D

A

B

D

CExternal

Net X

FR

FR

External EIGRP

Net XExternal E

IGRP

Net X




Net X

External EIGRPNet X A

B

D

CExternal

Net X

FR

FR

External EIGRP

Net XExternal E

IGRP

Net X

EIGRP/IGRP ExampleEIGRP/IGRP Example(Different AS)(Different AS)

• Router B and D sends IGRP route to router C• Router C sends IGRP network X route back to Router B and D• Router B and D will choose IGRP route because of lower

Administrative distanceResult: Router B and D will take the wrong route to Net X

IGRP Net XIGRP Net X

IGRP Net X

IGRP Net X



Net X

External EIGRPNet X A

B

D

CExternal

Net X

FR

FR

External EIGRP

Net XExternal E

IGRP

Net X

IGRP Net XIGRP Net X

IGRP Net X

IGRP Net X

EIGRP/IGRP ExampleEIGRP/IGRP Example(Same AS)(Same AS)

• Router B and D will not take administrative distance asdecision process if EIGRP and IGRP has the same AS

• Router B and D still favors external EIGRP routes fromrouter A

Result: Router B and D will take correct route to Net X



AgendaAgenda



Have You Seen My Sparky?

EIGRP Query ProcessEIGRP Query Process

• EIGRP is AdvancedDistant Vector. It relies onits neighbor to providerouting information

• If a route is lost and nofeasible successor isavailable, EIGRP needs toconverge fast, its onlymechanism for fastconvergence is to activelyquery for the lost route toits neighbors




• Queries are sent out when a route is lostand no feasible successor is available

• The lost route is now in active state

• Queries are sent out to all of its neighborson all interfaces except the interface tothe successor

• If the neighbor does not have the lostroute information, queries are sent out totheir neighbors



• The router will have to get ALL of thereplies from the neighbors before the routercalculates the successor information

• If any neighbor fails to reply the query inthree minutes, this route is stuck in activeand the router reset the neighbor that failsto reply

• Solution is to limit query range to becovered later in presentation



A

AS 1AS 2

C

Network X

Query for XQuery for XReply for XReply for XQuery for XQuery for X

EIGRP Query RangeEIGRP Query Range

• Autonomous System BoundariesContrary to popular belief, queries are notbounded by AS boundaries. Queries from AS 1will be propagated to AS 2

B

XX


A CB 130.130.1.0/24

B Summarizes 130.0.0.0/8 to A

130.x.x.x

Reply with Infinity and theQuery Stops Here!

Query for130.130.1.0/24

EIGRP Query RangeEIGRP Query Range

• Summarization pointAuto or manual summarization is the best wayto bound queries

Requires a good address allocation scheme

XX129.x.x.x

Query for130.130.1.0/24



EIGRP Bandwidth UtilizationEIGRP Bandwidth Utilization

• EIGRP by default will use up to 50%of the link bandwidth forEIGRP packets

• This parameter is manuallyconfigurable by using the command:

ip bandwidth-percent eigrp<AS-number> <nnn>

• Use for greater EIGRP load control


Bandwidth over WAN InterfacesBandwidth over WAN Interfaces

• Bandwidth utilization over point-to-point subinterface Frame Relay

Treats bandwidth as T1 by default

Best practice is to manually configurebandwidth as the CIR of the PVC




• Bandwidth over multipoint Frame Relay,ATM, SMDS, and ISDN PRI:

EIGRP uses the bandwidth on the maininterface divided by the number of neighborson that interface to get the bandwidthinformation per neighbor



• Each PVC might have different CIR, thismight create EIGRP packet pacing problem

Multipoint interfaces:Convert to point-to-pointBandwidth configured = (lowest CIR x numberof PVC)

ISDN PRI:Use Dialer Profile (treat as point-to-point link)



AgendaAgenda



Factors That InfluenceFactors That InfluenceEIGRP ScalabilityEIGRP Scalability

• Keep in mind that EIGRP is not plugand play for large networks

• Limit EIGRP query range!

• Quantity of routing informationexchanged between peers



10.1.8.0/24

RTRB

RTRA

RTRC

RTRD

RTRE

Distribution Layer Remote Sites

Limiting Updates/Queries—Limiting Updates/Queries—ExampleExample


Limiting Size/Scope ofLimiting Size/Scope ofUpdates/QueriesUpdates/Queries

• Evaluate routing requirementsWhat routes are needed where?

• Once needs are determinedUse summary address

Use distribute lists



10.1.8.0/24

RTRB

RTRA

RTRC

RTRD

RTRE


XQueriesQueriesRepliesReplies

Limiting Updates/Queries— ExampleLimiting Updates/Queries— Example


Limiting Updates/Queries—SummaryLimiting Updates/Queries—Summary

• Remote routers fully involvedin convergence

Most remotes are never intendedto be transit

Convergence complicated throughlack of information hiding



10.1.8.0/24

RTRB

RTRA

RTRC

RTRD

RTRE


XQueriesQueriesRepliesReplies

IP summary-address eigrp 1 10.0.0.0 255.0.0.0on all outbound interfaces to remotes

Limiting Updates/Queries—BetterLimiting Updates/Queries—Better


Limiting Updates/Queries— SummaryLimiting Updates/Queries— Summary

• Convergence simplified by addingthe summary-address statements

• Remote routers just replywhen queried



Hierarchy/AddressingHierarchy/Addressing

• Permits maximum information hiding

• Advertise major net or default routeto regions or remotes

• Provides adequate redundancy


EIGRP ScalabilityEIGRP Scalability

• EIGRP is a very scalable routingprotocol if proper design methodsare used:

Good allocation of address spaceEach region should have an uniqueaddress space so route summarizationis possible

Have a tiered network design model(Core, Distribution, Access)



EIGRP ScalabilityEIGRP Scalability

• Proper network resourcesSufficient memory on the router

Sufficient bandwidth on WAN interfaces

• Proper configuration of the “bandwidth”statement over WAN interfaces, especiallyover Frame Relay

• Avoid blind mutual redistribution betweentwo routing protocols or twoEIGRP processes


DistributionLayer

Access Layer

Summarized RoutesSummarized Routes

Summarized RoutesSummarized RoutesSummarized RoutesSummarized Routes

Summarized RoutesSummarized Routes

Summarized RoutesSummarized Routes Summarized RoutesSummarized Routes

Tiered Network DesignTiered Network Design

OtherRegions

OtherRegions

OtherRegions

OtherRegions

Core



Core

TokenRing

TokenRing

3.3.4.01.1.1.0

3.3.4.0

1.1.4.0

3.3.3.0

2.2.1.0

1.1.3.0

3.3.1.0

1.1.2.0 2.2.3.0

2.2.2.0

TokenRing

TokenRing

TokenRing

TokenRing

1.1.1.01.1.2.02.2.3.03.3.4.0

2.2.1.03.3.2.03.3.3.01.1.4.0

3.3.1.02.2.2.01.1.3.0

NonscalableNonscalable Network Network

• Bad addressing schemeSubnets are everywhere throughout entire network

• Queries not bounded


Core

3.0.0.0

2.0.0.0

TokenRing

TokenRing

1.1.4.01.1.1.0

3.3.4.0

3.3.4.0

3.3.3.0

3.3.1.0

2.2.3.0

2.2.1.0

1.1.2.0 1.1.3.0

2.2.2.0

1.0.0.0

TokenRing

TokenRing

TokenRing

TokenRing

Scalable NetworkScalable Network

• Readdress networkEach region has its own block of address

• Queries bounded by using “ip summary-address eigrp” command



SummarySummary

• Query rangeBest way to limit query is through route summarization

• EIGRP is not plug and play for large networksIt’s a very scalable protocol with little design requirement

• Optimizing EIGRP networkLimiting query range

Route summarization

Tiered network design

Sufficient network resources


Please Complete YourPlease Complete YourEvaluation FormEvaluation Form

Session 307Session 307




Date post:	08-Dec-2016
Category:	Documents
Upload:	truongduong
View:	224 times
Download:	5 times

Cisco - Deploying EIGRP, IGRP 307

Documents