Introduction to EIGRP

In this lesson, we’ll take a look at EIGRP (Enhanced Interior Gateway Routing Protocol) which is Cisco’s routing protocol. If you are unfamiliar with distance vector and RIP I highly recommend to read my Introduction to RIP first before continuing.

EIGRP stands for Enhanced Interior Gateway Routing Protocol and is a routing protocol created by Cisco. Originally, it was only available on Cisco hardware but since a few years, it’s now an open standard. EIGRP is called a hybrid or advanced distance vector protocol and most of the rules that apply to RIP also apply here:

  • Split Horizon
  • Route Poisoning
  • Poison Reverse

EIGRP Tables

EIGRP routers will start sending hello packets to other routers just like OSPF does, if you send hello packets and you receive them you will become neighbors. EIGRP neighbors will exchange routing information which will be saved in the topology table. The best path from the topology table will be copied in the routing table.

Selecting the best path with EIGRP works a bit different than other routing protocols so let’s see it in action:

eigrp demo 3 routers

We have three routers named R1, R2 and R3. We are going to calculate the best path to the destination which is behind R3.

EIGRP uses a rich set of metrics namely bandwidth, delay, load and reliability which we will cover later. These values will be put into a formula and each link will be assigned a metric. The lower these metrics the better.

In the picture above I have assigned some values on the interfaces, if you would look on a real EIGRP router you’ll see the numbers are very high and a bit annoying to work with.

eigrp advertised distance

R3 will advertise to R2 its metric towards the destination. Basically R3 is saying to R2: “It costs me 5 to get there”. This is called the advertised distance. R2 has a topology table and in this topology table it will save this metric, the advertised distance to reach this destination is 5.

The advertised distance is also called the reported distance.

eigrp feasible distance

We are not done yet since there is something else that R2 will save in its topology table. We know the advertised distance is 5 since this is what R3 told us. We also know the metric of the link between R2 and R3 since this is directly connected. R2 now knows the metric for the total path to the destination, this total path is called the feasible distance and it will be saved in the topology table.

You have now learned two important concepts of EIGRP. The advertised distance, your neighbor tells you how far it is for him to reach the destination and the feasible distance which is your total distance to get to the destination.

Let’s continue!

eigrp advertised feasible distance

We are not done yet since R1 is also running EIGRP. R2 is sending its feasible distance towards R1 which is 15. R1 will save this information in the topology table as the advertised distance. R2 is “telling” R1 the distance is 15.

We're Sorry, Full Content Access is for Members Only...

If you like to keep on reading, Become a Member Now! Here is why:

  • Learn any CCNA, CCNP and CCIE R&S Topic. Explained As Simple As Possible.
  • Try for Just $1. The Best Dollar You’ve Ever Spent on Your Cisco Career!
  • Full Access to our 739 Lessons. More Lessons Added Every Week!
  • Content created by Rene Molenaar (CCIE #41726)

536 Sign Ups in the last 30 days

100% Satisfaction Guaranteed!
You may cancel your monthly membership at any time.
No Questions Asked!


Forum Replies

  1. Hi Rene,

    This is all I have to say, THANK YOU! :clap::clap::clap:

    Complicated concepts, made very objective.

  2. Hello,

    I still have doubt to get Advertised distance and Feasible distance as per topology. As mentioned that Advertised distance: How far the destination is away for your neighbor and Feasible distance: The total distance to the destination.

    I followed the given steps:

    R4 will advertise the destination network to R3.
    R3 will advertise the network to R1 and R2.
    R1 will advertise the network to R2.
    R2 will advertise the network to R1.
    R1 will advertise this network back to R3.
    R2 will advertise this network back to R3.

    But i am not getting same value as mentione

    ... Continue reading in our forum

  3. Hello Laz,

    Thanks for clarification. Now i am getting your point.

    Please make me correct if i am wrong. Now i am taking AD and FD value from R2’s perspective.

    1. Advertised distance from R3 is 9 (Path R3->R4) directly
    2. Advertise distance from R1 is 25 (Path R1->R2->R3->R4->Destnation). Second path would not be selected as per split horizon rule which is (R1->R3->R4->Destination).

    Feasible distance

    1. FD from R3 is = 9+4+5=18

    2. FD from R1 is = 25+7= 32

    Abhishek Saini

  4. Hi Ziad,

    In reality, when R3 receives an update from R1 or R2 about the destination behind R4, it won’t install them since these don’t pass the feasibility condition (AD of the feasible successor has to be lower than FD of successor).

    R3 will only advertise its successor route to other neighbors. In this topology, R4 is the successor route so normally R3 would advertise this route to R4. However, because of split horizon (don’t advertise a route to a neighbor if you learned that route from the neighbor)…this route is not advertised.

    It might be helpful to see a

    ... Continue reading in our forum

  5. The topology is being viewed from the standpoint of R3. We have the benefit here of seeing the full network topology, and you can trace if R3 used R1 or R2 as a feasible successor, to reach the destination, you’ll be going in a loop back to R3 (where you started).

163 more replies! Ask a question or join the discussion by visiting our Community Forum