World Library  
Flag as Inappropriate
Email this Article

Enhanced Interior Gateway Routing Protocol

Article Id: WHEBN0000051544
Reproduction Date:

Title: Enhanced Interior Gateway Routing Protocol  
Author: World Heritage Encyclopedia
Language: English
Subject: Routing protocol, Routing Information Protocol, Babel (protocol), Multicast address, Border Gateway Multicast Protocol
Collection: Cisco Protocols, Routing Protocols
Publisher: World Heritage Encyclopedia

Enhanced Interior Gateway Routing Protocol

Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance-vector routing protocol that is used on a computer network to help automate routing decisions and configuration. The protocol was designed by Cisco Systems as a proprietary protocol, available only on Cisco routers, but Cisco converted it to an open standard in 2013.[1]

EIGRP is used on a router to share routes with other routers within the same autonomous system. Unlike other well known routing protocols, such as RIP, EIGRP only sends incremental updates, reducing the workload on the router and the amount of data that needs to be transmitted.


  • Overview 1
  • Features 2
  • Configuration 3
    • Cisco IOS example 3.1
  • Technical details 4
    • Distance vector routing protocol 4.1
    • EIGRP composite and vector metrics 4.2
      • Routing metric 4.2.1
    • Feasible successor 4.3
    • Active and passive state 4.4
    • Feasibility condition 4.5
  • References 5
  • External links 6


The Enhanced Interior Gateway Routing Protocol replaced the Interior Gateway Routing Protocol (IGRP) in 1993.[2] One of the major reasons for this was because the design of the Internet Protocol had been changed to support classless IPv4 addresses, which IGRP could not support.[2]

Almost all routers contain a routing table that contains rules by which traffic is forwarded in a network. If the router does not contain a valid path to the destination, the traffic is discarded. EIGRP is a dynamic routing protocol by which routers automatically share route information. This eases the workload on a network administrator who does not have to configure changes to the routing table manually.

In addition to the routing table, EIGRP uses the following tables to store information:

  • Neighbor Table: The neighbor table keeps a record of the IP addresses of routers that have a direct physical connection with this router. Routers that are connected to this router indirectly, through another router are not recorded in this table as they are not considered neighbors.
  • Topology Table: The topology table stores routes that it has learned from neighbor routing tables. Unlike a routing table, the topology table does not store all routes, but only routes that have been determined by EIGRP. The topology table also records the metrics for each of the listed EIGRP routes, the feasible successor and the successors. Routes in the topology table are marked as "passive" or "active". Passive indicates that EIGRP has determined the path for the specific route and has finished processing. Active indicates that EIGRP is still trying to calculate the best path for the specific route. Routes in the topology table are not usable by the router until they are inserted into the routing table. The topology table is never used by the router to forward traffic. Routes in the topology table will not be inserted into the routing table if they are active, are a feasible successor, or have a higher administrative distance than an equivalent path.[3]

Information in the topology table may be inserted into the router's routing table and can then be used to forward traffic. If the network changes, for example, a physical link fails or is disconnected, the path will become unavailable. EIGRP is designed to detect these changes and will attempt to find a new path to the destination. The old path that is no longer available is removed from the routing table as it is no longer available. Unlike most distance vector routing protocols, EIGRP does not transmit all the data in the router's routing table when a change is made but will only transmit the changes that have been made since the routing table was last updated. EIGRP does not send its routing table periodically, but will only send routing table data when an actual change has occurred. This behavior is more inline with link-state routing protocols, thus EIGRP is mostly considered a hybrid protocol.

When a router running EIGRP is connected to another router also running EIGRP, information is exchanged between the two routers and a relationship is formed known as an adjacency. The entire routing table is exchanged between both routers at this time. After this has occurred, only differential changes are sent.


EIGRP supports the following features:[4]

  • Support for Classless Inter-Domain Routing (CIDR) and variable length subnet masking. Routes are not summarized at the classful network boundary unless auto summary is enabled.
  • Support for load balancing on parallel links between sites.
  • The ability to use different authentication passwords at different times.
  • MD5 authentication between two routers.
  • Sends topology changes, rather than sending the entire routing table when a route is changed.
  • Periodically checks if a route is available and propagates routing changes to neighboring routers if any changes have occurred.
  • Runs separate routing processes for Internet Protocol (IP), IPv6, IPX and AppleTalk through the use of protocol-dependent modules (PDMs).
  • Backwards compatibility with the IGRP routing protocols.[5]


Cisco IOS example

Example of setting up EIGRP on a Cisco IOS router for a private network. The wildcard in this example indicates a subnetwork with a maximum of 4094 hosts—it is the bitwise complement of the subnet mask The no auto-summary command prevents automatic route summarization on classful boundaries, which would otherwise result in routing loops in discontiguous networks.

 Router# configure terminal
 Router(config)# router eigrp 1
 Router(config-router)# network
 Router(config-router)# no auto-summary
 Router(config-router)# exit

Technical details

EIGRP is a distance vector routing protocol that uses the diffusing update algorithm (DUAL) (based on work from SRI International) to improve the efficiency of the protocol and to help prevent calculation errors when attempting to determine the best path to a remote network. EIGRP determines the value of the path using four metrics: bandwidth, load, delay, and reliability.[3]

EIGRP routing information exchanged to a router from another router within the same autonomous system has a default administrative distance of 90. EIGRP routing information that has come from an EIGRP-enabled router outside the autonomous system has a default administrative distance of 170.[6]

EIGRP does not operate using the Transmission Control Protocol (TCP) or the User Datagram Protocol (UDP). This means that EIGRP does not use a port number to identify traffic. Rather, EIGRP is designed to work on top of layer 3 (i.e. the IP protocol). Since EIGRP does not use TCP for communication, it implements Cisco's Reliable Transport Protocol (RTP) to ensure that EIGRP router updates are delivered to all neighbors completely.[7][8] The reliable transport protocol also contains other mechanisms to maximize efficiency and support multicasting.[4] EIGRP uses protocol number 88.[4]

Distance vector routing protocol

Cisco Systems now classifies EIGRP as a distance vector routing protocol, but it is normally said to be a hybrid routing protocol.[5][9] While EIGRP is an advanced routing protocol that combines many of the features of both link-state and distance-vector routing protocols, EIGRP's DUAL algorithm contains many features which make it more of a distance vector routing protocol than a link-state routing protocol.[9][10] Despite this, EIGRP contains many differences from most other distance-vector routing protocols, including:[11]

  • the use of explicit hello packets to discover and maintain adjacencies between routers.
  • the use of a reliable protocol to transport routing updates.
  • the use of a feasibility condition to select a loop-free path.
  • the use of diffusing computations to involve the affected part of network into computing a new shortest path.

EIGRP composite and vector metrics

EIGRP associates six different vector metrics with each route and considers only four of the vector metrics in computing the Composite metric:

 Router1# show ip eigrp topology
 IP-EIGRP topology entry for
   State is Passive, Query origin flag is 1, 1 Successor(s), FD is 40640000
   Routing Descriptor Blocks: (Serial0/0/0), from, Send flag is 0x0
       Composite metric is (40640000/128256), Route is Internal
       Vector metric:
         Minimum bandwidth is 64 Kbit
         Total delay is 25000 microseconds
         Reliability is 255/255
         Load is 197/255
         Minimum MTU is 576
         Hop count is 2
Minimum Bandwidth (in kilobits per second) along the path from router to destination network.
Number in range 1 to 255; 255 being saturated
Total Delay
Delay, in 10s of microseconds, along the path from router to destination network
Number in range 1 to 255; 255 being the most reliable
Minimum path Maximum Transmission Unit (MTU) (never used in the metric calculation)
Hop Count
Number of routers a packet passes through when routing to a remote network, used to limit the EIGRP AS. EIGRP maintains a hop count for every route, however, the hop count is not used in metric calculation. It is only verified against a predefined maximum on an EIGRP router (by default it is set to 100 and can be changed to any value between 1 and 255). Routes having a hop count higher than the maximum will be advertised as unreachable by an EIGRP router.

Routing metric

The composite routing metric calculation uses five parameters, so-called K values, K1 through K5. These act as multipliers or modifiers in the composite metric calculation. K1 is not equal to Bandwidth, etc.

By default, only total delay and minimum bandwidth are considered when EIGRP is started on a router, but an administrator can enable or disable all the K values as needed to consider the other Vector metrics.

For the purposes of comparing routes, these are combined together in a weighted formula to produce a single overall metric:

\bigg [ \bigg ( K_1 \cdot {\text{Bandwidth}}_{E} + \frac{K_2 \cdot {\text{Bandwidth}}_{E}}{256-\text{Load}} + K_3 \cdot {\text{Delay}}_{E} \bigg ) \cdot \frac {K_5}{K_4 + \text{Reliability}} \bigg ] \cdot 256

where the various constants (K_1 through K_5) can be set by the user to produce varying behaviors. An important and unintuitive fact is that if K_5 is set to zero, the term \tfrac {K_5}{K_4 + \text{Reliability}} is not used (i.e. taken as 1).

The default is for K_1 and K_3 to be set to 1, and the rest to zero, effectively reducing the above formula to ({\text{Bandwidth}}_{E} + \text{Delay}_{E}) \cdot 256.

Obviously, these constants must be set to the same value on all routers in an EIGRP system, or permanent routing loops may result. Cisco routers running EIGRP will not form an EIGRP adjacency and will complain about K-values mismatch until these values are identical on these routers.

EIGRP scales the interface Bandwidth and Delay configuration values with following calculations:

{\text{Bandwidth}}_{E} = 107 / Value of the bandwidth interface command
{\text{Delay}}_{E} = Value of the delay interface command

On Cisco routers, the interface bandwidth is a configurable static parameter expressed in kilobits per second (setting this only affects metric calculation and not actual line bandwidth). Dividing a value of 107 kbit/s (i.e. 10 Gbit/s) by the interface bandwidth statement value yields a result that is used in the weighted formula. The interface delay is a configurable static parameter expressed in tens of microseconds. EIGRP takes this value directly without scaling into the weighted formula. However, various show commands display the interface delay in microseconds. Therefore, if given a delay value in microseconds, it must first be divided by 10 before using it in the weighted formula.

IGRP uses the same basic formula for computing the overall metric, the only difference is that in IGRP, the formula does not contain the scaling factor of 256. In fact, this scaling factor was introduced as a simple means to facilitate backward compatility between EIGRP and IGRP: In IGRP, the overall metric is a 24-bit value while EIGRP uses a 32-bit value to express this metric. By multiplying a 24-bit value with the factor of 256 (effectively bit-shifting it 8 bits to the left), the value is extended into 32 bits, and vice versa. This way, redistributing information between EIGRP and IGRP involves simply dividing or multiplying the metric value by a factor of 256, which is done automatically.

Feasible successor

A feasible successor for a particular destination is a next hop router that is guaranteed not to be a part of a routing loop. This condition is verified by testing the feasibility condition.

Thus, every successor is also a feasible successor. However, in most references about EIGRP the term feasible successor is used to denote only those routes which provide a loop-free path but which are not successors (i.e. they do not provide the least distance). From this point of view, for a reachable destination there is always at least one successor, however, there might not be any feasible successors.

A feasible successor provides a working route to the same destination, although with a higher distance. At any time, a router can send a packet to a destination marked "Passive" through any of its successors or feasible successors without alerting them in the first place, and this packet will be delivered properly. Feasible successors are also recorded in the topology table.

The feasible successor effectively provides a backup route in the case that existing successors become unavailable. Also, when performing unequal-cost load-balancing (balancing the network traffic in inverse proportion to the cost of the routes), the feasible successors are used as next hops in the routing table for the load-balanced destination.

By default, the total count of successors and feasible successors for a destination stored in the routing table is limited to four. This limit can be changed in the range from 1 to 6. In more recent versions of Cisco IOS (e.g. 12.4), this range is between 1 and 16.

Active and passive state

A destination in the topology table can be marked either as passive or active. A passive state is a state when the router has identified the successor(s) for the destination. The destination changes to active state when the current successor no longer satisfies the feasibility condition and there are no feasible successors identified for that destination (i.e. no backup routes are available). The destination changes back from active to passive when the router received replies to all queries it has sent to its neighbors. Notice that if a successor stops satisfying the feasibility condition but there is at least one feasible successor available, the router will promote a feasible successor with the lowest total distance (the distance as reported by the feasible successor plus the cost of the link to this neighbor) to a new successor and the destination will remains in the passive state.

Feasibility condition

The feasibility condition is a sufficient condition for loop freedom in EIGRP-routed network. It is used to select the successors and feasible successors that are guaranteed to be on a loop-free route to a destination. Its simplified formulation is strikingly simple:

If, for a destination, a neighbor router advertises a distance that is strictly lower than our feasible distance, then this neighbor lies on a loop-free route to this destination.

or in other words,

If, for a destination, a neighbor router tells us that it is closer to the destination than we have ever been, then this neighbor lies on a loop-free route to this destination.

It is important to realize that this condition is a sufficient, not a necessary condition. That means that neighbors which satisfy this condition are guaranteed to be on a loop-free path to some destination, however, there may be also other neighbors on a loop-free path which do not satisfy this condition. However, such neighbors do not provide the shortest path to a destination, therefore, not using them does not present any significant impairment of the network functionality. These neighbors will be re-evaluated for possible usage if the router transitions to Active state for that destination.


  1. ^ Cisco Systems (2013), Enhanced Interior Gateway Routing Protocol (EIGRP) Informational RFC Frequently Asked Questions, retrieved 14 September 2013
  2. ^ a b IGRP and EIGRP | Difference Between | IGRP vs EIGRP. Difference Between (2011-05-19). Retrieved on 2014-05-30.
  3. ^ a b Cisco Systems (2012), Enhanced Interior Gateway Routing Protocol (EIGRP) Wide Metrics, retrieved 14 March 2014
  4. ^ a b c Cisco Training White Paper, Global Knowledge Training LLC, 2013, retrieved 17 September 2013 
  5. ^ a b Introduction to EIGRP. Cisco. Retrieved on 2014-05-30.
  6. ^ Cisco Systems (2013), What is Administrative Distance?, retrieved 14 September 2013
  7. ^ "RTP in EIGRP". Packet Life. 2009-01-17. 
  8. ^ Shamim,Aziz,Liu, Martey 2002, Troubleshooting IP Protocols, Cisco Press USA, accessed 23 November 2013,
  9. ^ a b CCIE Practical Studies, Volume I | Chapter 11. Hybrid: Enhanced Interior Gateway Routing Protocol (EIGRP). InformIT (2008-06-13). Retrieved on 2014-05-30.
  10. ^ Ashraf, Muhammad Irfan, et al. "Comparative Analysis of Link State and Hybrid Routing Protocols"
  11. ^ Albrightson, R., Garcia-Luna-Aceves, J. J., & Boyle, J. (1994, May). EIGRP a fast routing protocol based on distance vectors. In Proc. Networld/Interop (Vol. 94, pp. 136-147).
  •  .
  •  .
  •  .
  • Lammle, Todd (2007), CCNA Cisco Certified Network Associate Study Guide (Sixth ed.),  .
  •  .

External links

  • "Introduction to EIGRP". Cisco Systems. 2005-08-10. 
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.