Semester 5

Chapter 6 EIGRP

Objective
Upon completion of this chapter, you will be able to perform the following tasks:
Describe EIGRP features and operation Explain how EIGRP discovers, chooses, and maintains routes Explain how EIGRP supports the use of VLSM and route summarization Explain how EIGRP operates in an NBMA environment Describe how EIGRP supports large networks
2

Configure and Verify EIGRP

Topic

1. EIGRP Fundamentals

2. EIGRP Features
3. EIGRP Components 4. EIGRP Operation 5. Configuring EIGRP 6. Monitoring EIGRP
3

7. Summary/Question and Answer

EIGRP Fundamental

1. EIGRP Overview

2. EIGRP and IGRP compatibility

3. EIGRP design

4. EIGRP support for Novell IPX and AppleTalk

4

5. EIGRP terminology

EIGRP Overview
Cisco released EIGRP in 1994 as a scalable, improved version routing protocol to replace IGRP.

EIGRP supports:
Rapid convergence
Reduced bandwidth usage

Multiple network-layer protocols supported

5

Easy to configure.

EIGRP and IGRP compatibility

EIGRP uses a different metric calculation
EIGRP scales IGRP's metric by a factor of 256. EIGRP uses a metric that is 32 bits long (IGRP 24-bit ) By multiplying or dividing by 256, EIGRP can easily exchange information with IGRP.

EIGRP and IGRP compatibility

Different hop-count limitation
EIGRP also imposes a maximum hop limit of 224 < IGRP's generous 255

Similar with IGRP

Getting dissimilar routing protocols (RIP, OSPF..) need to redistribute or add on configuration. Sharing, or redistribution, is automatic between IGRP and EIGRP if same AS number.
7

EIGRP design
EIGRP acts like a link-state protocol when updating neighbors and maintaining routing information. EIGRP's advantages over simple distance-vector protocols :
Rapid convergence (because use Diffusing Update Algorithm - DUAL) Efficient use of bandwidth
Partial, bounded (incremental) updates Minimal consumption of bandwidth when the network is stable with small hello packets

Support for VLSM and CIDR Multiple network-layer support and Independence from routed protocols
8

EIGRP with IPX

Redistribute IPX RIP and SAP information to improve overall performance

Take over for these two protocols. Router will receive routing and service updates and then update other routers only when changes in occur:
Routing updates occur as they would in any EIGRP network - using partial updates. EIGRP sends SAP updates incrementally on all serial interfaces by default

Advanced Metric, Hop from RIP, NLSP and SAP Cisco IOS > 11.1 EIGRP can redistribute NLSP
9

EIGRP with AppleTalk

EIGRP can also take over for AppleTalk's Routing Table Maintenance Protocol (RTMP distance-vector routing protocol). EIGRP redistributes AppleTalk routing information using event-driven updates.

Configurable composite metric to determine the best route to an AppleTalk network.

Remember:
AppleTalk clients expect RTMP information from local routers.
EIGRP for AppleTalk should be run only on a clientless network, such as a WAN link.
10

EIGRP terminology
Keep route and topology information readily in RAM react quickly to changes.
Neighbor table
The lists adjacent routers, each protocol each table

Topology Table
Route entries for all destinations, each protocol each table

Routing Table
The best route from Topology table, each protocol each table

Successor
Primary route to reach destination Kept in routing table Multiple successors for a destination can be retained in the routing table

Feasible successor (FS)

Backup route Kept in Topology Table Multiple FS for a destination can be retained in the Topology table

11

EIGRP Features

1. EIGRP technologies
2. Neighbor discovery and recovery 3. Reliable transport protocol 4. DUAL finite-state machine 5. Protocol-dependent modules
12

EIGRP technologies
Many new technologies are improvement in operating efficiency, rapidity of convergence, or functionality relative another Routing protocol

Four categories:
1.Neighbor discovery and recovery 2.Reliable Transport Protocol 3.DUAL finite-state machine 4.Protocol-specific modules
13

Neighbor discovery and recovery

EIGRP routers actively establish relationships with their neighbors same way that OSPF routers do. EIGRP routers establish adjacencies with neighbor routers by using small hello packets (default every 5s or 60s). By forming adjacencies, EIGRP routers do:
Dynamically learn of new routes that join their network Identify routers that become either unreachable or inoperable Rediscover routers that had previously been unreachable
14

Initial Route Discovery

A
1
Hello

B
I am router A, who is on the link?

4
Topology Table

Here is my complete routing information. Update

3 5

Ack

Thanks for the information!

Update Here is my complete route information.

Thanks for the information!

Converged
15

Reliable transport protocol (RTP)

RTP,EIGRP own protocol, is a transport-layer protocol that can guarantee ordered delivery of EIGRP packets to all neighbors. EIGRP can call on RTP to provide reliable or unreliable service as the situation warrants.

Reliable delivery of other routing information can actually speed convergence because EIGRP routers are not waiting for a timer to expire before they retransmit.
EIGRP can multicast and unicast to different peers simultaneously, allowing for maximum efficiency.
16

Reliable transport protocol (RTP)

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
17

Reliable transport protocol (RTP)

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 acknowledged Neighbor relationship is reset when retry limit (limit = 16) for reliable packets is reached This information is required to allow EIGRP to maintain a loop-free topology at all times.
18

Reliable transport protocol (RTP)

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 If one or more peers are slow in acknowledging, all other peers suffer from this

Solution: The non acknowledged multicast packet will be retransmitted as a unicast to the slow neighbor
19

DUAL finite-state machine (DFS)

Diffusing Update Algorithm (DUAL) EIGRP's route-calculation engine. DFS:
Tracks all routes advertised by neighbors.

Lowest-cost paths are inserted by the DUAL protocol into the routing table.
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 recomputed new successor
20

DUAL Example
(a) C (a) EIGRP via B via D via E D EIGRP (a) via B via C FD AD 3 3 1 4 2 4 3 FD AD 2 2 1 5 3 Topology (fd) (Successor) (fs)

A (1) (1) B D (2) (1) C

21

Topology (fd) (Successor)

(2)

(1)
E EIGRP (a) via D via C FD AD 3 3 2 4 3 Topology (fd) (Successor)

DUAL Example
(a) C (a) EIGRP via B via D via E D EIGRP (a) via B via C FD AD 3 3 1 4 2 4 3 FD AD 2 2 1 5 3 Topology (fd) (Successor) (fs)

A (1) (1) B

X
(1)

Topology (fd) (Successor)

(2)

(2) (1) C

E EIGRP (a) via D via C

FD AD 3 3 2 4 3

Topology (fd) (Successor)

22

DUAL Example
(a) C (a) EIGRP via B via D via E D EIGRP (a) **ACTIVE** via E via C FD AD 3 3 1 4 3 Topology (fd) (q) (q) Topology (fd) (Successor)

A (1)

FD AD -1 5 3

D (2)

(2)

(1)

Q E

(1) C
23

E EIGRP (a) via D via C

FD AD 3 3 2 4 3

Topology (fd) (Successor)

DUAL Example
(a) C (a) EIGRP via B via D via E D EIGRP (a) **ACTIVE** via E via C FD AD 3 3 1 Topology (fd) (Successor)

A (1)

FD AD -1 5 3

D (2) (1) R

Topology (fd) (q)

(2)

(1)
E EIGRP (a) **ACTIVE** via D via C FD AD -1 4 3 Topology (fd) (q)

C
24

DUAL Example
(a) C (a) EIGRP via B via D via E D EIGRP (a) **ACTIVE** via E via C FD AD 3 3 1 Topology (fd) (Successor)

A (1)

FD AD -1 5 3

D (2) (1)

Topology (fd) (q)

(2)

(1)
E EIGRP (a) via C via D FD AD 4 4 3 Topology (fd) (Successor)

C
25

DUAL Example
(a) C (a) EIGRP via B via D via E D EIGRP (a) via C via E FD AD 3 3 1 Topology (fd) (Successor)

A (1)

D R (2) (1)

FD AD 5 5 3 5 4

Topology (fd) (Successor) (Successor)

(2)

(1)
E EIGRP (a) via C via D FD AD 4 4 3 Topology (fd) (Successor)

C
26

DUAL Example
(a) C (a) EIGRP via B via D via E D EIGRP (a) via C via E FD AD 3 3 1 Topology (fd) (Successor)

A (1)

D (2) (1)

FD AD 5 5 3 5 4

Topology (fd) (Successor) (Successor)

(2)

(1)
E EIGRP (a) via C via D FD AD 4 4 3 Topology (fd) (Successor)

C
27

DUAL Example (Start)

(a) C (a) EIGRP via B via D via E D EIGRP (a) via B via C FD AD 3 3 1 4 2 4 3 FD AD 2 2 1 5 3 Topology (fd) (Successor) (fs)

A (1) (1) B D (2) (1) C

28

Topology (fd) (Successor)

(2)

(1)
E EIGRP (a) via D via C FD AD 3 3 2 4 3 Topology (fd) (Successor)

DUAL Example (End)

(a) C (a) EIGRP via B via D via E D EIGRP (a) via C via E FD AD 3 3 1 Topology (fd) (Successor)

A (1)

D (2) (1)

FD AD 5 5 3 5 4

Topology (fd) (Successor) (Successor)

(2)

(1)
E EIGRP (a) via C via D FD AD 4 4 3 Topology (fd) (Successor)

C
29

Protocol-dependent modules (PDM)

PDM is responsible for all functions related to its specific routed protocol

30

Protocol-dependent modules (PDM)

PDM can
Support for routed protocols such as IP, IPX, and AppleTalk Easily adapt to new or revised routed protocols

Sending and receiving EIGRP packets that bear IP data

Notifying DUAL of new IP routing information that is received

Maintaining the results of DUAL's routing decisions in the IP routing table

Redistributing routing information that was learned by other IP-capable routing protocols

31

EIGRP Components
Relies on several different kinds of packets to maintain its various tables and establish complex relationships with neighbor routers The 5 EIGRP packet types are listed here:
Hello : Establish neighbor relationships
Acknowledgment :Acknowledgement of a reliable packet

Update : Send routing updates

Query : Ask neighbors about routing information Reply : Response to query about routing information
32

EIGRP Components - Hello

Use for Discover, verify & rediscover neighbor routers. Hello packets are multicast : 224.0.0.10 Send hellos at a hello interval. Default value: EIGRP routers do not receive each other's hellos for a hold time interval (3 times hello interval):
Rediscovery occurs and then re-establish communication. DUAL must step in to re-evaluate the routing table

No need same hello and dead intervals to communicate.

33

EIGRP Components Acknowledgment To indicate receipt of any EIGRP packet during a "reliable" exchange. Recall that RTP can provide reliable communication between EIGRP hosts "dataless" hello packets unicast. Hello packets are always sent unreliably and thus do not require acknowledgment
34

EIGRP Components Update

New neighbor:
Use when a router discovers a new neighbor. EIGRP router sends unicast update packets (maybe more than one) to new neighbor it can add to its topology table.

Old neighbor:
Use when a router detects a topology change Sends a multicast update packet to all neighbors
35

Update packets are sent reliably

EIGRP Components - Query and Reply

query packets - multicast reply packet - unicast Need specific information from B

EIGRP router loses its successor and cannot find a feasible successor for a route:
DUAL places the route in the active state
Send multicasts a query to all neighbors for searching a successor to destination. Neighbors must send unicast replies that either provide information on successors or indicate that no successor information is available

Both packet types are sent reliably

36

EIGRP tables
DUAL can select alternate routes based on the tables kept by EIGRP EIGRP router can track all the routing information in an AS, not just the "best" routes EIGRP have 3 tables:
neighbor table
routing table topology table
37

EIGRP tables Neighbor

Neighbor relationships tracked in the neighbor table is the basis for all the EIGRP routing update and convergence activity. Contains information about adjacent neighboring, new neighbor is discovered New entry. Is used to support reliable, sequenced delivery of packets
38

EIGRP tables Neighbor

Neighbor address (Address)

The network-layer address of the neighbor router
39

EIGRP tables Neighbor

Hold time (Hold Uptime)

Interval to wait without receiving anything from a neighbor before considering the link unavailable EIGRP packets received after the first hello will reset the timer
40

EIGRP tables Neighbor

Smooth Round-Trip Timer (SRTT)

Average time that it takes to send and receive packets from a neighbor. This timer is used to determine the retransmit interval (RTO)
41

EIGRP tables Neighbor

Queue count (Q Cnt)

Number of packets waiting in queue to be sent Q Cnt:
=0: No EIGRP packets in the queue
42

>0:May be a congestion problem at the router

EIGRP tables Routing

Contains the routes installed by DUAL as the best loop-free paths to a given destination. Maintain up to four routes (can be of equal or unequal cost) per destination Maintain a separate routing table for each routed protocol.
43

EIGRP tables Topology

44

EIGRP tables Topology

Store all the information it needs to calculate a set of distances and vectors to all reachable destinations Maintains a separate topology table for each routed protocol Is made up of all the EIGRP routing tables in the autonomous system. By tracking this information, EIGRP routers can find alternate routes quickly
45

EIGRP tables Topology

Topology table have:

Feasible distance (FD is xxxx) Route source (via xxx.xxx.xxx.xxx) Reported distance (RD)
46

EIGRP tables Topology

RTA's routing table includes a route to Z via RTB (current successor). RTA Should be have at least one successor for Z for DUAL to place it in the routing table
RTC claims to have a route to Z with the exact same metric as RTB DUAL will install a second route to Z. RTA's other neighbors that advertise a loop-free route to Z (with RD > the best-route metric and < FD) will be identified as feasible successors in the topology table.
47

Note: RD = Reported Distance, FD = Feasible Distance.

EIGRP tables Topology

Successor down DUAL identify a FS from the topology table and install a new route to the destination. No FS to the destination exist, DUAL places the route in the active state Entries in the topology table can be in one of two states:
Active or Passive
These states identify the status of the route indicated by the entry rather than the status of the entry itself.

48

EIGRP tables Topology

A passive route is one that is stable and available for use. An active route is a route in the process of being recomputed by DUAL.
Re-computation happens if a route becomes unavailable and DUAL can not find any feasible successors. When this occurs, the router must ask neighbors for help in finding a new, loop-free path (feasible successors) to the destination. Neighbor routers are compelled to reply to this query: If a neighbor has a route, it will reply with information about the successor(s). If not, the neighbor notifies the sender that it does not have a route to the destination either.

49

"Stuck in Active" (SIA) Routes

DUAL always tries to find a feasible successor before resorting to a re-computation. If a feasible successor is available, DUAL can quickly install the new route and avoid re-computation. The route(s) in "stuck in active" state : If one or more routers to which a query is sent do not respond with a reply within the active time of 180 seconds (3 minutes). EIGRP clears the neighbors that did not send a reply and logs a "stuck in active" error message for the route(s) that went active.
50

Route tagging with EIGRP

EIGRP classifies routes as either internal or external EIGRP uses route tagging to add special tags to each route Tags identify route as :
Internal External Other information
51

Route tagging with EIGRP

Static routes are external routes External routes are included in the topology table and are tagged with the following information:
1. The router ID of the EIGRP router that redistributed the route into the EIGRP network 2. The AS number of the destination 3. The protocol used in that external network

4. The cost or metric received from that external protocol

5. The configurable administrator tag

Tag to be any number between 0 and 255

52

EIGRP Operation

DUAL's sophisticated algorithm results in EIGRP's exceptionally fast convergence

53

EIGRP Operation
RTA choose RTY = Successor (lowest computed cost) 31 = FD to Network 24 RTY down RTA try to use FS.

54

EIGRP Operation
RTA follows a three-step process:
1. Determine which neighbors have a RD < FD to network 24 RTX's RD is 30
2. Determine the minimum computed cost to Network 24 : RTX is 40 RTX provides the lowest computed cost. 3. Determine whether any routers that met the criterion in Step 1 also met the criterion in Step 2. RTX has done both, so it is the feasible successor.
55

EIGRP Operation
RTY down, RTA uses RTX (FS) forward packets to Network 24

If RTX also becomes unavailable:

RTZ cannot be a feasible successor because RD =220 > FD=31 And The FD can change only during an active-to-passive transition DUAL has been performing what is called a local computation RTA cannot find any FS

transitions passive to active state

queries its neighbors diffusing computation Network 24 is active state the FD is reset RTA to at last accept RTZ as the successor
56

Configuring EIGRP

1. Configuring EIGRP for IP networks

2. EIGRP and the bandwidth command and The bandwidth-percent command

3. Configuring EIGRP for IPX networks

4. Controlling SAP updates

5. Summarizing EIGRP routes for IP
57

6. Variance

For IP networks
1. router(config)# router eigrp autonomoussystem-number
AS much match all router inside AS

2. router(config-router)# network network-number

Network number only for connected network

3. router(config-if)# bandwidth kilobits

Serial interface link use (if not Router take default)

router(config-if)# eigrp log-neighbor-changes

Enables the logging of neighbor adjacency changes
58

For IP networks

59

EIGRP Bandwidth Utilization

Specifies what percentage of bandwidth EIGRP packets will be able to utilize on this interface Uses up to 50% of the link bandwidth for EIGRP packets, by default
Used for greater EIGRP load control

60

ip bandwidth-percent eigrp as-number percent ipx bandwidth-percent eigrp appletalk eigrp-bandwidth-percent

EIGRP & Bandwidth over WAN

EIGRP supports different WAN links
Point-to-point
NBMA
Multipoint Point-to-point

EIGRP configurations must address

Bandwidth utilization
Overhead traffic associated with router operation
61

Bandwidth over WAN Interfaces

Bandwidth utilization over point-to-point subinterfaces using Frame Relay

Treats bandwidth as T1, by default Best practice is to manually configure bandwidth as the CIR of the PVC

62

Bandwidth over WAN Interfaces

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
63

Bandwidth over WAN Interfaces

Each PVC might have a different CIR, this might create an EIGRP packet pacing problem
Multipoint interfaces:
Convert to point-to-point configuration, or

Manually configure bandwidth = (lowest CIR x number of PVCs)

64

EIGRP WAN Configuration Pure Multipoint

C interface serial 0 encap frame-relay bandwidth 224

S0
T1 CIR 56

CIR 56

Frame Relay
CIR 56

CIR 56

E F G

All VCs share bandwidth evenly: 4 x 56 = 224

65

EIGRP WAN Configuration Hybrid Multipoint

C interface serial 0 encap frame-relay bandwidth 224

S0
T1

Frame Relay

CIR 256 BW 224

CIR 256 BW 224

CIR 56 BW 56

CIR 256 BW 224

H

E F G

Lowest CIR x # of VC: 56 x 4 = 224

66

EIGRP WAN Configuration Hybrid Multipoint (Preferred)

C
interface serial 0.1 multipoint bandwidth 768 interface serial 0.2 point-to-point bandwidth 56
S0.2

S0
T1

Frame Relay

CIR 256 BW 256

S0.1

CIR 256 BW 256 E F

CIR 56 BW 56

CIR 256 BW 256

H G

Configure lowest CIR VC as point-to-point, specify BW = CIR Configure higher CIR VCs as multipoint, combine CIRs
67

EIGRP WAN Configuration Pure Point-to-Point

C
interface serial 0.1 point-to-point bandwidth 25 ip bandwidth-percent eigrp 63 110 --interface serial 0.10 point-to-point bandwidth 25 ip bandwidth-percent eigrp 63 110

Hub and Spoke with 10x VCs

S0
256

Frame Relay

CIR 56 BW 25
CIR 56 BW 25

CIR 56 BW 25

CIR 56 BW 25
H interface serial 0 bandwidth 25 ip bandwidth-percent eigrp 63 110

E F G

Configure each VC as point-to-point, specify BW = 1/10 of link capacity Increase EIGRP utilization to 50% of actual VC capacity
68

For IPX networks & SAP update

69

For IPX networks & SAP update

Enable EIGRP for IPX, perform the following steps:
Enable IPX routing: router(config)# ipx routing Define EIGRP as the IPX routing protocol: router(config-router)# ipx router {eigrp asnumber | rip} Indicate networks: router(config-ipx-router)# network network-number (Optional) If IPX RIP is also operating on the router, remove RIP:router(config-ipx-router)# no network network-number

70

For IPX networks & SAP update

By Default, Cisco routers redistribute IPX RIP routes IPX EIGRP routes. RIP route to a destination with a hop count of 1 is always preferred over an EIGRP route with a hop count of 1 (exception if both the RIP and EIGRP updates were received from the same router)

Controlling IPX RIP

RouterRouter: EIGRP
71

LAN Router:RIP(default)

For IPX networks & SAP update

To reduce the amount of bandwidth required to send SAP updates periodically:

router(config-if)#ipx sapincremental eigrp as-number [rsup-only] rsup-only:
Indicate on this interface the system uses EIGRP to carry reliable SAP update information only. RIP routing updates are used EIGRP routing updates are ignored
72

Summarizing EIGRP routes Auto

EIGRP automatically summarizes routes at the classful If you have discontiguous subnetworks Autosummarizes need disable

73

Summarizing EIGRP routes Manual

router(config-if)#ip summary-address eigrp autonomous-system-number ip-address mask administrative-distance Example:
RTC(config)#router eigrp 2446 RTC(config-router)#no auto-summary RTC(config-router)#exit RTC(config)#interface serial0 RTC(config-if)#ip summary-address eigrp 2446 2.1.0.0 255.255.0.0

74

EIGRP Load Balancing

Routes with metric equal to the minimum metric will be installed in the routing table (equal-cost load balancing)
Up to six entries in the routing table for the same destination
Number of entries is configurable Default is four
75

EIGRP Unequal-Cost Load Balancing

EIGRP offers unequal-cost load balancing
variance command

Variance allows the router to include routes with a metric smaller than multiplier times the minimum metric route to that destination
Multiplier is the number specified by the variance command
76

Variance Example
20 10 E
(config)#

10 10 A 25 Network Z

C
20 D

variance 2

Router E will choose Router C to get to Network Z because FD = 20 With variance of 2, Router E will also choose Router B to get to Network Z (20 + 10) < (2 x [FD]) Router D will not be used to get to Network Z (45 > 40)
77

Verify EIGRP with Show command

Command Show ip eigrp neighbors [int type] [details] Show ip eigrp interfaces [int type] [as-number][details] Show ip eigrp topology [as-number][ [ip-add] mask ] Show ip eigrp topology [active | pending | zero-successor] Show ip eigrp all-links Show ip eigrp traffic [as-number] Description Display EIGRP neighbor table Displays EIGRP statistics and status information Display the EIGRP topology table, use the show ip eigrp topology EXEC command. Also used to determine DUAL states & debug possible DUAL problems. Depending on keyword is used. Display all routes in the topology table that are either active, pending or without successor Display all routes not just FC in EIGRP topology Display the number of EIGRP packets send and received.

78

Verify EIGRP with Debug command

Command
Debug eigrp fsm

Description
This command helps you observe EIGRP FS activity and to determine whether route updates are being installed and deleted by the routing process Displays all types of EIGRP packets, both sent and received Displays the EIGRP neighbor interaction Displays advertisements and changes EIGRP makes to the routing table Displays a brief report of the EIGRP routing activity Displays the different categories of EIGRP activity, including route calculations

debug eigrp packet debug eigrp neighbor debug ip eigrp route debug ip eigrp summary show ip eigrp events

79

Summary
EIGRP, a routing protocol developed by Cisco advanced distance-vector routing protocol that uses the DUAL algorithm

Major feature:
Rapid convergence converges rapidly based-on DUAL

Reduced bandwidth usage summarizes routes, performs incremental updates

Multiple network-layer support IP, IPX, and AppleTalk traffic

80

Remember all EIGRP Feature

1. Advanced distance vector 2. 100% loop free 3. Fast convergence 4. Easy configuration 5. Less network design constraints than OSPF 6. Incremental updates 7. Supports VLSM and discontiguous networks 8. Classless routing 9. Compatible with existing IGRP networks 10. Protocol independent (supports IP, IPX and AppleTalk)
81

EIGRP Scalability Rules

EIGRP is a very scalable routing protocol if proper design methods are used:
Good allocation of address space: Each region should have a contiguous address space so route summarization is possible Have a tiered network design model

82

Nonscalable Network Example

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

2.2.3.0 1.1.2.0

1.1.3.0 2.2.2.0

Token Ring

3.3.4.0 3.3.3.0

Bad addressing scheme

Subnets are everywhere throughout entire network
83

Queries not bounded

Scalable Network Example

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.3.0 1.1.2.0

2.2.3.0

Token Ring

3.3.4.0 3.3.3.0

Readdress the network

2.2.2.0

Each region has its own block of addresses

84

Queries bounded by using ip summary-address eigrp command

Tiered Network Design

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

Summarized Routes
Other Regions

Regional Office
Summarized Routes

Summarized Routes

Remote Office
85

More EIGRP Scalability Rules

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

86

Question/Answer
1. How are IGRP and EIGRP different in their metric calculation? 2. Why are EIGRP routing updates described as reliable? 3. What does it mean when a route is marked as a feasible successor?

4. What is the recommended practice for configuring bandwidth on a Frame Relay point-to-point subinterface?
87

Question/Answer
Matching terms with statements. Place the letter of the description in front of the term that the statement describes. A statement may describe several terms.
_____ 1. Successor _____ 2. FS _____ 3. Hello _____ 4. Topology table _____ 5. IP _____ 6. Update _____ 7. AppleTalk A) A network protocol that EIGRP supports B) A table that contains feasible successor information C) Administrative distance determines routing information that is included in this table. D) A neighbor router that has the best path to a destination E) A neighbor router that has the best alternative path to a destination F) An algorithm used by EIGRP that assures fast convergence G) A multicast packet used to discover neighbors

_____ 8. Routing table

88

H) A packet sent by EIGRP routers when a new neighbor is discovered and when a change occurs
_____ 10. IPX

_____ 9. DUAL