What Is EIGRP in Networking?

Imagine you are in a big city and need to get from your home to a friend’s house across town. You have a GPS that shows you several possible routes. Now, suppose you and all your neighbors share a special GPS that learns from everyone’s driving experiences. If a road gets blocked, the GPS instantly tells everyone about a detour. That is similar to what EIGRP does for routers.

Routers are special devices that move data, like emails or web pages, between different parts of a network. They need a map of the network to know where to send each piece of data. EIGRP (Enhanced Interior Gateway Routing Protocol) is one way for routers to build and update that map.

EIGRP is called a routing protocol because it is a set of rules that routers follow to share information about network paths. What makes EIGRP special is that it is efficient. Instead of constantly sending its entire routing table to other routers every 30 seconds like some older protocols, it only sends updates when there is a change. This is like only sending a text to your friends when a road closes, rather than sending your entire address book every minute.

EIGRP also does something clever called a Diffusing Update Algorithm, or DUAL for short. DUAL helps the router quickly find an alternative route if the main route fails, without waiting for other routers to recalculate everything. In our city analogy, this is like your GPS instantly showing you a detour when you hit a traffic jam, using a backup route it already knew about.

Another key idea is that EIGRP uses metrics to decide which path is best. A metric is a number that represents how good a route is. EIGRP considers bandwidth (how wide the road is) and delay (how long it takes to travel) by default. A wider road with less delay gets a better metric. This means EIGRP can choose the most efficient path, not just the shortest one in terms of hops or distance.

EIGRP was originally designed by Cisco Systems and is often found in networks that use Cisco equipment. Even though it is a proprietary protocol, Cisco has published some details so that other vendors can also implement it. It is widely used in medium to large enterprise networks because it is fast, reliable, and fairly easy to configure.

In simple terms, EIGRP helps routers make smart, quick decisions about where to send data. It saves network bandwidth by not sending unnecessary updates, and it recovers from failures very quickly. For IT professionals, understanding EIGRP is important because many real-world networks rely on it to keep data flowing smoothly.

EIGRP, which stands for Enhanced Interior Gateway Routing Protocol, is a hybrid routing protocol that combines the best features of distance-vector and link-state protocols. Originally developed by Cisco Systems in 1992 as a proprietary enhancement to IGRP (Interior Gateway Routing Protocol), it was later partially published in an informational RFC (RFC 7868) to allow interoperability with other vendors. It is classified as an advanced distance-vector protocol.

EIGRP operates at the Network Layer (Layer 3) of the OSI model and uses IP protocol number 88. It supports both IPv4 and IPv6 address families. Routers running EIGRP exchange routing information using multicast address 224.0.0.10 for IPv4 and FF02::A for IPv6. Unlike RIP, which sends periodic full updates, EIGRP sends incremental updates only when a topology change occurs. This significantly reduces bandwidth usage and convergence time.

EIGRP uses the Diffusing Update Algorithm (DUAL) to ensure loop-free paths and provide rapid convergence. DUAL works by maintaining a topology table that contains all routes learned from neighbors. From this table, the router selects the best path, called the successor, for each destination. It also identifies one or more feasible successors, which are backup routes that meet a specific condition known as the Feasibility Condition. The Feasibility Condition states that the reported distance (RD) of a neighbor must be less than the feasible distance (FD) of the current successor. This condition guarantees that the backup path is loop-free.

The metric used by EIGRP is a composite value calculated from multiple parameters: bandwidth (K1), delay (K2 for load, but default is not used by default), reliability (K3 is not used by default), load (K4 and K5 are not used by default), and MTU (not used by default). By default, only bandwidth and delay are used, with the formula: Metric = (K1 * bandwidth + (K2 * bandwidth) / (256 - load) + K3 * delay) * 256. Since K2 and K3 are not used by default, the formula simplifies to: Metric = (bandwidth + delay) * 256. Bandwidth is calculated as (10^7 / minimum bandwidth along the path) * 256, and delay is the sum of all outgoing interface delays in tens of microseconds, multiplied by 256.

EIGRP uses three tables: the Neighbor Table, Topology Table, and Routing Table. The Neighbor Table lists directly connected routers running EIGRP, identified by their IP addresses and interface information. Routers discover neighbors by sending Hello packets every 5 seconds (default) on high-bandwidth links (greater than 1.544 Mbps) and every 60 seconds on low-bandwidth links. The Hold Time is three times the Hello interval (default 15 seconds). If a router does not receive a Hello from a neighbor within the Hold Time, it declares that neighbor as down and triggers DUAL to find alternative routes.

The Topology Table stores all routes learned from every neighbor, including the reported distance (the metric from the neighbor to the destination) and the feasible distance (the metric from the local router to the destination). DUAL uses this information to select successors and feasible successors. The Routing Table contains only the successors, which are the best routes used for forwarding packets.

EIGRP supports three types of packets: Hello, Update, and Query. Hello packets are used for neighbor discovery and keepalive. Update packets carry routing information and are sent only when a change occurs. Query packets are sent by a router that loses a successor and has no feasible successor, asking neighbors if they have an alternative path. Replies are sent in response to queries.

EIGRP supports route summarization, allowing administrators to aggregate multiple network prefixes into a single summary route, which reduces table size and improves stability. It also supports authentication using MD5 or SHA-256 to secure routing updates and prevent unauthorized routers from injecting false routes.

In real IT implementations, EIGRP is commonly deployed in enterprise networks with Cisco infrastructure. It is suitable for networks of all sizes but is most effective in medium to large networks where fast convergence is critical. Configuration involves enabling EIGRP on a router, specifying the autonomous system number (ASN), and advertising directly connected networks. It can also be configured with route filtering, offset lists, and redistribution from other routing protocols. EIGRP is often used in conjunction with OSPF or BGP in larger multi-vendor environments, though care must be taken with redistribution to avoid routing loops.

EIGRP matters because it strikes a strong balance between simplicity, efficiency, and rapid convergence. In real-world IT environments, network downtime costs money. EIGRP’s ability to quickly find alternative routes when a link fails means that network services remain available even during failures. This is especially important for businesses that rely on continuous connectivity for operations, such as e-commerce, cloud services, or internal communication systems.

Another reason EIGRP matters is that it is bandwidth-friendly. Older protocols like RIP send their entire routing table every 30 seconds, which can consume significant bandwidth on slow links. EIGRP sends only incremental updates, which is much more efficient, especially in networks with limited bandwidth or many routes. This makes EIGRP suitable for both LAN and WAN environments.

EIGRP is also relatively easy to configure compared to OSPF, which requires hierarchical area design and more complex configuration. For network administrators who need a simple yet powerful routing solution, EIGRP is an excellent choice. It supports advanced features like route summarization, load balancing across equal and unequal cost paths, and authentication for security.

In practice, many Cisco-based networks run EIGRP as their interior gateway protocol. Even in multi-vendor environments, EIGRP can be used if all routers support it. Understanding EIGRP is therefore essential for network professionals who work with Cisco equipment or in environments where EIGRP is deployed. It gives administrators the ability to design resilient, efficient, and scalable networks.

On the CompTIA Network+ exam, EIGRP questions typically appear in one of three patterns: concept identification, protocol comparison, or scenario-based selection.

Concept Identification: A question might ask: “Which routing protocol uses a composite metric of bandwidth and delay and employs the DUAL algorithm for loop prevention?” The answer is EIGRP. These questions test your ability to associate specific features with the correct protocol.

Protocol Comparison: You may see a table or list of features and be asked to select which protocol matches the description. For example, “Which of the following is a hybrid routing protocol that supports unequal-cost load balancing?” EIGRP is the correct choice. Another common comparison is administrative distance: “Which routing protocol has a default administrative distance of 90?” (EIGRP internal).

Scenario-Based Selection: The exam may present a network scenario. For instance: “A company has a network with 50 routers connected over WAN links with limited bandwidth. The network administrator needs a routing protocol that converges quickly and uses minimal bandwidth. Which protocol should be chosen?” The best answer is EIGRP. The scenario emphasizes the factors that make EIGRP suitable: fast convergence, incremental updates, and effective use of WAN bandwidth.

Troubleshooting Questions: You might be given a show command output and asked to identify the successor or feasible successor. For example, “Using the show ip eigrp topology output, which route is the successor for network 192.168.1.0?” You need to read the output and identify the route with the lowest feasible distance. These questions test practical troubleshooting skills.

Configuration Questions: For CCNA-style exams, you may see items like: “Which command enables EIGRP for network 10.0.0.0 on a router?” The answer is “router eigrp 100” followed by “network 10.0.0.0.” Or, “Which command shows the neighbors of an EIGRP router?” “show ip eigrp neighbors.”

By practicing these question types, you will be well prepared for any EIGRP-related items on the exam.

EIGRP is a protocol that requires careful planning to function optimally in a production network. One of the first things professionals must understand is the concept of the Autonomous System Number (ASN). This number, ranging from 1 to 65535, must be consistent across all routers that will form EIGRP adjacencies. A mismatch will prevent neighbor formation entirely. When configuring EIGRP on multiple routers, it is good practice to document the chosen ASN in network documentation.

Another practical consideration is the metric calculation. By default, EIGRP uses bandwidth and delay. The bandwidth used is the minimum bandwidth along the entire path to the destination. The delay is the cumulative sum of all outgoing interface delays. Professionals often need to adjust these values manually using interface commands like 'bandwidth [kbps]' and 'delay [tens of microseconds]' to ensure that EIGRP selects the desired paths. For example, to make a preferred satellite link less preferred due to high latency, an administrator might increase the delay value on that interface rather than relying on defaults.

Route summarization is a powerful feature in EIGRP. Instead of advertising dozens of individual subnets, an administrator can configure a summary route using the 'ip summary-address eigrp [ASN] [network] [mask]' command on an interface. This reduces the size of routing tables and improves stability. However, if summarization is misconfigured, it can cause routing black holes. For instance, if a summary route is advertised but the component routes do not exist on the summarizing router, packets may be dropped.

Authentication is another critical real-world practice. EIGRP supports both MD5 and SHA-256 authentication. Without authentication, a rogue router could join the EIGRP domain and inject false routes, potentially causing a network outage or a man-in-the-middle attack. Configuring authentication involves setting a key chain and applying it to the EIGRP process. Professionals should use stronger SHA-256 where possible, especially in environments subject to security compliance.

Troubleshooting EIGRP is a common task. The most frequently used commands are 'show ip eigrp neighbors' to verify neighbor relationships, 'show ip eigrp topology' to examine the topology table, and 'show ip route eigrp' to see installed routes. If a route does not appear in the routing table, possible causes include: the neighbor is not up, route filtering is blocking it, or the route is not feasible due to the Feasibility Condition not being met. Professionals also check for 'stuck in active' (SIA) routes, which occur when a query times out due to slow propagation. This can be mitigated by design improvements such as summarization or using 'eigrp stub' configurations on remote routers.

One common mistake in production is forgetting to configure passive interfaces. By default, EIGRP sends Hello packets on all interfaces enabled under the network command. On interfaces connected to untrusted networks or hosts, this can be a security risk and wastes bandwidth. Using the 'passive-interface' command prevents Hello packets from being sent on those interfaces, preventing unwanted neighbor formations.

In sum, EIGRP in practice requires attention to ASN, metrics, summarization, authentication, and troubleshooting. A well-configured EIGRP network can provide fast, reliable routing with minimal administrative overhead.

Enhanced Interior Gateway Routing Protocol (EIGRP) is a Cisco proprietary advanced distance vector routing protocol that combines the best features of both distance vector and link-state protocols. Unlike traditional distance vector protocols like RIP, EIGRP uses a sophisticated metric calculation based on bandwidth and delay by default, but it can also include load, reliability, and maximum transmission unit (MTU) for path selection. EIGRP is known for its rapid convergence, scalability, and loop-free routing through its unique Diffusing Update Algorithm (DUAL).

One of the standout features of EIGRP is its support for multiple network layer protocols. Originally designed to route IP, IPX, and AppleTalk, modern EIGRP implementations focus on IPv4 and IPv6. EIGRP uses protocol-dependent modules (PDMs) to handle different network layer protocols, making it highly adaptable.

EIGRP operates in a hybrid manner: it exchanges routing information like a distance vector protocol but maintains neighbor relationships and topology tables similar to link-state protocols. It does not send periodic full routing updates; instead, it sends partial updates only when a change occurs, which conserves bandwidth and CPU resources. EIGRP also supports route summarization, both automatic and manual, which reduces the size of routing tables and improves network stability.

Another critical feature is its support for unequal-cost load balancing. Unlike OSPF or RIP, EIGRP can distribute traffic across multiple paths with different metric values, using the variance command. This allows network administrators to optimize link utilization.

For the CompTIA Network+ exam, you should know that EIGRP uses an administrative distance of 90 for internal routes and 170 for external routes. It is classified as an advanced distance vector protocol, and its convergence speed is very fast due to DUAL. EIGRP is also commonly used in enterprise networks that are primarily Cisco-based.

EIGRP uses a composite metric to determine the best path to a destination network. The default metric calculation uses only bandwidth and delay, but it can be extended to include load, reliability, and MTU. The formula for the classic EIGRP metric is: metric = [K1 * bandwidth + (K2 * bandwidth) / (256 - load) + K3 * delay] * [K5 / (reliability + K4)], where K constants are configurable. By default, K1 = 1, K3 = 1, and K2, K4, K5 = 0, which simplifies the metric to bandwidth + delay.

Bandwidth in the formula is the lowest bandwidth along the path to the destination, calculated as 10^7 / minimum bandwidth in kbps. This is not the interface bandwidth but the path bandwidth. Delay is the cumulative sum of all interface delays along the path, expressed in tens of microseconds. By default, delay is the sum of the configured delays on each outgoing interface, typically 100 microseconds for Fast Ethernet and 1000 microseconds for serial links.

EIGRP multiplies the result by 256 to maintain backward compatibility with Interior Gateway Routing Protocol (IGRP). This scaling factor ensures that EIGRP metrics are 256 times larger than IGRP metrics, allowing route redistribution between the two protocols without metric recalculation.

In newer Cisco IOS versions, EIGRP also supports a wide metric format that uses a 64-bit metric space, allowing for much higher granularity and larger networks. This wide metric is enabled by default in modern IOS and uses the same K values but with a different formula that accommodates links up to 10 Tbps and delays up to 16 seconds.

For the Network+ exam, you should be able to identify that EIGRP uses bandwidth and delay by default, that the metric calculation is more sophisticated than RIP's hop count, and that the metric is used to select the best path to a destination. Understanding the default K values is important because mismatched K values between routers prevent them from forming an EIGRP neighbor adjacency.

EIGRP forms neighbor relationships with directly connected routers that also run EIGRP and share the same autonomous system number. The process of forming an EIGRP neighbor adjacency is crucial for exchanging routing information and ensuring loop-free paths. When a router discovers a potential neighbor through a hello packet, it goes through several states: Down, Init, and Established (or Full). The protocol uses hello packets to discover and maintain neighbor relationships. By default, hello packets are sent every 5 seconds on high-bandwidth links and every 60 seconds on low-bandwidth links (such as multipoint Frame Relay).

The neighbor adjacency process begins with a router sending a multicast hello packet to the well-known EIGRP multicast address 224.0.0.10. When a receiving router processes the hello, it adds the sender to its neighbor table and transitions to the Init state. Then, it sends a unicast update packet containing its routing table. The original router responds with an acknowledgment and sends its own update. Once both routers have exchanged all routing information, the neighbor state becomes Established (or Full), and they are considered adjacent.

For the neighbor relationship to stay up, several conditions must be met: both routers must have the same autonomous system number (ASN), the same K values for metric calculation, the same authentication settings (if configured), and must be on the same subnet. If any of these parameters mismatch, the neighbor adjacency will not form. The hold time, which is typically three times the hello interval (15 seconds on high-bandwidth links), must be consistent. If no hello packets are received within the hold time, the neighbor is declared dead and removed from the neighbor table.

EIGRP uses a reliable transport protocol (RTP) to guarantee delivery of routing updates, queries, and replies. Unreliable multicast hello packets are sent on a best-effort basis, but update, query, and reply packets require acknowledgment. If an acknowledgment is not received, the router retransmits the packet. This reliability mechanism ensures that routing information is not lost during transmission.

For the Network+ exam, you may be asked about the hello and hold timers, the multicast address used by EIGRP, and the conditions required for neighbor adjacency. Understanding the states (Down, Init, Established) is also useful for troubleshooting.

The Diffusing Update Algorithm (DUAL) is the core loop-prevention and convergence mechanism of EIGRP. DUAL provides extremely fast convergence when a route fails because it can instantly switch to a feasible successor path without recalculating the entire routing table. This is different from distance vector protocols that rely on hold-down timers or link-state protocols that must run the SPF algorithm. DUAL guarantees loop-free paths by maintaining a table of all possible routes to a destination, known as the topology table, and selecting only those that meet the feasibility condition.

The feasibility condition states that for a path to be a feasible successor, the reported distance from the neighbor (the neighbor's metric to the destination) must be less than the local router's feasible distance (the best metric to the destination). This ensures that the neighbor is closer to the destination than the local router, preventing routing loops. If a primary route fails and a feasible successor exists, the router immediately uses the feasible successor as the new route without needing to send queries to other neighbors. This results in sub-second convergence.

If no feasible successor exists when the primary route fails, the router enters active state for that destination. It sends query packets to all its neighbors, asking if they have a route to the destination. The router must wait for replies from all neighbors before it can select a new route. If a neighbor does not reply within the active timer (default 3 minutes), the router sends an SIA (Stuck In Active) query to that neighbor, and if no response is received, the neighbor is reset. This process is designed to prevent indefinite waiting, but it can cause instability if the network is large or has slow links.

DUAL also uses the concept of successor routes (the best path) and feasible successors (backup routes that meet the feasibility condition). The topology table holds all successors and feasible successors, while the routing table only contains the best successor route (or multiple if unequal-cost load balancing is configured).

For the Network+ exam, you should understand that DUAL is responsible for loop prevention and fast convergence, and that feasible successors allow immediate failover. You may also be asked about the difference between passive and active states for a route, and what causes a router to send queries.