EIGRP builds and maintains three tables,
- A Neighbour table – used to make sure all ACKs are received.
- A Topology Table – used to understand paths through the network.
- An IP Routing Table – the best paths from the Topology table.
Creating the Neighbour Table
As previously stated, the neighbour table is maintained through Hello packets (These are multicast announcements that the router is alive).
- Hello packets place the router into an adjacent routers’ neighbour tables.
- Reciprocal Hellos build the local Neighbour Table.
- Once the Neighbour Table is built, Hellos continue periodically to maintain neighbourship.
Each Layer-3 Protocol supported by EIGRP (IPv4, IPv6, IPX and AppleTalk) has its own separate Neighbour Table. Information about neighbours, routes, or costs are not shared between protocols.
Contents of the Neighbour Table (Resource 1, 2)
- The Layer-3 Address of the neighbour (IP Address)
- The interface through which the neighbours Hello was heard (fe0/1)
- The holdtime (how long the neighbour table waits without hearing a Hello from a neighbour before declaring the neighbour unavailable and purging the database). Holdtime is three times (x3) the value of the Hello timer by default.
- The uptime (period since the router first heard from the neighbour).
- The sequence number. The neighbour table tracks all the packets sent between neighbours (both the last sequence number sent to the neighbour and the last sequence number received from the neighbour).
- Retransmission timeout (RTO), the time a router will wait on a connection-orientated protocol without ACK before retransmitting the packet.
- Smooth Round Trip Time (SRTT), calculates the RTO. The SRTT is the time (milliseconds) that it takes a packet to be sent to a neighbour and a reply to be received.
- The number of packets in a queue, which is a means by which administrators can monitor congestion on the network.
Becoming a Neighbour
All EIGRP routers periodically announce themselves with the Hello packet using multicast (224.0.0.10). On hearing a Hello (receiving) routers add an entry in the Neighbour Table (the continued receipt of Hello packets maintain the neighbour table).
If a Hello packet is not received from a neighbour within the holdtime (3x the Hello timer) the neighbour is removed from the Neighbour Table.
- LAN = Hello timer 5 seconds, Holdtimer 15 seconds.
- DS1 (1.5Mbps) or slower WAN links = Hello timer 60 second, Holdtimer 180 seconds.
To become a neighbour, the following conditions must be met:
- The router muse hear a Hello packet from a neighbour,
- The EIGRP Autonomous System (AS) number in the Hello packet must be the same as the receiving router,
- the K-values used to calculate the metric must be the same.
Creating the Topology Table
After a router knows who neighbours are, it can create a Topology Table, assign Successors and Feasible Successors for each route (The Topology Table has a record of all routes not only Successors and Feasible Successors). The other routes are referred to as possibilities.
The topology table includes the following information:
- Whether the route is passive or active.
- Whether an update has been sent to the neighbour.
- Whether a query packet has been sent to a neighbour
- if positive at least 1 route will be market active.
- Whether a query packet has been sent
- if positive another field will track whether any replies have been received from neighbours.
- That a reply packet has been sent in response to a query packet from a neighbour.
- Prefixes, masks, interface, next-hop, and Feasible and Advertised Distance from remote networks.
The Topology Table is built from Update Packets that are exchanged by neighbours and by Replies to Queries sent by the router.
Queries and Responses used by EIGRP are sent reliably as multicast using RTP. If a router does not hear an ACK within the allotted time, it retransmits the packet as a unicast (16 times) after which the router marks the neighbour as dead.
Each time the router sends a packet, RTP increments the sequence number by one. The router must hear an ACK from EVERY router before it can send the next packet.
When all this is done the router has an understanding of the topology, it then runs DUAL to determine the BEST PATHS to the remote network. The result is entered into the Network Table.
Maintaining the Topology Table
The Topology Table may be recalculated because
- A new network is added,
- Successors change,
- A network is lost.
Adding a Network to the Topology Table

- As soon as Router A becomes aware of the new network (right),
- It starts sending Hello packets out the new interface.
- No one answers (there is no router out the interface).
- There will be no entries in the Neighbour Table because no neighbours responded to the Hello.
- There is however a new entry in the Topology Table because it is attached to a new network.
- No one answers (there is no router out the interface).
- It starts sending Hello packets out the new interface.
- EIGRP, sensing a change, must send an update to all neighbours on it’s old interface, informing neighbours of the change. These updates are tracked in the Topology Table and the Neighbour Table because updates are connection-orientated and ACKs from neighbours must be received within a timeframe.
- Router A has completed its work.
- Neighbours on the old network will update their sequence numbers in their Neighbour Tables and add the new network to the Topology Table.
- They will calculate FD and the Successor to place in the Routing Table.
- Neighbours on the old network will update their sequence numbers in their Neighbour Tables and add the new network to the Topology Table.
Deleting a Path or Router from the Topology Table

- If a network connected to Router A is disconnected (right),
- Router A updates its Topology Table and Routing Table and sends an update to its neighbours.
- When a neighbour receives the update ,
- it updates the neighbour table and the topology table.
- The neighbour searches for an alternate route to the network. It examines the Topology table for alternatives (none will be found there is only one path).
- The neighbour then sends out a query to its neighbours requesting that they look in their tables for paths to the remote network.
- This marks the route active in the Topology Table.
- The query is tracked and when all replies are in the Topology Table and Neighbour Table is updated.
- DUAL (which starts as soon as network change registers) runs to determine the best path, which is placed in the routing table.
- Before routers respond, routers query their own neighbours (the search for alternative paths extends or diffuses throughout the entire organization).
- If no alternative is found, the neighbours reply to the query stating that they have no path.
- When no router can supply a path to the network, all the routers remove the network from their Routing Table and Topology Table.
Finding an alternate path to Remote Network
- The router marks the routes that were reached by sending the traffic to that neighbour.
- The router looks in the topology table to determine if there is an alternate route (Feasible Successor).
- If a successor is found, the router adds the feasible successor to it’s routing table. If the router did not have a feasible successor, it would have placed the route into an active state while sending queries to neighbours for an alternate path.
- After interrogating the topology table, if a feasible route is found, the neighbour replies with the alternative path. This path is placed in the Topology Table.
- If no answer is heard, the messages are propagated through the network.
Creating the Routing Table
The Routing Table in EIGRP is built from the Topology Table using DUAL. The Topology Table holds all routing information known to the router and from this information successors and feasible successors are selected. Successors are passed to the Routing Table and used for routing decisions.
EIGRP Path Selection
Go here for more information on the metric.
Updating the Routing Table in Passive Mode with DUAL
When a path is lost, DUAL first looks in the Topology Table for a FD; If none the router stays in passive mode (as opposed to active mode where the router actively queries for alternative paths).
- The FD from Router A to Router G is 10 ( A – D – G)
- The AD from Router A to Router G is 5 (advertised from Neighbour D)
- Because 10 > 5 (FD > AD). The FD meets the feasibility condition allowing it to become FD.
- If the link between Router D and Router G goes down. Router A looks in its Topology Table.
- The Alternative Routes through Routers A to D to E to G (A-D-E-G) have an AD of 19
- Because 10 < 19 (original FD), it does not qualify as a feasible successor.
- The Path through Router D to H to F to G (D-H-F-G) has an AD of 20
- Because 10 < 20 (original FD), it does not qualify as a feasible successor.
- The Path through Router A to E to G has an AD of 7
- Because 10 > 7 (original FD), it does qualify as a feasible successor.
- After the link between Router D and G dies, the Routing Table would be updated from the Topology Table while the router remains in Passive Mode.
Updating the Routing Table in Active Mode with DUAL
When no alternative route is found in the Routing Table, the following actions occur. The Topology Table of Router A starts with a path (successor) of A to D to G to X. The FD is 20, and the AD from Router D is 15. When Router D dies, Router A must find an alternate path to X.
- The router rejects neighbours Router B, Router C, Router E and Router F as Feasible Successors.
- Router B 20 < 27
- Router C 20 < 27
- Router E 20 = 20
- Router F 20 < 21
- Because all neighbours have a AD greater than or equal to the successors FD. They do not meet Feasibility requirements.
- Router A goes into Active Mode and sends out queries.
- Both Router E and F reply
- Router E 20 > 5
- Router F 21 > 5
- The network returns to Passive Mode. The FD is acceptable, the Topology Table and Routing Table will be updated.
- Router E is selected as the best route based on a lower FD
- The result is placed in the Routing Table as the valid neighbouring router.
- Router F will be the feasible successor.
EIGRP Network Design
- EIGRP is designed to work in very large networks.
- EIGRP is very design Sensitive.
- Scaling a network properly is a major concern.
- New demands are constantly driving the networks to use applications that require more bandwidth with less delay; while networks are becoming larger and more complex.
Factors that can affect of EIGRP include:
- Amount of information sent between neighbours.
- Number of routers that receive updates.
- distance between neighbouring routers.
- number of alternative paths to remote networks
Poorly scaled EIGRP networks result in:
- A stuck-in-Active route
- Network Congestion
- Lost routing information
- Flapping routes
- Retransmission
- Low Router memory
- Over utilized Router CPU
Other factors (poor design) cause some of these symptoms because resources are overwhelmed with assigned tasks.
EIGRP Design Issues
Major concern in scaling an organizations network is controlling advertisements and limiting query range (NB over slow WAN links). Sending less information about the network there is more bandwidth available to clients and servers. This relieves the network and speeds convergence, it provides less information for alternate paths though.
EIGRP automatically summarizes at classful network boundaries because summarization is generally helpful and EIGRP is built to recognize opportunities such as this to optimize the network (Most Admins disable auto summarization because it does not match their needs, instead manually configure it at interface level).
Certain topologies pose problems for EIGRP networks. Like the hub-and-spoke design often used between remote sites and regional offices. Popular dual-hub configuration provides redundancy and allows for potential for routers to reflect queries back to one another. Summarization and filters make network design work well while also allowing queries to be managed effectively.
Guideline to Scaling Issues
- Assign addresses and organize links so that natural points for summarization exist. A hierarhical network design IOW.
- Provide sufficient hardware resources (mem and CPU) on network devices.
- Use sufficient bandwidth on the WAN links.
- Use filters to limit advertisements.
- Monitor the network.
I’m very strange. Every time I type Hello, I have a voice in my head going “Hello Kitty”. So share my pain “Hello Kitty”!

I’m going to kick myself later when I read over this post again cause this is going to get stuck in my head again.
Resources:
Notes and Notices:
This is a part of my personal BSCI notes and research to assist myself in learning and understanding the concepts and theory for the BSCI exam. I learn by making notes reading and writing things down and wish to file them where I can’t lose them. These notes are not to be seen, judged or mistaken for replacements to Cisco recognized and authorized training which I personally support and attend and suggest you undertake if you are going for the BSCI Certification.















