CNAP Semester 3: Switching Basics and Intermediate Routing Module 3

EIGRP

Objectives
Describe the eight-step process for general troubleshooting Apply a logical process to routing troubleshooting Troubleshoot a RIP routing process using show and debug commands Troubleshoot an IGRP routing process using show and debug commands Troubleshoot an EIGRP routing process using show and debug commands Troubleshoot an OSPF routing process using show and debug commands

Table of Content
1 EIGRP Concepts 2 EIGRP Configuration 3 Troubleshooting Routing Protocols

Objectives
Describe the differences between EIGRP and IGRP Describe the key concepts, technologies, and data structures of EIGRP Understand EIGRP convergence and the basic operation of the Diffusing Update Algorithm (DUAL) Perform a basic EIGRP configuration Configure EIGRP route summarization Describe the processes used by EIGRP to build and maintain routing tables

EIGRP CONCEPTS

EIGRP Overview
Cisco released EIGRP in 1994 as a scalable, improved version of its proprietary distance vector routing protocol, IGRP. Unlike IGRP, which is a classful routing protocol, EIGRP supports CIDR and VLSM. Hybrid routing protocol Fast convergence times Multiple network-layer protocols supported Reduced bandwidth usage Easy to configure

EIGRP and IGRP compatibility

256 Load Default: k1 = 1, k2 = 0, k3 = 1, k4 = 0, k5 = 0. Metric = Bandwidth + Delay

Metric

k1xBW +

k2xBW

+ k3xDelay

EIGRP scales IGRP's metric by a factor of 256. Because EIGRP uses a metric that is 32 bits long (IGRP 24-bit): Bandwidth for IGRP = (10.000.000 / bandwidth) Bandwidth for EIGRP = (10.000.000 / bandwidth)*256 Delay for IGRP = (delay/10) Delay for EIGRP = (delay/10) * 256

EIGRP and IGRP compatibility

EIGRP 2446 IGRP 2446 192.168.1.0/24

RTA
10.1.1.0/24

RTB RTD
172.16.1.0/24

RTC

EIGRP and IGRP automatically redistribute routes between autonomous systems with same autonomous system (AS) number. IGRP has a maximum hop count of 255. EIGRP has a maximum hop count limit of 224.

EIGRP concepts and terminology

Neighbor TableAppleTalk NeighborNext Table IPX Destination Hop Neighbor Table IP Destination Next Hop Router Next-Hop Router Interface Router

EIGRP concepts and terminology

Neighbor TableAppleTalk NeighborNext Table IPX Destination Hop Neighbor Table IP Destination Next Hop Router Next-Hop Router Interface Router Topology TableAppleTalk Destination 1 Next Router 1/Cost Topology Table IPX Destination Topology1Table Router IP 1/Cost Destination 1Next Next Router 1/Cost Destination Destination 11 Next Router 1/Cost

EIGRP concepts and terminology

Neighbor TableAppleTalk NeighborNext Table IPX Destination Hop Neighbor Table IP Destination Next Hop Router Next-Hop Router Interface Router Topology TableAppleTalk Destination 1 Next Router 1/Cost Topology Table IPX Destination Topology1Table Router IP 1/Cost Destination 1Next Next Router 1/Cost Destination Destination 11 Next Router 1/Cost Routing TableAppleTalk Routing Table IPX Destination 1 Next Router X Routing Table Router IP Destination Next Router Destination 11 Next XX Destination Destination 11 Next Router X

EIGRP concepts and terminology

Neighbor TableAppleTalk NeighborNext Table IPX Destination Hop Neighbor Table IP Destination Next Hop Router Next-Hop Router Interface Router Topology TableAppleTalk Destination 1 Next Router 1/Cost Topology Table IPX Destination Topology1Table Router IP 1/Cost Destination 1Next Next Router 1/Cost Destination Successor Destination 11 Next Router 1/Cost Routing TableAppleTalk Routing Table IPX Destination 1 Next Router X Routing Table Router IP Destination Next Router Destination 11 Next XX Destination Successor Destination 11 Next Router X

EIGRP concepts and terminology

Neighbor TableAppleTalk NeighborNext Table IPX Destination Hop Neighbor Table IP Destination Next Hop Router Next-Hop Router Interface Router Topology TableAppleTalk Destination 1 Next Router 1/Cost Topology Table IPX Destination Topology1Table Router IP 1/Cost Destination 1Next Next Router 1/Cost Destination Successor Destination 11 Next Router 1/Cost Destination 1 Feasible Successor Routing TableAppleTalk Routing Table IPX Destination 1 Next Router X Routing Table Router IP Destination Next Router Destination 11 Next XX Destination Successor Destination 11 Next Router X

EIGRP Successors and Feasible successor

I have a route to Z, with a metric of 5 RTB is successor to Net Z

RTB RTA Network Z

EIGRP Successors and Feasible successor

I have a route to Z, with a metric of 5 I have a route to Z, with a metric of 5 RTB is successor to Net Z RTB is successor to Net Z

RTB RTA Network Z RTC

EIGRP Successors and Feasible successor

I have a route to Z, with a metric of 5 I have a route to Z, with a metric of 5 RTB is successor to Net Z RTC is successor to Net Z RTX is feasible successor to Net Z

RTB RTA Network Z RTC RTX RTY I have a route to Z, with a metric of 6

EIGRP design
EIGRP's advantages over simple distancevector protocols : Rapid convergence (because of use Diffusing Update Algorithm - DUAL) Efficient use of bandwidth Partial, bounded (incremental) updates Minimal consumption (tiu dng) 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

EIGRP technologies
Many new technologies are improvement in operating efficiency, speed of convergence, or functionality relative to others routing protocols. Four categories: Neighbor discovery and recovery Reliable Transport Protocol (RTP) DUAL finite-state machine algorithm Protocol-dependent modules (PDM)

Neighbor discovery and recovery

EIGRP routers establish adjacencies with neighbor routers by using small hello packets RTA#show ip eigrp neighbors IP-EIGRP neighbors for process 400 routers send On IP networks, EIGRP H Address Interface Hold Uptime SRTT RTO Q Seq hellos to the multicast (sec) IP address (ms) Cnt Num 13 13 02:15:30 1 172.68.2.2 To0 02:15:30 8 200 0 9 224.0.0.10 10 10 02:38:29 0 172.68.16.2 Se1 02:38:29 29 200 0 6
Bandwidth T1 or less Example link Multipoint frame relay, ISDN Ethernet, T1 Default hello interval 60 seconds Default hold times 180 seconds

Greater than T1

5 seconds

15 seconds

Neighbor discovery and recovery

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

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

Reliable Transport Protocol (RTP)

EIGRP uses RTP as its own proprietary transport-layer protocol, that can guarantee ordered delivery of routing information 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. With RTP, EIGRP can multicast and unicast to different peers simultaneously, which allows for maximum efficiency.

Reliable Transport Protocol (RTP)

EIGRP reliable packets are packets that requires explicit acknowledgement: Update: Send routing updates Query: Ask neighbors about routing information Reply: Response to query about routing information EIGRP unreliable packets are packets that do not require explicit acknowledgement:

DUAL finite-state machine algorithm

Diffusing Update Algorithm (DUAL) is EIGRP's route-calculation engine. Finite-state machine Tracks 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 recomputed new successor

DUAL Discovery route

A
Neighbor TableIP Router B information Router C information

C DUAL ?

Topology TableIP Router B information Router C information Successor (primary route) Feasible successor

Routing Table IP Successor (primary route)

DUAL Example (Start)

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

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

(2)

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

DUAL Example (cont. )

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

A (1) (1) B

X
(1)

(2)

(2) (1) C

E EIGRP (a) via D via C

FD RD Topology 3 (fd) 3 2 (Successor) 4 3

DUAL Example (cont. )

(a) C (a) EIGRP via B via D via E D EIGRP (a) **ACTIVE** via E via C FD RD Topology 3 (fd) 3 1 (Successor) 4 3

A (1)

D (2)

FD RD Topology -1 (fd) (q) 5 3 (q)

(2)

(1)

Q E

(1) C

E EIGRP (a) via D via C

FD RD Topology 3 (fd) 3 2 (Successor) 4 3

DUAL Example (cont. )

(a) C (a) EIGRP via B via D via E D EIGRP (a) **ACTIVE** via E via C FD RD Topology 3 (fd) 3 1 (Successor) 4 3

A (1)

D (2) (1) R

FD RD Topology -1 (fd) (q) 5 3

(2)

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

DUAL Example (cont. )

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

A (1)

D (2) (1)

FD RD Topology -1 (fd) (q) 5 3

(2)

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

DUAL Example (cont. )

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

A (1)

D R (2) (1)

FD RD Topology 5 (fd) 5 3 (Successor) 5 4 (Successor)

(2)

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

DUAL Example (Start)

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

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

(2)

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

DUAL Example (End)

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

A (1)

D (2) (1)

FD RD Topology 5 (fd) 5 3 (Successor) 5 4 (Successor)

(2)

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

Protocol-dependent modules (PDM)

Support for routed protocols, such as IP, IPX, and AppleTalk, is included in EIGRP through PDMs. Easily adapt to new or revised routed protocols, such as IPv6, by adding protocol-dependent modules. Each PDM is responsible for all functions related to its specific routed protocol. The IP-EIGRP module is responsible for the following: Sending and receiving EIGRP packets that bear IP data Notifying DUAL of new IP routing information that is received Maintaining the results of DUAL routing decisions in the IP routing table Redistributing routing information that was learned by other IP-capable routing protocols

CONFIGURING EIGRP

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

2.router(config-router)# network networknumber

Network number only for connected network

3.router(config-if)# bandwidth kilobits

Serial interface link use (if not Router take default)

For IP networks

EIGRP summarization Automatic

EIGRP SummarizationManual
Manual summarization Configurable on a 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 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

EIGRP SummarizationManual
(config-router)#

no auto-summary

Turns off autosummarization for the EIGRP process

(config-if)#

ip summary-address eigrp <as-number> <address> <mask>

Creates a summary address to be generated by this interface

Summarizing EIGRP routes Manual

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

Verify EIGRP with Show command Description 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] 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 keywork 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.

Verify EIGRP with Debug commandDescription Command

Debug eigrp fsm This command helps you observe EIGRP FS activuty 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

TROUBLESHOOTING

ROUTING PROTOCOLS

Troubleshooting Tools and Utilities

Troubleshooting RIP configuration

If the RIP routes are not being advertised, check the following: Layer 1 or Layer 2 connectivity issues exist. VLSM subnetting is configured. VLSM subnetting cannot be used with RIP v1. Mismatched RIP v1 and RIP v2 routing configurations exist. Network statements are missing or incorrectly assigned.

Use show ip protocols command

Use debug ip rip command

3d08h: RIP: bad version 128 from 160.89.80.43

Troubleshooting IGRP configuration

If IGRP does not appear to be working correctly, check the following: Layer 1 or Layer 2 connectivity issues exist. Autonomous system numbers on IGRP routers are mismatched. Network statements are missing or incorrectly assigned. The outgoing interface is down. The advertised network interface is down.

Troubleshooting IGRP configuration (cont.)

To view IGRP debugging information, use the following commands: debug ip igrp transactions [host ip address] to view IGRP transaction information debug ip igrp events [host ip address] to view routing update information To turn off debugging, use the no debug ip igrp command.

Troubleshooting EIGRP configuration

Some possible reasons why EIGRP may not be working correctly are:
Layer 1 or Layer 2 connectivity issues exist. Autonomous system numbers on EIGRP routers are mismatched. The link may be congested or down. The outgoing interface is down. The advertised network interface is down. Auto-summarization is enabled on routers

Use show ip eigrp neighbors command

One of the most common reasons for a missing neighbor is a failure on the actual link. Another possible cause of missing RTA#show ip eigrp neighbors isneighbors an expired holddown timer.
IP-EIGRP neighbors for process 400 H Address Interface Hold Uptime (sec) 13 13 02:15:30 1 172.68.2.2 To0 0 172.68.16.2 Se1 10 10 02:38:29
SRTT (ms) 8 29 RTO Q Seq Cnt Num 200 0 9 200 0 6

should normally be a value between 10 and 15.

Troubleshooting OSPF configuration

The majority of problems encountered with OSPF relate to the formation of adjacencies and the synchronization of the link-state databases. The show ip ospf neighbor command is useful for troubleshooting adjacency formation. Use the debug ip ospf events privileged EXEC command to display the following information about OSPF-related events: Adjacencies Flooding information Designated router selection Shortest path first (SPF) calculation

Troubleshooting OSPF configuration (cont.)

If a router configured for OSPF routing is not seeing an OSPF neighbor on an attached network, perform the following tasks: Verify that both routers have been configured with the same IP mask, OSPF hello interval, and OSPF dead interval. Verify that both neighbors are part of the same area.

 Cisco releasedSummary EIGRP in 1994 as a scalable, improved version of its proprietary distance vector routing protocol, IGRP. EIGRP improves the convergence properties and the operating efficiency significantly over IGRP. EIGRP includes may new technologies. These technologies fall into one of the following foure categories:
Neighbor discovery and recovery Reliable Transport Protocol DUAL finite-state machine algorithm

Q&A