Scribd
Upload
24 views16 pages

EIGRP

EIGRP is an advanced distance-vector routing protocol that provides fast convergence, supports VLSM and discontiguous subnets, and uses multicast packets. It uses hello packets for neighbor discovery, Reliable Transport Protocol for reliable delivery, and DUAL algorithm to select the lowest cost loop-free paths. EIGRP supports multiple network layer protocols using protocol-dependent modules. It stores routing information in neighbor, topology, and routing tables, with the routing table containing the successor route to each destination. By default, EIGRP metric is calculated based on bandwidth and delay, and is backward compatible with IGRP metrics.

Uploaded by

Indika Rodrigo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
24 views16 pages

EIGRP

EIGRP is an advanced distance-vector routing protocol that provides fast convergence, supports VLSM and discontiguous subnets, and uses multicast packets. It uses hello packets for neighbor discovery, Reliable Transport Protocol for reliable delivery, and DUAL algorithm to select the lowest cost loop-free paths. EIGRP supports multiple network layer protocols using protocol-dependent modules. It stores routing information in neighbor, topology, and routing tables, with the routing table containing the successor route to each destination. By default, EIGRP metric is calculated based on bandwidth and delay, and is backward compatible with IGRP metrics.

Uploaded by

Indika Rodrigo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 16

Configuring EIGRP

Introducing EIGRP

BSCI v3.0—2-1
EIGRP Features

• Advanced distance vector • Flexible network design


• Fast convergence • Multicast and unicast instead of broadcast
• Support for VLSM and address
discontiguous subnets • Manual summarization at any point
• Partial updates • 100% loop-free classless routing
• Support for multiple network-layer • Easy configuration for WANs and LANs
protocols • Load balancing across equal-
and unequal-cost pathways
EIGRP Key Technologies

• Neighbor discovery/recovery
– Uses hello packets between neighbors
• Reliable Transport Protocol (RTP)
– Guaranteed, ordered delivery of EIGRP packets to all neighbors
• DUAL finite-state machine
– Selects lowest-cost, loop free, paths to each destination
• Protocol-dependent modules (PDMs)
– EIGRP supports IP, AppleTalk, and Novell NetWare.
– Each protocol has its own EIGRP module and operates
independently of any of the others that may be running.
EIGRP Neighbor Table
DUAL Terminology

• Selects lowest-cost, loop-free paths to each destination


• AD = cost between the next-hop router and the destination
• FD = cost from local router = AD of next-hop router + cost
between the local router and the next-hop router
• Lowest-cost = lowest FD
• (Current) successor = next-hop router with lowest-cost, loop
free path
• Feasible successor = backup router with loop-free path (AD
of feasible successor must be less than FD of current
successor route)
EIGRP Topology Table
EIGRP IP Routing Table
Example: EIGRP Tables
Router C Tables:
EIGRP Packets

• Hello: Establish neighbor relationships.


• Update: Send routing updates.
• Query: Ask neighbors about routing information.
• Reply: Respond to query about routing information.
• ACK: Acknowledge a reliable packet.
Initial Route Discovery
EIGRP Metric

• Same metric components as IGRP:


– Bandwidth
– Delay
– Reliability
– Loading
– MTU
• EIGRP metric is IGRP metric multiplied by 256.
EIGRP Metric Calculation

• By default, EIGRP metric:


Metric = bandwidth (slowest link) + delay (sum of delays)
• Delay = sum of the delays in the path, in tens of microseconds,
multiplied by 256
• Bandwidth = [107 / (minimum bandwidth link along the path, in kilobits
per second)] * 256
• Formula with default K values (K1 = 1, K2 = 0, K3 = 1, K4 = 0, K5 = 0):
Metric = [K1 * BW + ((K2 * BW) / (256 – load)) + K3 * delay]
• If K5 not equal to 0:
Metric = metric * [K5 / (reliability + K4)]:
EIGRP Metrics Calculation Example

ABCD Least bandwidth 64 kbps Total delay 6,000

AXYZD Least bandwidth 256 kbps Total delay 8,000


• Delay is the sum of all the delays of the links along the paths:
Delay = [delay in tens of microseconds] x 256
• Bandwidth is the lowest bandwidth of the links along the paths:
Bandwidth = [10,000,000 / (bandwidth in kbps)] x 256
EIGRP Metrics Are Backward-Compatible
with IGRP
Summary

• EIGRP capabilities include fast convergence and support for VLSM,


partial updates, and multiple network layer protocols.
• EIGRP key technologies are neighbor discovery/recovery, RTP,
DUAL finite-state machine, and PDMs.
• EIGRP uses three tables: neighbor table, topology table, and
routing table. The routing table contains the best route to each
destination, called the successor route. A feasible successor route
is a backup route to a destination; it is kept in the topology table.
• EIGRP uses the same metric components as IGRP: delay,
bandwidth, reliability, load, and MTU.
• By default, EIGRP metric equals bandwidth (slowest link) plus delay

(sum of delays).
• EIGRP metrics are backward-compatible with IGRP; the EIGRP-
equivalent metric is the IGRP metric multiplied by 256.

You might also like