Eigrp For Managed Services Technology Deployment: Sangita Pandya Internet Technologies Division December 2004

EIGRP FOR MANAGED SERVICES TECHNOLOGY DEPLOYMENT
SANGITA PANDYA INTERNET TECHNOLOGIES DIVISION DECEMBER 2004
Session Number Presentation_ID
2004 Cisco Systems, Inc. All rights reserved.
Agenda
INTRODUCTION Fundamentals of EIGRP
DUAL Summarization and Load Balancing Query Process
Deployment Guidelines with EIGRP Summary
Presentation_ID
VPN for Many Managed Services

V i r t u a l P r i v a t e N e t w o r k
MANAGED Routing MANAGED CPE MANAGED Internet Gateway
MANAGED Security
Service Level Agreement for MANAGED Services
MANAGED IPT
Service Provider Converged Network
MANAGED Extranet
VM
VM
Customer Branch
Presentation_ID
VPN B
Customer HQ
3
Managed Routing Revenue Opportunity

Over 50% of Cisco Enterprise Customers Deploy IP Routing with EIGRP
IP/MPLS VPN Backbone
PE-3 PE-1 PE-2
CE-1 CE-2
EIGRP AS-1
EIGRP AS-1
Presentation_ID
Robust EIGRP Support
Cisco Exclusive
Cisco IOS Supports the Industrys Most Comprehensive and Robust Routing Protocol Support: RIP, OSPF, BGP, ISIS, Including EIGRP
CEA2 CE1B1 RIPv2 P1 PE2 Static RIPv2
VPN C/Site 2 12.1/16

CEB2
16.2/16 VPN B/Site 2
BGP
RIPv2 PE1 P2 OSPF
CEA3
OSPF CEA1 P3 CEB3 PE3
16.2/16
BGP
VPN A/Site 1 16.1/16
VPN A/Site 2 VPN C/Site 1
12.2/16
BENEFITS:
Service Provider: Simplest point of entry into enterprises existing architecture Enterprise: Least disruption to current network design
Presentation_ID
Managed EIGRP
Benefits for SPs and Enterprises:
Impose little requirements or no restrictions on customer 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 different autonomous systems
Customer sites may consist of several connections to the MPLS VPN backbone
Customer sites may consist of one or more connections not part of the MPLS VPN backbone (backdoor links)
Presentation_ID
Introducing EIGRP
EIGRP is architected by Cisco systems to overcome short comings of other protocols such as RIP, IGRP and OSPF
It is widely deployed in Enterprise networks

MPLS VPN Service Providers also enable EIGRP on their PE routers to support the connecting networks which may already be running EIGRP EIGRP can also be used as CE-PE routing protocol for MPLS VPN connectivity
Presentation_ID
IGRP: Interior Gateway Routing 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
Presentation_ID
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 along the paths
Delay = Delay/10
Bandwidth is the lowest bandwidth of the link along the paths

Bandwidth = 10000000/Bandwidth
Presentation_ID
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
Presentation_ID
10
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
Presentation_ID
11
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 any interface at any router within network
Presentation_ID
12
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
Presentation_ID
13
EIGRP Neighbor Relationship

Two routers become neighbors when they see each others hello packet
Hello address = 224.0.0.10
Hellos sent once every five seconds on the 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
Presentation_ID
14

Hellos sent once every 60 seconds on the following links:
Multipoint circuits with bandwidth less than or equal to T1: ISDN BRI, Frame Relay, SMDS, etc.
Neighbor declared dead when no EIGRP packets are received within hold interval
Not only Hello can reset the hold timer
Hold time by default is three times the hello time
Presentation_ID
15

EIGRP will form neighbors even though hello time and 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)
Presentation_ID
16
Discovering Routes
A
1
afadjfjorqpoeru 39547439070713
B
I am Router A, Who Is on the Link?
Hello
Presentation_ID
17
Discovering Routes
A
1
B
Hello
Here Is My Routing Information (Unicast)
Update
Presentation_ID
18
Discovering Routes
A
1
B
Hello

Update
Ack
Thanks for the Information!
Presentation_ID
19
Discovering Routes
A
1
B
Hello

Update
4
Topology Table
Ack
Presentation_ID
20
Discovering Routes
A
1
B
Hello

Update
4
Topology Table
3 5
Ack
Update
Here Is My Route Information (Unicast)
Presentation_ID
21
Discovering Routes
A
1
B
Hello

Update
4
Topology Table
3 5
Ack
Update
Here Is My Route Information (Unicast)

Ack
Converged
Presentation_ID
22
Agenda
Fundamentals of EIGRP DUAL Summarization and Load Balancing Query Process Deployment Guidelines with EIGRP
Summary
Presentation_ID
23
EIGRP DUAL
Diffusing update algorithm Finite-State-Machine
Track all routes advertised by neighbors Select loop-free path using a successor and remember any feasible successors If successor lost
Use feasible successor

If no feasible successor Query neighbors and recompute new successor
Presentation_ID
24
EIGRP Feasible Distance (FD)

Feasible distance is the minimum distance (metric) along a path to a destination network
Presentation_ID
25
Feasible Distance Example

Network 7 (20) (100) (100) (100) H (1)
FDDI
(10)
G C F
B
D
(100)
(10)
(20)
Destination
Feasible Distance (FD) 100+20+10=130 100+1+10+10=121
Neighbor
Topology Table
7 7
7
H B D
100+100+20+10+10=240
Presentation_ID
26
EIGRP Reported Distance (RD)

Reported distance is the distance (metric) towards a destination as advertised by an upstream neighbor
Reported distance is the distance reported in the queries, the replies and the updates
Presentation_ID
27
Reported Distance Example

Network 7 (20) (100) H
(10)
G C F
(100)
A (100)
(1)
FDDI
B
D
(100)
(10)
(20)
Topology Table
Destination
Reported Distance (RD) 20+10=30 1+10+10=21
Neighbor
7 7
7
H B D
100+20+10+10=140
Presentation_ID
28
EIGRP Feasibility Condition (FC)

A neighbor meets the feasibility condition (FC) if the reported distance by the neighbor is smaller than the feasible distance (FD) of this router
Presentation_ID
29
EIGRP Successor
A successor is a neighbor that has met the feasibility condition and has the least cost path towards the destination
It is the next hop for forwarding packets

Multiple successors are possible (load balancing)
Presentation_ID
30
EIGRP Feasible Successor (FS)

A feasible successor is a neighbor whose reported distance (RD) is less than the feasible distance (FD)
Presentation_ID
31
Successor Example
Network 7 (100) (20) H (1)
FDDI
(10)
G C F
(100)
A (100)
B
D
(100)
FD 130
(10)
Neighbor
(20)
RD 30 21
Router As Routing Table

7 121 B
Destination
Topology Table
7 7 7
H B
121
240
140
B is current successor (FD = 121) H is the feasible successor (30 < 121)
Presentation_ID
32
Passive, Active, and Stuck in Active (SIA)

Passive routes are routes that have successor information
Passive route = Good
Active routes are routes that have lost their successors and no feasible successors are available; the router is actively looking for alternative 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
Presentation_ID
33
Dual Algorithm
Local computation
When a route is no longer available via the current successor, the router checks its topology table
Router can switch from successor to feasible successor without involving other routers in the computation
Router stays passive Updates are sent
Presentation_ID
34
DUAL: Local Computation

(10)
H
#1
#2 #8 (20) #6
#7
A
(10)
#3
FDDI
#7 #7
121/21 B 130/30 H
(100)
X
D
#4 (100)
(1)
#5 (20)
(10)
. . .
. . .
. . .
Presentation_ID
35
Dual Algorithm
Diffused Computation
When a route is no longer available via its current successor and no feasible successor is available, queries are sent out to neighbors asking about the lost route The route is said to be in active state Neighbors reply to the query if they have information about the lost route; if not, queries are sent out to all of their neighbors The router sending out the query waits for all of the replies from its neighbors and will make routing decision based on the replies
Presentation_ID
36
DUAL: Diffused Computation

(10) #2
#1
A
(10)
#7 #7
121/21 B 130/30 H
(100)
X X
B
D
#4 (100)
#7
#8 (20) #3
FDDI
G
#6
(1)
#5 (20)
(10)
. . .
. . .
. . .
Presentation_ID
37
DUAL Example
(a) C EIGRP Topology (a) Cost (3) (fd) via B Cost (3/1) (Successor) via D Cost (4/2) (fs) via E Cost (4/3)
(1) B (1)
X
(1)
D EIGRP Topology (a) Cost (2) (fd) via B Cost (2/1) (Successor) via C Cost (5/3)
(2)
C
(2) (1)
E EIGRP Topology (a) Cost (3) (fd) via D Cost (3/2) (Successor) via C Cost (4/3)
38
Presentation_ID
DUAL Example
(a) C EIGRP Topology (a) Cost (3) (fd) via B Cost (3/1) (Successor) via D via E Cost (4/3)
(1) B (2) Q (1) D
D EIGRP Topology (a) **ACTIVE** Cost (-1) (fd) via E (q) via C Cost (5/3) (q)
(2)
C
(1) Q
E
E EIGRP Topology (a) Cost (3) (fd) via D Cost (3/2) (Successor) via C Cost (4/3)
39
Presentation_ID
DUAL Example
(a) C EIGRP Topology (a) Cost (3) (fd) via B Cost (3/1) (Successor) via D via E
(1) B (2) (1) Q

Presentation_ID
D R
D EIGRP Topology (a) **ACTIVE** Cost (-1) (fd) via E (q) via C Cost (5/3)
(2)
C
(1)
E
E EIGRP Topology (a) **ACTIVE** Cost (-1) (fd) via D via C Cost (4/3) (q)
40
DUAL Example
(1) B (2) (1) R

Presentation_ID
D EIGRP Topology (a) **ACTIVE** Cost (-1) (fd) via E (q) via C Cost (5/3)
(2)
C
(1)
E
E EIGRP Topology (a) Cost (4) (fd) via C Cost (4/3) (Successor) via D
41
DUAL Example
(1) B R (2) (1) D
D EIGRP Topology (a) Cost (5) (fd) via C Cost (5/3) (Successor) via E Cost (5/4) (Successor)
(2)
C
(1)
E
42
Presentation_ID
DUAL Example
(1) B (2) (1) D
D EIGRP Topology (a) Cost (5) (fd) via C Cost (5/3) (Successor) via E Cost (5/4) (Successor)
(2)
C
(1)
E
43
Presentation_ID
EIGRP Reliable Transport Protocol

EIGRP reliable packets are packets that requires explicit acknowledgement:
Update
Query
Reply
EIGRP unreliable packets are packets that do not require explicit acknowledgement:
Hello Ack
Presentation_ID
46

The router keeps a neighbor list and a retransmission list for every neighbor Each reliable packet (Update, Query, Reply) will be retransmitted when packet is not acked EIGRP transport has window size of one (stop and wait mechanism)
Every single reliable packet needs to be acknowledged before the next sequenced packet can be sent
Presentation_ID
47

With reliable multicast traffic, one must wait to transmit the next reliable multicast packets, until all peers have acknowledged the previous multicast
If one or more peers are slow in acknowledging, all other peers suffer from this
Solution: The nonacknowledged multicast packet will be retransmitted as a unicast to the slow neighbor
Presentation_ID
48

Per neighbor, retransmission limit is 16 Neighbor relationship is reset when retry limit (limit = 16) for reliable packets is reached
Presentation_ID
49
Agenda
Fundamentals of EIGRP DUAL SUMMARIZATION AND LOAD BALANCING Query Process Deployment Guidelines with EIGRP
Summary
Presentation_ID
50
EIGRP Summarization
Purpose: Smaller routing tables, smaller updates, query boundary Auto summarization:
On major network boundaries, networks are summarized to the major networks Auto summarization is turned on by default
192.168.1.x
192.168.2.x
192.168.1.0
Presentation_ID 51
EIGRP Summarization
Manual summarization
Configurable on per interface basis in any router within network
When summarization is configured on an interface, the router immediate creates a route pointing to null zero with 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 as the metric of the summary route
Presentation_ID
52
EIGRP Summarization
Manual summarization command:
ip summary-address EIGRP <as number> <address> <mask> 192.168.9.X
AS 1 192.168.8.0/22
192.168.8.X
S0 interface s0 ip address 192.168.11.1 255.255.255.252 ip summary-address EIGRP 1 192.168.8.0 255.255.252.0
192.168.10.X
Presentation_ID
53
EIGRP Load Balancing

Routes with equal metric to the minimum metric, will be installed in the routing table (Equal Cost Load Balancing)
There can be up to six entries in the routing table for the same destination (default = 4)
ip maximum-paths <1-6>
Presentation_ID
54
EIGRP Unequal Cost Load Balancing

EIGRP offers unequal cost load balancing feature with the command:
Variance <multiplier>
Variance command will allow the router to include routes with a metric smaller than multiplier times the minimum metric route for that destination, where multiplier is the number specified by the variance command
Presentation_ID
55
Variance Example
B
E 20 10 C A Net X
10
Variance 2 20
10
25
Router E will choose router C to get to net X FD=20 With variance of 2, router E will also choose router B to get to net X Router D will not be used to get to net X
Presentation_ID
56
Agenda
Fundamentals of EIGRP DUAL Summarization and Load Balancing QUERY PROCESS Deployment Guidelines with EIGRP
Summary
Presentation_ID
57
EIGRP Query Process

EIGRP is Advanced Distant Vectorit relies on its neighbor to provide routing information If a route is lost and no feasible successor is available, EIGRP needs to converge fast, its only mechanism for fast convergence is to actively query for the lost route to its neighbors
Have You Seen My Sparky?
Presentation_ID
58
EIGRP Query Process

Queries are sent out when a route is lost and no feasible successor is available The lost route is now in active state Queries are sent out to all of its neighbors on all interfaces except the interface to the successor If the neighbor does not have the lost route information, queries are sent out to their neighbors
Presentation_ID
59
EIGRP Query Process

The router will have to get ALL of the replies from the neighbors before the router calculates the successor information
If any neighbor fails to reply the query in three minutes, this route is stuck in active and the router resets the neighbor that fails to reply
Solution is to limit query range to be covered later in presentation
Presentation_ID
60
EIGRP Query Range

Autonomous System Boundaries
Contrary to popular belief, queries are not bounded by AS boundaries. Queries from AS 1 will be propagated to AS 2
C Network X
AS 2 Query for X
AS 1 Reply for X
Query for X
Presentation_ID
61
EIGRP Query Range

Summarization point
Auto or manual summarization bound queries
Requires a good address allocation scheme
B Summarizes 130.0.0.0/8 to A A 129.x.x.x Query for 130.130.1.0/24 Reply with Infinity and the Query Stops Here! Query for 130.130.1.0/24 B C 130.130.1.0/24 130.x.x.x
Presentation_ID
62
EIGRP Bandwidth Utilization

EIGRP by default will use up to 50% of the link bandwidth for EIGRP packets This parameter is manually configurable by using the command:
ip bandwidth-percent EIGRP <AS-number> <nnn>
Use for greater EIGRP load control
Presentation_ID
63
Bandwidth over WAN Interfaces

Bandwidth utilization over point-to-point subinterface Frame Relay
Treats bandwidth as T1 by default
Best practice is to manually configure bandwidth as the CIR of the PVC
Presentation_ID
64
Bandwidth over multipoint Frame Relay, ATM, SMDS, and ISDN PRI:
EIGRP uses the bandwidth on the main interface divided by the number of neighbors on that interface to get the bandwidth information per neighbor
Presentation_ID
65

Each PVC might have different CIR, this might create EIGRP packet pacing problem
Multipoint interfaces:
Convert to point-to-point
Bandwidth configured = (lowest CIR x number of PVC) ISDN PRI:
Use Dialer Profile (treat as point-to-point link)
Presentation_ID
66
Agenda
Fundamentals of EIGRP DUAL Summarization and Load Balancing Query Process EIGRP FOR CE-PE CONNECTIVITY IN MPLS VPN NETWORKS Deployment Guidelines with EIGRP Summary
Presentation_ID
67
EIGRP: CE-PE Routing Protocol in MPLS VPN

Support Enhanced Interior Gateway Routing Protocol (EIGRP) routes through a Multiprotocol Label Switching (MPLS) Virtual Private Network (VPN) over a Border Gateway Protocol (BGP) core network by redistributing EIGRP into MPBGP on a provider edge router Configuration is only on PE routers and requires no upgrade or 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:
Presentation_ID
68
CE-PE Connectivity
Things an enterprise customers needs to consider: Things a Service Providers need to consider: Topology Ex:
Presentation_ID
69
Agenda
Fundamentals of EIGRP DUAL Summarization and Load Balancing Query Process EIGRP for CE-PE connectivity in MPLS VPN Networks DEPLOYMENT GUIDELINES WITH EIGRP Summary
Presentation_ID
70
Factors That Influence EIGRP Scalability

Keep in mind that EIGRP is not plug and play for large networks Limit EIGRP query range! Quantity of routing information exchanged between peers
Presentation_ID
71
Limiting Updates/QueriesExample
Distribution Layer
10.1.8.0/24
Remote Sites
RTRC
RTRB RTRD
RTRA RTRE
Presentation_ID
72
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
Presentation_ID
73
Limiting Updates/QueriesExample
Distribution Layer
Queries Replies
10.1.8.0/24
Remote Sites
RTRC RTRB
RTRD
RTRA RTRE
Presentation_ID
74
Limiting Updates/QueriesSummary
Remote routers fully involved in convergence
Most remotes are never intended to be transit Convergence complicated through lack of information hiding
Presentation_ID
75
Limiting Updates/QueriesBetter
Distribution Layer
Queries Replies
10.1.8.0/24
Remote Sites
RTRC
RTRB
RTRD
RTRA IP summary-address EIGRP 1 10.0.0.0 255.0.0.0 on all outbound interfaces to remotes

Presentation_ID
RTRE
76
Limiting Updates/QueriesSummary
Convergence simplified by adding the summary-address statements Remote routers just reply when queried
Presentation_ID
77
Limiting Updates/Queries 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 a neighbor will not query those routers for any routes
Presentation_ID
78
Limiting Updates/QueriesBest
Best practice is to combine Summarization and EIGRP STUB command
Presentation_ID
79
Limiting Updates/QueriesBest
Distribution Layer
10.1.8.0/24
Remote Sites
Queries Replies
RTRC
RTRB
RTRD
RTRA RTRE IP summary-address EIGRP 1 10.0.0.0 255.0.0.0 on all outbound interfaces to remotes
Presentation_ID
EIGRP stub connected on all remote routers C, D, and E

80
Hierarchy/Addressing
Permits maximum information hiding Advertise major net or default route to regions or remotes Provides adequate redundancy
Presentation_ID
81
EIGRP Scalability
EIGRP is a very scalable routing protocol if proper design methods are used:
Good allocation of address space
Each region should have an unique address space so route summarization is possible
Have a tiered network design model (Core, Distribution, Access)
Presentation_ID
82
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 statement over WAN interfaces, especially over Frame Relay Avoid blind mutual redistribution between two routing protocols or two EIGRP processes
Presentation_ID
83
Tiered Network Design

Summarized Routes
Other Regions
Summarized Routes
Other Regions
Core Other Regions Summarized Routes

Distribution Layer
Summarized Routes
Other Regions
Summarized Routes Possible stub
Summarized Routes Possible Stub
Access Layer
Presentation_ID
84
Nonscalable Network
Core
1.1.1.0 1.1.2.0 2.2.3.0 3.3.4.0 2.2.1.0 3.3.2.0 3.3.3.0 1.1.4.0
3.3.1.0 2.2.2.0 1.1.3.0

Token Ring
Token Ring
1.1.1.0 3.3.4.0
Token Ring
2.2.1.0
1.1.4.0
Token Ring
3.3.1.0
Token Ring
1.1.2.0
2.2.3.0 2.2.2.0
1.1.3.0
Token Ring
3.3.4.0 3.3.3.0
Bad addressing scheme

Subnets are everywhere throughout entire network
Queries not bounded

Presentation_ID
85
Scalable Network
Core 1.0.0.0 2.0.0.0

1.1.1.0 1.1.4.0
Token Ring Token Ring
3.0.0.0
3.3.1.0 2.2.1.0
Token Ring
Token Ring
3.3.4.0
Token Ring
1.1.2.0
1.1.3.0 2.2.2.0
2.2.3.0
Token Ring
3.3.4.0 3.3.3.0
Readdress network
Each region has its own block of address
Queries bounded by using ip summary-address EIGRP command

Presentation_ID
86
Summary
Query range
Best way to limit query is through route summarization and new EIGRP Stub command
EIGRP is not plug and play for large networks

Its a very scalable protocol with little design requirement
Optimizing EIGRP network

Limiting query range Route summarization Tiered network design Use of EIGRP Stub command
Sufficient network resources

Presentation_ID
87
Presentation_ID
88

Eigrp For Managed Services Technology Deployment: Sangita Pandya Internet Technologies Division December 2004

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Eigrp For Managed Services Technology Deployment: Sangita Pandya Internet Technologies Division December 2004

Uploaded by

Copyright:

Available Formats

EIGRP FOR MANAGED SERVICES TECHNOLOGY DEPLOYMENT

SANGITA PANDYA INTERNET TECHNOLOGIES DIVISION DECEMBER 2004

Session Number Presentation_ID

2004 Cisco Systems, Inc. All rights reserved.

Deployment Guidelines with EIGRP Summary

2004 Cisco Systems, Inc. All rights reserved.

VPN for Many Managed Services

MANAGED Routing MANAGED CPE MANAGED Internet Gateway

Service Provider Converged Network

Managed Routing Revenue Opportunity

PE-3 PE-1 PE-2

2004 Cisco Systems, Inc. All rights reserved.

Robust EIGRP Support

VPN C/Site 2 12.1/16

16.2/16 VPN B/Site 2

OSPF CEA1 P3 CEB3 PE3

VPN A/Site 1 16.1/16

VPN A/Site 2 VPN C/Site 1

CE and C routers are NOT required to run newer code

Customer sites may be same or different autonomous systems

2004 Cisco Systems, Inc. All rights reserved.

It is widely deployed in Enterprise networks

2004 Cisco Systems, Inc. All rights reserved.

IGRP: Interior Gateway Routing Protocol

90 seconds updates (RIP is 30 sec.)

2004 Cisco Systems, Inc. All rights reserved.

IGRP/EIGRP Metrics Calculation

Bandwidth is the lowest bandwidth of the link along the paths

2004 Cisco Systems, Inc. All rights reserved.

Problems with RIP and IGRP

2004 Cisco Systems, Inc. All rights reserved.

Unequal cost paths load balancing More flexible than OSPF

2004 Cisco Systems, Inc. All rights reserved.

2004 Cisco Systems, Inc. All rights reserved.

EIGRP Neighbor Relationship

Hellos sent once every five seconds on the following links:

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

2004 Cisco Systems, Inc. All rights reserved.

EIGRP Neighbor Relationship

Hold time by default is three times the hello time

2004 Cisco Systems, Inc. All rights reserved.

EIGRP Neighbor Relationship

EIGRP will not form neighbor if AS numbers are mismatched

2004 Cisco Systems, Inc. All rights reserved.

2004 Cisco Systems, Inc. All rights reserved.

Here Is My Routing Information (Unicast)

2004 Cisco Systems, Inc. All rights reserved.

Here Is My Routing Information (Unicast)

Thanks for the Information!

2004 Cisco Systems, Inc. All rights reserved.

Here Is My Routing Information (Unicast)

Thanks for the Information!

2004 Cisco Systems, Inc. All rights reserved.

Here Is My Routing Information (Unicast)

Thanks for the Information!

Here Is My Route Information (Unicast)

2004 Cisco Systems, Inc. All rights reserved.

Here Is My Routing Information (Unicast)

Thanks for the Information!

Here Is My Route Information (Unicast)

Thanks for the Information!

2004 Cisco Systems, Inc. All rights reserved.