1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

44
1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI

Transcript of 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

Page 1: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

1

CCNA 3 v3.1 Module 3 EIGRP

Claes Larsen, CCAI

Page 2: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

222

Objectives

Page 3: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

333

Comparing EIGRP with IGRP

• Comparisons between EIGRP and IGRP fall into the following major categories:

Compatibility mode

Metric calculation

Hop count

Automatic protocol redistribution

Route tagging

Page 4: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

444

Using EIGRP with IGRP

Page 5: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

555

EIGRP and IGRP Metric Calculation

Page 6: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

666

Comparing show ip route for EIGRP and IGRP

Page 7: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

777

EIGRP Concepts

• The following three tables are maintained by EIGRP:

Neighbor table

Topology table

Routing table

Page 8: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

888

The EIGRP Topology Table

Page 9: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

999

EIGRP Concepts

• Every EIGRP router maintains a topology table for each configured network protocol.

• All learned routes to a destination are maintained in the topology table.

Page 10: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

101010

EIGRP Design Features

Page 11: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

111111

EIGRP Technologies

• Neighbor discovery and recovery

• Reliable Transport Protocol

• DUAL finite-state machine algorithm

• Protocol-dependent modules

• By forming adjacencies, EIGRP routers:

Dynamically learn of new routes that join their network

Identify routers that become either unreachable or inoperable

Rediscover routers that had previously been unreachable

Page 12: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

121212

Data Structure

The five EIGRP packet types are as follows:

Page 13: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

131313

Default Hello Intervals and Hold Times for EIGRP

Page 14: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

141414

EIGRP Successors and Feasible Successors

Page 15: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

151515

• Successor – Current Route

A successor is a route selected as the primary route to use to reach a destination.

Successors are the entries kept in the routing table.

• Feasible Successor - A backup route

A feasible successor is a backup route.

These routes are selected at the same time the successors are identified, but they are kept in the topology table.

Multiple feasible successors for a destination can be retained in the topology table.

Let’s see how this works!

EIGRP Terminology and Operations

Page 16: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

161616

Successors and Feasible SuccessorsFeasible distance (FD) is the minimum distance (metric) along a path to a destination network.

Reported distance (RD) 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.

A neighbor meets the feasible condition(FC) if the reported distance by the neighbor is smaller than or equal to the current feasible distance (FD) of this router. "If a neighbors metric is less than mine, then I know the neighbor doesn't have a loop going through me."

A feasible successor is a neighbor whose reported distance (RD) is less than the current feasible distance (FD). Feasible successor is one who meets the feasible condition (FC).

Your route (metric) to the network (RD to me) must be LESS than my current route (my total metric) to that same network. If your route (metric) to the network (RD to me) is LESS than my current route (my total metric), I will include you as a FEASIBLE SUCCESSOR.

If your route (metric) to the network (RD to me) is MORE than my current route (my total metric), I will NOT include you as a FEASIBLE SUCCESSOR.

Successors and Feasible Successors

Page 17: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

171717

Successors og Feasible Successors

RTA kan nå netværk 24 på tre forskellige måder. Via RTX, RTY og RTZ

Page 18: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

181818

Successors og Feasible Successors

Advertised or Destination Feasible Dist. Reported. Dist. Nabo

Netværk 24 40 30 RTX I Topolog Tabel

Netværk 24 31 21 RTY I Routing Tabel

Netværk 24 230 220 RTZ Ikke i Topologi Tabel

Page 19: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

191919

Successors og Feasible Successors

• RTY er successor med en computed cost på 31.• “31” er Feasible Distance (FD).

Page 20: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

202020

Successors og Feasible Successors

• RTX er feasible successor fordi dens RD er mindre end eller lig med FD.- RTX’s RD (30) er mindre end RTA’s FD (31) via RTY.

Page 21: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

212121

Successors og Feasible Successors

Der er tre trin når der vælges

Feasible successor:

• Bestem hvilken nabo der har en RD til net værket der er mindre end FD.

• Bestem den vej der har den mindste cost værdi på nær den der er valgt som successor.

• Vælg den vej som opfylder begge kriterier.

Page 22: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

222222

Successors og Feasible Successors

• RTZ er ikke Feasible Successor, da RD220 ikke< FD31

Page 23: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

232323

DUAL example

Page 24: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

242424

DUAL example

Page 25: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

252525

DUAL example

Page 26: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

262626

DUAL example

Page 27: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

272727

DUAL example

Page 28: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

282828

DUAL example

Page 29: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

292929

Configuring EIGRP

Page 30: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

303030

EIGRP Automatically Summarizes Based on Class

Page 31: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

313131

Manual Summarization with EIGRP

Page 32: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

323232

Verifying EIGRP

Page 33: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

333333

EIGRP debug Commands

Page 34: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

343434

Building Neighbor Tables

Page 35: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

353535

Discover Routes

Page 36: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

363636

Select Routes

• If a link goes down, DUAL looks for an alternative route path, or feasible successor, in the topology table.

• If a feasible successor is not found, the route is flagged as Active, or unusable at present.

• Query packets are sent to neighboring routers requesting topology information.

• DUAL uses this information to recalculate successor and feasible successor routes to the destination.

Page 37: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

373737

Troubleshooting Process

1. Analyze the network failure, make a clear problem statement.

2. Gather the facts needed to help isolate possible causes.

3. Consider possible problems based on the facts that have been gathered.

4. Create an action plan based on the remaining potential problems.

5. Implement the action plan, performing each step carefully while testing to see whether the symptom disappears.

6. Analyze the results to determine whether the problem has been resolved. If it has, the process is complete.

7. If the problem has not been resolved, create an action plan based on the next most likely problem in the list. Return to Step 4, change one variable at a time, and repeat the process until the problem is solved.

8. Once the actual cause of the problem is identified, try to solve it.

Page 38: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

383838

Use show Commands and TCP/IP Tools

Page 39: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

393939

Troubleshooting RIP Configuration

• Layer 1 or Layer 2 connectivity issues exist.

• VLSM subnetting is configured. VLSM subnetting cannot be used with RIPv1

• Mismatched RIPv1 and RIPv2 routing configurations exist.

• Network statements are missing or incorrectly assigned.

• The outgoing interface is down.

• The advertised network interface is down.

Page 40: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

404040

Troubleshooting IGRP Configuration

Page 41: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

414141

Troubleshooting EIGRP Configuration

Page 42: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

424242

Troubleshooting EIGRP Configuration

Page 43: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

434343

Troubleshooting OSPF Configuration

Page 44: 1 CCNA 3 v3.1 Module 3 EIGRP Claes Larsen, CCAI. 222 Objectives.

444444

Summary