CCNA Semester 3 Chapter 03 EIGRP

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 Verify EIGRP operations
2

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
3

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

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
6

EIGRP and IGRP compatibility

Metric

256 Load Default: k1 = 1, k2 = 0, k3 = 1, k4 = 0, k5 = 0. Metric = Bandwidth + Delay 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

k1xBW +

k2xBW

+ k3xDelay

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 Neighbor TableIPX Destination Next Hop Neighbor Next Hop DestinationTableIP Router Next-Hop Router Interface Router

EIGRP concepts and terminology

Neighbor TableAppleTalk Neighbor TableIPX Destination Next Hop Neighbor Next Hop DestinationTableIP Router Next-Hop Router Interface Router Topology TableAppleTalk Destination TableIPX Topology 1 Next Router 1/Cost Topology Destination 1TableIP Destination 1Next Router 1/Cost Next Router 1/Cost Destination Destination 11 Next Router 1/Cost

EIGRP concepts and terminology

Neighbor TableAppleTalk Neighbor TableIPX Destination Next Hop Neighbor Next Hop DestinationTableIP Router Next-Hop Router Interface Router Topology TableAppleTalk Destination TableIPX Topology 1 Next Router 1/Cost Topology Destination 1TableIP Destination 1Next Router 1/Cost Next Router 1/Cost Destination Destination 11 Next Router 1/Cost Routing TableAppleTalk Routing TableIPX Destination 1 Next Router X Routing 1 Next Router X Destination 1 Next Router X DestinationTableIP Destination Next Router X Destination 1 1
1

EIGRP concepts and terminology

Neighbor TableAppleTalk Neighbor TableIPX Destination Next Hop Neighbor Next Hop DestinationTableIP Router Next-Hop Router Interface Router Topology TableAppleTalk Destination TableIPX Topology 1 Next Router 1/Cost Topology Destination 1TableIP Destination 1Next Router 1/Cost Next Router 1/Cost Destination Successor Destination 11 Next Router 1/Cost Routing TableAppleTalk Routing TableIPX Destination 1 Next Router X Routing 1 Next Router X Destination 1 Next Router X DestinationTableIP Destination Next Router Destination 1 1 Successor X
1

EIGRP concepts and terminology

Neighbor TableAppleTalk Neighbor TableIPX Destination Next Hop Neighbor Next Hop DestinationTableIP Router Next-Hop Router Interface Router Topology TableAppleTalk Destination TableIPX Topology 1 Next Router 1/Cost Topology Destination 1TableIP Destination 1Next Router 1/Cost Next Router 1/Cost Destination Successor Destination 11 Next Router 1/Cost Destination 1 Feasible Successor Routing TableAppleTalk Routing TableIPX Destination 1 Next Router X Routing 1 Next Router X Destination 1 Next Router X DestinationTableIP Destination Next Router Destination 1 1 Successor X
1

EIGRP Successors and Feasible successor

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

RTB RT A 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 RT A 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 RTB is successor to Net Z RTX is feasible successor to Net Z RT A Network Z RTC RT X RTY I have a route to Z, with a metric of 6

RTB

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 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
1

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

Neighbor discovery and recovery

EIGRP routers establish adjacencies with neighbor routers by using small hello packets On IP networks, EIGRP routers send hellos to the multicast IP address 224.0.0.10
RTA#show ip eigrp neighbors IP-EIGRP neighbors for process 400 H Address Interface Hold Uptime SRTT (sec) (ms) 13 02:15:30 1 172.68.2.2 To0 13 02:15:30 8 0 172.68.16.2 Se1 10 02:38:29 10 02:38:29 29 RTO Q Seq Cnt Num 200 0 9 200 0 6

Bandwidth T1 or less Greater than T1

1

Example link

Default hello interval

Default hold times 180 seconds 15 seconds

Multipoint frame 60 seconds relay, ISDN Ethernet, T1 5 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
2

Reliable Transport Protocol (RTP)

EIGRP uses RTP as its own proprietary transportlayer 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.
2

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: Hello: Establish neighbor relationships ACK: Acknowledgement of a reliable packet
2

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

2

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)

EIGRP Successor

EIGRP Feasible Successor

Feasible Successor Route

No EIGRP Feasible Successor

DUAL Example (Start)

DUAL Example: Link Goes Down

DUAL Example: D Sends Queries

DUAL Example: E Sends Queries

DUAL Example: C Replies

DUAL Example: E Replies

DUAL Example: Convergence

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

Stuck in Active (SIA)

Queries Replies
Router B

Router C

Router D

Router A

X
s s s

In some cases, it can take too long for the query to be answered. When this happens, the router that issued the query gives up and resets its neighbor relationship with the router that didnt answer. The most basic situation where this occurs is when it simply takes too long for a query to reach the other end of the network and a reply to travel back.

Stuck in Active (SIA)

Typically, SIAs results when a router cannot answer a query because:
the router is too busy to answer the query (generally high cpu utilization) the router cannot allocate the memory to process the query or build the reply packet the circuit between the two routers is not good (packet loss) unidirectional links (a link on which traffic can only flow in one direction due to a failure)

CONFIGURING EIGRP

For IP networks

1.router(config)# router eigrp autonomous-systemnumber

AS much match all router inside AS

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

Network number only for connected network

1.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
4

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
4

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

4

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

Verify EIGRP with Show command

Command Show ip eigrp neighbors [int type] [details] Show ip eigrp interfaces [int type] [as-number] [details] Description Display EIGRP neighbor table Displays EIGRP statistics and status information

Show ip eigrp topology [as- Display the EIGRP topology table, use the show ip number][ [ip-add] mask ] eigrp topology EXEC command. Also used to determine DUAL states & debug possible DUAL problems. Show ip eigrp topology [active | pending | zerosuccessor] Show ip eigrp all-links 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

Show ip eigrp traffic [as- Display the number of EIGRP packets send and number] received.
4

Verify EIGRP with Debug command

Command Debug eigrp fsm Description 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

Routing protocol troubleshooting process

Routing protocol troubleshooting process (cont.)

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. The outgoing interface is down. The advertised network interface is down.
5

Use show ip protocols command

Use debug ip rip command

3d08h: RIP: bad version 128 from 160.89.80.43

5

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

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

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 with discontiguous subnets. Use no auto-summary to disable automatic network summarization.
5

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 neighbors is an expired holddown timer.
RTA#show ip eigrp neighbors IP-EIGRP neighbors for process 400 H Address Interface Hold Uptime (sec) 1 172.68.2.2 To0 13 13 02:15:30 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
6

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.

Summary
Cisco released 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
6

Protocol-dependent modules

Q&A