Luis de Leon Sastre S07001907

Networking 3

GENERAL INTRODUCTION

EIGRP routing protocol is a proprietary Cisco based on IGRP.

EIGRP supports CIDR and VLSM, which allows network designers to maximize the
addressing space. Compared with IGRP, which is a routing protocol with class, EIGRP
offers convergence times faster, better scalability and senior management of routing
loops.

In addition, it can replace EIGRP Maintenance Protocol routing tables (RTMP)

AppleTalk and Novell RIP. EIGRP runs on IPX and AppleTalk networks with powerful
efficiency.

Often described EIGRP routing protocol as a hybrid that delivers the best of the
distance-vector algorithms and state liaison.

EIGRP is an advanced routing protocol is based on the characteristics normally

associated with the protocols of the state liaison. Some of the best features of OSPF, as
partial updates and detection of neighbors, are used in a similar way with EIGRP.
However, EIGRP is easier to set up than OSPF.

EIGRP is an ideal choice for large networks built primarily with Cisco routers.

We understand the tasks of setting common EIGRP. Especially the way it interacts with
EIGRP adjacent routers, the way it calculates the primary and backup routes and its
response to the flaws in the known routes to a destination in particular.

A network consists of multiple devices, protocols and media that allow data
communication. When a network component is not working properly, it can affect the
entire network. In any event, network administrators must identify and diagnose
problems quickly when they occur. Here are some of the reasons that there are problems
in the network.

* Commands are entered incorrectly

* To be built or placed access lists incorrectly
* The router, switch or other network devices are configured incorrectly
* The basic connections are of poor quality

A network administrator must make the diagnosis of faults in a methodical, through a

general model for resolution of problems. It is often useful to check whether there are
problems with the physical layer first, then go climb through the layers in an organized
manner. Although this module focuses on how to diagnose faults of Layer 3 protocols,
it is important to diagnose and eliminate existing problems in the lower
.

1
Luis de Leon Sastre S07001907
Networking 3

EIGPR VS IGPR VS OSPF

The routing protocol gateway internal improvements (Enchaced Interior Gateway

Routing Protocol, EIGRP) is an improved version of the original IGRP protocol
developed by Cisco Systems. EIGRP combines the advantages of the protocols state
liaison with the protocols for Distance Vector.

EIGRP maintains the same distance vector algorithm and information metrics original
IGRP, however, have significantly improved the time of convergence and aspects
relating to scalability. EIGRP and IGRP calculations using different metrics. Multiply
EIGRP metric IGRP by a factor of 256. This occurs because EIGRP uses a metric that is
32 bits long, and IGRP uses a 24-bit metrics. The information EIGRP can multiply or
divide by 256 for an easy exchange with IGRP. IGRP has a number of jumps up to 255.
The ceiling for the number of jumps is EIGRP 224. This is more than enough to support
large networks.

EIGRP offers features not found in its predecessor, such as support for IGRP VLSM
and summaries of arbitrary path. In addition, EIGRP offers features that are in protocols
such as OSPF, as partial incremental updates and a time of convergence reduced. As in
the case of protocol IGRP, EIGRP publishes the information in the routing table only to
neighboring routers.

EIGRP vs. Traditional Distance Vector (RIP or IGRP)

EIGRP has the following advantages over either RIP or IGRP:

 It supports classless interdomain routing (CIDR) and variable-length subnet

masks (VLSM).
 It sends routing updates only when network topology changes -- instead of its
entire routing table at regular intervals.

 Its convergence is very fast -- often instantaneous due to the topology database.

 Its algorithm offers complete protection from routing loops (well, almost).

EIGRP vs. OSPF

EIGRP offers the following benefits over OSPF:

 It is much simpler to install and maintain (keep in mind though, EIGRP has its
own issues with large networks, and requires a degree of expertise. However, it
is not nearly as difficult as OSPF).
 It is less CPU intensive.

 It supports IPX and AppleTalk. OSPF supports only IP.

2
Luis de Leon Sastre S07001907
Networking 3
 EIGRP supports unequal-cost load balancing.

 EIGRP (with properly designed summarization) does not propagate topology

changes to every router in its area. This can save valuable bandwidth, especially
in unstable or frequently fluctuating environments. Even with summarization,
OSPF propagates network changes to all routers in an area.

EIGRP is not perfect, though; it does have the following weaknesses:

 It is Cisco proprietary -- it does not interoperate with other vendors' devices.

This, of course, is the big one. If you are working in a mixed environment,
EIGRP doesn't make as much sense.
 In a poorly designed network, EIGRP's stuck-in-active (SIA) mechanism can
wreak havoc. In particular, one malfunctioning router can trigger a chain
reaction that brings an entire network to its knees. OSPF handles the "one bad
router" problem much better. However, if EIGRP is properly designed, this
problem can be overcome.

Protocol RIP IGRP EIGRP IS-IS OSPF

Vector distance X X X
Estate liaison X X
Summary X X X X
automátic route
Summary manual X X X X X
route
Support VLSM X X X
Owners of cisco X X
Convergencia Low Low Faster Faster Faster
Distance 120 100 90 115 110
administrative
Time to update and 30 90
upper
Métrics jumps Compuesta compuesta cost cost

TERMINOLOGY EIGRP

The routers maintain EIGRP topology and route information available in RAM, so they
can react quickly to changes. Like OSPF, EIGRP saves this information in several
tables and databases.
Routes receive a state and can be labeled to provide additional information useful

EIGRP maintains the following three tables:

3
Luis de Leon Sastre S07001907
Networking 3

• Table of neighbors
• Table of topology
• Routing Table

Here comes explanation of the tables

 Neighbor Table
Each router EIGRP maintains a neighbor table that enumerates the adjacent
routers. This table can be compared with the data base of adjacency utilized by
OSPF. Neighbors table per each protocol that EIGRP admits.

 Topology Table
Topology table is made out of all of the routing tables EIGRP received of the
neighbors. EIGRP takes the information provided in neighbors table and the
topology table calculates the routes of less cost toward each destination. EIGRP
traces this information in order to the routers may identify and commuting to
alternative routes quickly. The information that the router receives of the
neighbors is used to determine the successor's route, that it is the term utilized to
identify the principal or the best route. This information also is introduced to the
topology table. The EIGRP routers maintain a topology table per each protocol
configured of net ( like IP, IPv6 or IPX ). Routing table maintains routes that they
learn from dynamic aspect.

 Routing table
The routing table EIGRP contains the best routes toward a destination network.
This information is recovered of the topology table. The EIGRP routers maintain
a routing table for each network protocol.

HOW IT WORKS EIGPR PROTOCOL OF ENROUTING

The routers neighbors are discovered through a simple protocol Hello exchanged by the
routers belonging to the same physical network by establishing surroundings. Hello
packets used to exchange greetings multicast address 224.0.0.10. Once discovered
routers neighbors, EIGRP uses a reliable transport protocol for ensuring proper and
orderly delivery of information and updates to the routing table. A router makes
tracking their own routes connected and, in addition, all routes Public routers
neighbours. Based on this information, EIGRP can select effective and fast route to a
destination lower costs and ensure that the route is not part of a routing loop this route
will be chosen as the main call Successor. By storing information routing routers
neighbors, the algorithm can determine a route faster replacement or a possible
successor in the event of a link failure, or any other event for modifying the topology.
The greeting and routing information EIGRP are transported by the transport protocol
EIGRP. The EIGRP transport protocol defines a reliable publication acknowledged and
the request to ensure that the greeting and information routing properly distributed to all
neighboring routers.

4
Luis de Leon Sastre S07001907
Networking 3
When there are changes topologies EIRP uses DUAL (algorithm update diffuse) for a
rapid convergence between routers, they store their own knucklebones routing with
alternative routes (Successor feasible), the absence of any alternative route EIGRP
resorted to their routers neighbors to get information about this alternative path.

SINTAXIS OF THE CONFIGURACION OF EIGRP

router(config)#router eigrp 240

router(config-router)#network network-number
router(config-if)#bandwidth kilobits
router(config-router)#eigrp log-neighbor-changes

Router eigrp 240 specified as a EIGRP routing protocol for the system autonomo 240,
this ranges from 1 to 65535

Network specific networks directly connected to the router which will be announced by
EIGRP

Bandwidth the process of routing the command bandwidth used to calculate the metric
and it is desirable to configure the command to coincide with the line speed of the
interface.

Log-neighbor-changes enabled the registration of the changes adjacency neighborhood

to monitor the stability of the routing system and to help detect problems.

In current versions of IOS EIGRP added to the command network for wilcard this
protocol enables the identification of subnets,
router(config)#router eigrp 240
router(config-router)#network 192.168.16.0 0.0.0.255

5
Luis de Leon Sastre S07001907
Networking 3

CALCULATION OF THE METRICAS EIGRP

Cálculo de métricas: IGRP
/
( with the followings default values ):

Constant Value EIGRP scale of the metrics for a IGRP

K1 1 factor of 256. This is because of EIGRP uses a metrics

K2 0 32 bits in length, and IGRP uses a 24-bit metrics..

K3 1 Multiplying or divided by 256, can EIGRP

K4 0 easily exchange information by IGRP.

K5 0

Note: When K2, K4 and K5 are zero is reduced to the formula

metric = bandwidth + delay

metric = [K1 * bandwidth + (K2 * bandwidth) / (256 *

load) + (K3 * delay)] * [K5/(reliability + K4)]

• IGRP has a maximum number of 255 jumps. EIGRP has a ceiling

Of 224. This is more than adequate for larger networks, correctly
Designed.

• We set the bandwidth and delay, and the router dynamically calculates load and
reliability.

The four values can be examined using show interface

6
Luis de Leon Sastre S07001907
Networking 3
NAT_Boundary>show interfaces s1/0

Serial1/0 is up, line protocol is up

Hardware is QUICC Serial

Description: Out to VERIO

Internet address is 207.21.113.186/30

MTU 1500 bytes, BW 1544 Kbit, DLY 20000 usec,

reliability 255/255, txload 33/255, rxload 246/255

Encapsulation PPP, loopback not set

Keepalive set (10 sec)

TECHNOLOGIES THAT ARE PART OF EIGRP

Neighbor discovery and recovery

Reliable Transport Protocol (RTP)
DUAL finite-state machine (FSM)
PDM (Protocol-dependent Module

CONCLUSION EIGRP IN FIVE PHASES

1) PHASE

• Routers EIGRP down adjacent routers with neighbors using small packages hello.

• A router EIGRP assumes that, while receiving packages hello! Known to neighbors,
those neighbors (and their routes) remain accessible.

2) PHASE

• EIGRP is independent of protocols; say this is not based on TCP / IP routing

information for interchange of how the RIP, IGRP, and OSPF do.

• To get to be independent of IP uses its own transport protocol, to ensure the delivery
of info. Of routing: RTP

7
Luis de Leon Sastre S07001907
Networking 3

• Supports reliable and unreliable.

• Supports unicasting y multicasting

3) PHASE
DUAL FSM

• The centerpiece of EIGRP is DUAL mechanism for calculating EIGRP route

• The full name of this technology is DUAL finite state machine (FSM). This
mechanism contains all the logic used for calculate and compare routes in a network

4) PHASE
¿Qué es un FSM?

• A WSF is an abstract machine, not a mechanical device.

• FSMs defines a set of possible states that can be examined, events that caused those
states, and that events are the result of those states.

• FSMS designers use to describe as a device, computer program or algorithm routing

react to certain events of entry.

5) PHASE
DUAL FSM
• DUAL select alternative routes quickly using information from tables EIGRP
.
• If a link fails, DUAL looking for a possible successor to its neighbour and tables
topology.

• A successor is a route which is currently used for shipping packages

• It is the lowest cost route to the destination, and not part of a loop.

• Heirs feasible (Feasible successors) are routes that represent the following routes
lowest cost to the destination without introducing routing loops.

• Routes feasible successor can be used in case of failure in the existing route; packets
to the destination network are immediately sent using the successor feasible, which at
this point reached the status of successor.

8
Luis de Leon Sastre S07001907
Networking 3

SUCCESSORS
DUAL FSM
• A router sees his successors feasible as neighbors who are down stream, or closest to
the same destination. If something goes wrong with the successor DUAL quickly
identifies a successor of the table topology feasible, and install a new route to the
destination.

• If there is no viable successor to the destination, the route DUAL placed in the active
state. The table entries topology can be in one of two states: active or passive. A passive
route is one that is stable and available for use. An active route is a path in the process
of being reprocessed by DUAL. Reprocessing happens if one route becomes
unavailable, and can not find successors DUAL feasible

.• The router should ask their neighbors to help find a new path, free from loops, the
destination. It requires routers neighbors respond to this question. If a neighbor is a
path, reply with information on the successor (s). If not, the neighbor notifies the sender
that it does not have a route to the destination given.

CONVERGENCY USING EIGRP

(2)

Neighbor Computed Reported

Cost to Net 24 Distance to Net 24

RTY 31 21
RTZ 230 220
RTX 40 30

• RTY is a successor with a cost calculated of 31.

“31” is the Feasible Distance (FD).
1) RTX RD (30) is lower than FD (31).
2) RTX CC (40) is lower than RTZ CC (230)
3) Result of 1) y 2) coincide RTX Successor Feasible

• Since RTX is a "feasible successor," is introduced in the routing table immediately (no
calculation processing).

9
Luis de Leon Sastre S07001907
Networking 3
• RTZ is not a feasible successor yet. Its RD (220) is larger than the FD (31) to Net 24.
Before this route can be introduced, a net 24 route must be made
Prior to active state and reprocessed since the FD can only change during a passive to
active transition.

RTA PROBLEM
6)
• RTA can not find successors feasible transition to Active Passive (net 24), and
consults with neighbors on the network.

• When the network is in 24 Active restarts FD, which allows accept RTZ.

CONFIGURACION EIGRP
Configuración
EIGRP
RTA (config) # command, router eigrp 123 EIGRP configured with a number of SA
123.
Eigrp log-neighbor-changes in the case of the first configuration EIGRP. Without this
command, the information will not be recorded neighboring criticism (console,, syslog,
etc.). We need this information to locate nearby faults.
Command network to establish networks directly connected
Eigrp 123 Router
RTA (router config) # eigrp log-neighbor-changes
RTA (router config) # network 1.0.0.0

CONFIGURATION OPCIONAL EIGRP

Configuración
EIGRP optional
Optional Command Interface:
RTA (config-if) # ip bandwidth-percent eigrp 123 40
By default, EIGRP not using more than 50% of band width of the links to the hellos,
updates, queries, and acknowledgments. This command sets the example for EIGRP in
the HS 123 is not used more than 40% (eg for cases with low-speed links).

SOME COMMANDS FOR THE VERIFICATION AND CONTROL EIGRP

ARE:

show ip route
Show routing table

show ip protocols
Show protocol parametres

10
Luis de Leon Sastre S07001907
Networking 3
show ip eigrp neighbors
Show neigbour information of EIGRP

show ip eigrp topology

Show topology tableo f EIGRP

debug ip eigrp
Show package information.

REFERENCES

[1]http://www.cisco.com/en/US/tech/tk365/
technologies_white_paper09186a0080094cb7.shtml#eigrpmetrics

[2] http://www.cisco.com/warp/public/103/3.html

[3] http://www.newi.ac.uk/groutv/Papers/P1.pdf

[4] http://www.cs.utexas.edu/users/EWD/ewd06xx/EWD687a.PDF

[5] http://www.cse.ucsc.edu/research/ccrg/publications/interop94.pdf

[6] http://www.rhyshaden.com/eigrp.htm

[7]www.mdh.se/netcenter/ct3790/ct3790_HT2004_p2/F2_EIGRP_CT3790.ppt

[8]http://searchnetworking.techtarget.com/sDefinition/0,,sid7_gci214442,00.html

[9] http://www.oreilly.com/catalog/iprouting/chapter/ch04.html

11