eigrp for managed services technology deployment

8/3/2019 EIGRP for Managed Services Technology Deployment

1/88

1 2004 Cisco Systems, Inc. All rights reserved.

Session Number

Presentation_ID 111

EIGRP FOR MANAGED SERVICESTECHNOLOGY DEPLOYMENTSANGITA PANDYA

INTERNET TECHNOLOGIES DIVISION

DECEMBER 2004


2/88

222 2004 Cisco Systems, Inc. All rights reserved.Presentation_ID

Agenda

INTRODUCTION

Fundamentals of EIGRP

DUAL

Summarization and Load Balancing

Query Process

Deployment Guidelines with EIGRP

Summary



3/88


VPN for Many Managed Services

Service ProviderConverged Network

MANAGEDIPT

MANAGEDIPT

MANAGEDRouting

MANAGEDExtranet

MANAGEDInternet Gateway

MANAGED SecurityMANAGED Security

MANAGEDCPE

MANAGEDCPE

V i r t u a l P r i v a t e N e t w o r k

Customer

Branch

Customer

Branch

VMVM

VPN B

VMVM

Customer HQCustomer HQ

Service LevelAgreement for

MANAGED Services


4/88


Managed Routing Revenue Opportunity

Over 50% of Cisco Enterprise Customers Deploy IPRouting with EIGRP

IP/MPLS VPN Backbone

EIGRP AS-1

PE-1PE-1

CE-1CE-1

EIGRP AS-1

PE-2PE-2

PE-3PE-3

CE-2CE-2


5/88


CiscoExclusiveRobust EIGRP Support

BENEFITS:Service Provider: Simplest point of entry into enterprises existing architecture

Enterprise: Least disruption to current network design

VPN A/Site 1

VPN C/Site 2

VPN A/Site 2

VPN B/Site 2

VPN C/Site 1

CEA1

CEB3

CEA3

CEA2

CE1B1

PE1

PE2

PE3

P1

P2

P3

16.1/16

12.1/1612.1/16

16.2/16

16.2/16RIPv2

Static

OSPF

RIPv2

BGP

OSPF

RIPv2

BGP

12.2/1612.2/16

CEB2

Cisco IOSSupports the Industrys Most Comprehensive andRobust Routing Protocol Support: RIP, OSPF, BGP, ISIS,

Including EIGRP


6/88


Managed EIGRP

Benefits for SPs and Enterprises:

Impose little requirements or no restrictions oncustomer networks

CE and C routers are NOT required to run newer code

(CE/C upgrades recommended for full SoO functionality)

Customer sites may be same or differentautonomous systems

Customer sites may consist of several connections to the

MPLS VPN backbone

Customer sites may consist of one or more connections notpart of the MPLS VPN backbone (backdoor links)

666


7/88777 2004 Cisco Systems, Inc. All rights reserved.Presentation_ID

Introducing EIGRP

EIGRP is architected by Cisco systems to overcomeshort comings of other protocols such as RIP, IGRPand OSPF

It is widely deployed in Enterprise networks MPLS VPN Service Providers also enable EIGRP

on their PE routers to support the connectingnetworks which may already be running EIGRP

EIGRP can also be used as CE-PE routing protocolfor MPLS VPN connectivity



IGRP: Interior GatewayRouting Protocol

Cisco proprietary

Distance vector

Broadcast based

Utilizes link bandwidth and delay

15 hops is no longer the limit

90 seconds updates (RIP is 30 sec.)

Load balance over unequal cost paths



IGRP/EIGRP 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 link alongthe paths

Bandwidth = 10000000/Bandwidth



Problems with RIP and IGRP

Slow convergence

Not 100% loop free

Dont support VLSM and discontiguous network

Periodic full routing updates

RIP has hop count limitation



Advantages 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)

Connects MPLS VPN subscribers to their provides

seamlessly



Advantages 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 list

Manual summarization can be done in anyinterface at any router within network



EIGRP Packets

Hello: Establish neighbor relationships

Update: Send routing updates

Query: Ask neighbors about routing information

Reply: Response to query about routing information

Ack: Acknowledgement of a reliable packet



EIGRP Neighbor Relationship

Two routers become neighbors when they see eachothers hello packet

Hello address = 224.0.0.10

Hellos sent once every five seconds onthe following links:

Broadcast Media: Ethernet, Token Ring, FDDI, etc.

Point-to-point serial links: PPP, HDLC, point-to-point frame relay/ATM subinterfaces

Multipoint circuits with bandwidth greater than T1:ISDN PRI, SMDS, Frame Relay




Hellos sent once every 60 seconds on thefollowing links:

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

Neighbor declared dead when no EIGRP packets arereceived within hold interval

Not only Hello can reset the hold timer

Hold time by default is three times the hello time




EIGRP will form neighbors even though hello timeand hold time dont match

EIGRP sources hello packets from primary address

of the interface EIGRP will not form neighbor if K-values are

mismatched

EIGRP will not form neighbor if AS numbers are

mismatched

Passive interface (IGRP vs. EIGRP)



Discovering Routes

I am Router A, Who Is on the Link?

afadjfjorqpoeru39547439070713

Hello11

AA BB



Discovering Routes

Update

afadjfjorqpoeru

39547439070713

Here Is My Routing Information (Unicast)



Hello11

22

AA BB



Discovering Routes

Thanks for the Information!Ack


Update

afadjfjorqpoeru

39547439070713




Hello

33

22

11

AA BB


20/88


TopologyTable

TopologyTable

Discovering Routes



Update

afadjfjorqpoeru

39547439070713




Hello

44 33

22

11

AA BB


21/88


Here Is My Route Information (Unicast)Update

afadjfjorqpoeru

39547439070713



Update

afadjfjorqpoeru

39547439070713




Discovering Routes

Hello

AA BB

TopologyTable

TopologyTable

44

55

33

11

22


22/88


Converged


afadjfjorqpoeru

39547439070713

Discovering Routes

66

TopologyTable

TopologyTable

44

Here Is My Route Information (Unicast)Update

afadjfjorqpoeru

39547439070713



Update

afadjfjorqpoeru

39547439070713




Hello

55

33

11

22

AA BB


23/88


Agenda


DUAL


Query Process


Summary

232323


24/88


EIGRP DUAL

Diffusing update algorithm

Finite-State-Machine

Track all routes advertised by neighbors

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

If successor lost

Use feasible successorIf no feasible successor

Query neighbors and recompute new successor


25/88


EIGRP Feasible Distance (FD)

Feasible distance is the minimum distance (metric)along a path to a destination network


26/88


TopologyTable

DestinationDestination Feasible Distance (FD)Feasible Distance (FD)

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 Example

Network 7

FDDI

(10)(20)

(1) GG

CC

FFEE

BB

HH

DD

AA

(100)

(10)

(20)(100)

(100)

(100)

NeighborNeighbor


27/88


EIGRP Reported Distance (RD)

Reported distance is the distance (metric)towards a destination as advertised by anupstream neighbor

Reported distance is the distance reported in thequeries, the replies and the updates


28/88


Topology

Table

Reported Distance Example

FDDI

GG

CC

FFEE

Network 7

(10)(20)

(1)(100)

(10)

(20)(100)

(100)

(100)

BB

HH

DD

AA

DestinationDestination Reported Distance (RD)Reported Distance (RD)

77

77

77

HH

BB

DD

20+10=3020+10=30

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

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

NeighborNeighbor


29/88


EIGRP Feasibility Condition (FC)

A neighbor meets the feasibility condition (FC) if thereported distance by the neighbor is smaller than thefeasible distance (FD) of this router


30/88


EIGRP Successor

A successor is a neighbor that has met thefeasibility condition and has the least cost pathtowards the destination

It is the next hop for forwarding packets

Multiple successors are possible (load balancing)


31/88


EIGRP Feasible Successor (FS)

A feasible successor is a neighbor whose reporteddistance (RD) is less than the feasible distance (FD)


32/88


12112177 BB

Router AsRouting Table

Successor 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)

S


33/88


Passive, Active, and Stuckin Active (SIA)

Passive routes are routes that havesuccessor information

Passive route = Good

Active routes are routes that have lost theirsuccessors and no feasible successors areavailable; the router is actively looking foralternative paths

Active route = Bad Stuck in Active means the neighbor still has not

replied to the original query within three minutes

Stuck in active = Ugly


34/88


Dual Algorithm

Local computation

When a route is no longer available via the currentsuccessor, the router checks its topology table

Router can switch from successor to feasiblesuccessor without involving other routers in thecomputation

Router stays passive

Updates are sent


35/88


DUAL: Local Computation

(1)

#2

#3

#4 #5

B C

FD E

#1

#6

G

A

#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


36/88


Dual Algorithm

Diffused Computation

When a route is no longer available via its currentsuccessor and no feasible successor is available,queries are sent out to neighbors asking about thelost route

The route is said to be in active state

Neighbors reply to the query if they have

informationabout the lost route; if not, queries are sent out toall 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


37/88


#7 121/21 B

#7 130/30 H

. . .

. . .

. . .

#7 121/21 B

#7 130/30 H

. . .

. . .

. . .

(1)

#2

#3

#4 #5

B C

FD E

#1

#6

G

A

#7

(100)

(100) (20)

(10)

(10)

(10)

H

#8

(20)

FDDIXX

DUAL: Diffused Computation

XX


38/88


D EIGRP Topology

(a) Cost (2) (fd)

via B Cost (2/1) (Successor)

via C Cost (5/3)

D EIGRP Topology

(a) Cost (2) (fd)


via C Cost (5/3)

E EIGRP Topology

(a) Cost (3) (fd)

via D Cost (3/2) (Successor)

via C Cost (4/3)

E EIGRP Topology

(a) Cost (3) (fd)


via C Cost (4/3)

C EIGRP Topology

(a) Cost (3) (fd)


via D Cost (4/2) (fs)

via E Cost (4/3)

C EIGRP Topology

(a) Cost (3) (fd)



via E Cost (4/3)

(1)

DUAL Example

XX

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)


39/88


(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

DUAL Example

QQ

D EIGRP Topology

(a) **ACTIVE** Cost (-1) (fd)

via E (q)

via C Cost (5/3) (q)

D EIGRP Topology


via E (q)


E EIGRP Topology

(a) Cost (3) (fd)


via C Cost (4/3)

E EIGRP Topology

(a) Cost (3) (fd)


via C Cost (4/3)

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E Cost (4/3)

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E Cost (4/3)


40/88


DUAL Example

RR

Q

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

D EIGRP Topology


via E (q)

via C Cost (5/3)

D EIGRP Topology


via E (q)

via C Cost (5/3)

E EIGRP Topology


via D


E EIGRP Topology


via D


C EIGRP Topology

(a) Cost (3) (fd)


via D

via E

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E


41/88


DUAL Example

RR

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

D EIGRP Topology


via E (q)

via C Cost (5/3)

D EIGRP Topology


via E (q)

via C Cost (5/3)

E EIGRP Topology

(a) Cost (4) (fd)

via C Cost (4/3) (Successor)

via D

E EIGRP Topology

(a) Cost (4) (fd)


via D

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E


42/88


DUAL Example

RR

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

D EIGRP Topology

(a) Cost (5) (fd)


via E Cost (5/4) (Successor)

D EIGRP Topology

(a) Cost (5) (fd)



E EIGRP Topology

(a) Cost (4) (fd)


via D

E EIGRP Topology

(a) Cost (4) (fd)


via D

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E


43/88


DUAL Example

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

D EIGRP Topology

(a) Cost (5) (fd)



D EIGRP Topology

(a) Cost (5) (fd)



E EIGRP Topology

(a) Cost (4) (fd)


via D

E EIGRP Topology

(a) Cost (4) (fd)


via D

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E


44/88


(1)

(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

DUAL Example (Start)

D EIGRP Topology

(a) Cost (2) (fd)


via C Cost (5/3)

D EIGRP Topology

(a) Cost (2) (fd)


via C Cost (5/3)

E EIGRP Topology

(a) Cost (3) (fd)


via C Cost (4/3)

E EIGRP Topology

(a) Cost (3) (fd)


via C Cost (4/3)

C EIGRP Topology

(a) Cost (3) (fd)



via E Cost (4/3)

C EIGRP Topology

(a) Cost (3) (fd)



via E Cost (4/3)


45/88


(1)

(1)

(1)

(2)(2)

A

D

EC

B

(a)

DUAL Example (End)

D EIGRP Topology

(a) Cost (5) (fd)



D EIGRP Topology

(a) Cost (5) (fd)



E EIGRP Topology

(a) Cost (4) (fd)


via D

E EIGRP Topology

(a) Cost (4) (fd)


via D

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E

C EIGRP Topology

(a) Cost (3) (fd)


via D

via E


46/88


EIGRP Reliable Transport Protocol

EIGRP reliable packets are packets that requiresexplicit acknowledgement:

Update

QueryReply

EIGRP unreliable packets are packets that do notrequire explicit acknowledgement:

Hello

Ack


47/88



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

Each reliable packet (Update, Query, Reply) will beretransmitted when packet is not acked

EIGRP transport has window size of one (stop andwait mechanism)

Every single reliable packet needs to be

acknowledged before the next sequenced packetcan be sent


48/88



With reliable multicast traffic, one must wait totransmit the next reliable multicast packets, untilall peers have acknowledged the previous multicast

If one or more peers are slow in acknowledging,all other peers suffer from this

Solution: The nonacknowledged multicastpacket will be retransmitted as a unicast to theslow neighbor


49/88



Per neighbor, retransmission limit is 16

Neighbor relationship is reset when retry limit(limit = 16) for reliable packets is reached


50/88


Agenda


DUAL

SUMMARIZATION AND LOAD BALANCING

Query Process


Summary


51/88


EIGRP Summarization

Purpose: Smaller routing tables, smaller updates,query boundary

Auto summarization:

On major network boundaries, networks aresummarized to the major networks

Auto summarization is turned on by default

192.168.1.x

192.168.1.0

192.168.2.x


52/88


EIGRP Summarization

Manual summarization

Configurable on per interface basis in anyrouter within network

When summarization is configured on aninterface, the router immediate creates a routepointing to null zero with administrative distanceof five

Loop prevention mechanismWhen the last specific route of the summary goesaway, the summary is deleted

The minimum metric of the specific routes is used

as the metric of the summary route


53/88


192.168.9.X

192.168.10.X

192.168.8.0/22

interface s0ip address 192.168.11.1 255.255.255.252

ip summary-address EIGRP 1 192.168.8.0 255.255.252.0

S0

AS 1

EIGRP Summarization

Manual summarization command:

ip summary-address EIGRP

192.168.8.X


54/88


EIGRP Load Balancing

Routes with equal metric to the minimum metric, willbe installed in the routing table (Equal Cost LoadBalancing)

There can be up to six entries in the routing table forthe same destination (default = 4)

ip maximum-paths


55/88


EIGRP Unequal Cost Load Balancing

EIGRP offers unequal cost load balancing featurewith the command:

Variance

Variance command will allow the router to includeroutes with a metric smaller than multiplier times theminimum metric route for that destination, wheremultiplier is the number specified by the variancecommand


56/88


10

20

10

10

20

25

A

B

C

D

E

Variance 2

Variance Example

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

With variance of 2, router E will also choose router Bto get to net X

Router D will not be used to get to net X

Net X


57/88


Agenda


DUAL


QUERY PROCESS


Summary

575757


58/88


Have You Seen My Sparky?

EIGRP Query Process

EIGRP is AdvancedDistant Vectorit relieson its neighbor toprovide routinginformation

If a route is lost and nofeasible successor isavailable, EIGRP needsto converge fast, its onlymechanism for fast

convergence is toactively query for thelost route to itsneighbors


59/88


EIGRP Query Process

Queries are sent out when a route is lost and nofeasible successor is available

The lost route is now in active state

Queries are sent out to all of its neighbors on allinterfaces except the interface to the successor

If the neighbor does not have the lost routeinformation, queries are sent out to their neighbors


60/88


EIGRP Query Process

The router will have to get ALL of the replies fromthe neighbors before the router calculates thesuccessor information

If any neighbor fails to reply the query in threeminutes, this route is stuck in active and the routerresets the neighbor that fails to reply

Solution is to limit query range to be covered later inpresentation


61/88


EIGRP Query Range

Autonomous System Boundaries

Contrary to popular belief, queries are not bounded by ASboundaries. Queries from AS 1 will be propagated to AS 2

AS 1AS 2

Query for XReply for XQuery for X

A CB

Network XXX


62/88


EIGRP Query Range

Summarization point

Auto or manual summarization bound queries

Requires a good address allocation scheme

A CB130.130.1.0/24

B Summarizes 130.0.0.0/8 to A

130.x.x.x

Reply with Infinity and the

Query Stops Here!

Query for

130.130.1.0/24

XX129.x.x.x

Query for

130.130.1.0/24


63/88


EIGRP Bandwidth Utilization

EIGRP by default will use up to 50% of the linkbandwidth for EIGRP packets

This parameter is manually configurable by usingthe command:

ip bandwidth-percent EIGRP

Use for greater EIGRP load control


64/88


Bandwidth over WAN Interfaces

Bandwidth utilization over point-to-pointsubinterface Frame Relay

Treats bandwidth as T1 by default

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


65/88



Bandwidth over multipoint Frame Relay, ATM, SMDS,

and ISDN PRI:

EIGRP uses the bandwidth on the main interfacedivided by the number of neighbors on thatinterface to get the bandwidth information per

neighbor


66/88



Each PVC might have different CIR, this might createEIGRP 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)


67/88


Agenda


DUAL


Query Process

EIGRP FOR CE-PE CONNECTIVITY INMPLS VPN NETWORKS

Deployment Guidelines with EIGRP Summary

676767

EIGRP: CE-PE Routing Protocol in


68/88


gMPLS VPN

Support Enhanced Interior Gateway Routing Protocol (EIGRP)routes through a Multiprotocol Label Switching (MPLS) VirtualPrivate Network (VPN) over a Border Gateway Protocol (BGP)core network by redistributing EIGRP into MPBGP on aprovider edge router

Configuration is only on PE routers and requires no upgradeor configuration changes to customer equipment

Also support EIGRP extended community attributes

Things an enterprise customers needs to consider:

Things a Service Providers need to consider:


69/88


CE-PE Connectivity

Things an enterprise customers needs to consider:

Things a Service Providers need to consider:

Topology Ex:


70/88


Agenda


DUAL


Query Process

EIGRP for CE-PE connectivity in MPLS VPNNetworks

DEPLOYMENT GUIDELINES WITH EIGRP Summary

707070


71/88


Factors That Influence EIGRP Scalability

Keep in mind that EIGRP is not plug and play forlarge networks

Limit EIGRP query range!

Quantity of routing information exchangedbetween peers


72/88


10.1.8.0/24

RTRB

RTRA

RTRC

RTRD

RTRE

Distribution Layer Remote Sites

Limiting Updates/QueriesExample


73/88


Limiting Size/Scope of Updates/Queries

Evaluate routing requirements

What routes are needed where?

Once needs are determined

Use summary address

Use new EIGRP Stub feature

(To be discussed later)

Use distribute lists


74/88


10.1.8.0/24

RTRB

RTRA

RTRC

RTRD

RTRE


XXQueriesReplies

Limiting Updates/QueriesExample


75/88


Limiting Updates/QueriesSummary

Remote routers fully involved in convergence

Most remotes are never intended to be transit

Convergence complicated through lack of

information hiding


76/88


10.1.8.0/24

RTRB

RTRA

RTRC

RTRD

RTRE


XXQueriesReplies

IP summary-address EIGRP 1 10.0.0.0 255.0.0.0

on all outbound interfaces to remotes

Limiting Updates/QueriesBetter


77/88


Limiting Updates/QueriesSummary

Convergence simplified by adding thesummary-address statements

Remote routers just reply when queried

Limiting Updates/Queries


78/88


New Feature

New EIGRP STUB command is now available(12.0.7T and higher)

[no] EIGRP stub [receive-only] [connected] [static][summary]

Only specified routes are advertised.

Any neighbor receiving stub information from aneighbor will not query those routers for anyroutes


79/88


Limiting Updates/QueriesBest

Best practice is to combine Summarization andEIGRP STUB command

/Q


80/88


10.1.8.0/24

RTRB

RTRA

RTRC

RTRD

RTRE


XXQueriesReplies

IP summary-address EIGRP 1 10.0.0.0 255.0.0.0 EIGRP stub connected

on all outbound interfaces to remotes on all remote routers C, D, and E

Limiting Updates/QueriesBest

Hi h /Add i


81/88


Hierarchy/Addressing

Permits maximum information hiding

Advertise major net or default route to regionsor remotes

Provides adequate redundancy

EIGRP S l bilit


82/88


EIGRP Scalability

EIGRP is a very scalable routing protocol if properdesign methods are used:

Good allocation of address space

Each region should have an unique addressspaceso route summarization is possible

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

EIGRP S l bilit


83/88


EIGRP Scalability

Use of EIGRP Stub command if possible

Proper network resources

Sufficient memory on the router

Sufficient bandwidth on WAN interfaces

Proper configuration of the bandwidth statementover WAN interfaces, especially over Frame Relay

Avoid blind mutual redistribution betweentwo routing protocols or two EIGRP processes

Ti d N t k D i


84/88


DistributionLayer

Access Layer

Summarized Routes

Summarized RoutesSummarized Routes

Summarized Routes

Summarized Routes

Possible stubSummarized Routes

Possible Stub

Tiered Network Design

OtherRegions

OtherRegions

OtherRegions

OtherRegions

Core

N l bl N t k


85/88


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.02.2.3.0

2.2.2.0

TokenRing

TokenRing

TokenRing

Token

Ring

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.0

2.2.2.01.1.3.0

Nonscalable Network

Bad addressing schemeSubnets are everywhere throughout entire network

Queries not bounded

S l bl N t k


86/88


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.01.1.3.0

2.2.2.0

1.0.0.0

TokenRing

TokenRing

TokenRing

Token

Ring

Scalable Network

Readdress networkEach region has its own block of address

Queries bounded by using ip summary-address EIGRP command

S


87/88


Summary

Query range

Best way to limit query is through routesummarization and new EIGRP Stub command

EIGRP is not plug and play for large networks

Its a very scalable protocol with little designrequirement

Optimizing EIGRP network

Limiting query rangeRoute summarization

Tiered network design

Use of EIGRP Stub command


88/88

eigrp for managed services technology deployment

Documents