09-07-2017 12:24 AM - edited 03-08-2019 11:57 AM
This is how I understood from ICND1.
AD is only used to distinguish between two routes with the same length. Longest prefix always win.
1) Longest match - Longest Prefix Matching Rule
2) AD
Please let me know if I am wrong :)
Solved! Go to Solution.
09-07-2017 02:09 AM - edited 09-07-2017 02:14 AM
Hi all,
Please allow me to join.
I believe that we are confusing and mixing two independent things: How a routing table is populated, and how a routing table is searched through after it is populated.
When populating a routing table, the tiebreakers if multiple sources offer the same [Network, Netmask] entry for the routing table are:
As an example, consider this:
For each of these networks above, the routing protocols may also know about longer paths that have higher metrics, but they are uninteresting - what is shown above are only the least cost paths as known to the respective protocols.
Notice that these two protocols compete only for networks 10.0.1.0/24 and 0.0.0.0/0 - they both are trying to insert the very same network into the routing table. However, 10.0.0.0/16 and 10.0.0.0/24 are different networks because they differ in their netmask (or prefix length), and so there is no competition here. Therefore, the routing table will be:
Once again, when multiple protocols tried to insert the same network they know about, the protocol with the lower AD was preferred, and that protocol in turn installed the least cost path it knows, hence - lowest AD first, lowest metric second.
However, when searching this routing table for a match, the longest-prefix-match rule applies, and it always depends on the destination IP address of the packet to see which entry is matching:
Note: In this process, we were not looking at modifying the routing table contents anymore; we were just pondering the best match from the choices that were already available. Building a routing table is a different process than performing lookups in a routing table.
The bottom line is: There are two aspects to a routing table - one relates to how a routing table is populated with entries, the other is related how the contents of a routing table are used once they are there. When populating the routing table, the order of preference is AD first, metric second; when performing a lookup in the routing table, the longest-prefix-match rule is the exclusive rule.
Best regards,
Peter
09-07-2017 12:40 AM
Your right
09-07-2017 12:45 AM
09-07-2017 12:57 AM
What about that you are both right? He probably means that all three processes anounce the same networks.
09-07-2017 01:04 AM
09-07-2017 01:22 AM
No the one with the longest match prefix wins between the 3 protocols even if EIGRP is there
check this example exactly what your asking
09-07-2017 01:00 AM
09-07-2017 02:09 AM - edited 09-07-2017 02:14 AM
Hi all,
Please allow me to join.
I believe that we are confusing and mixing two independent things: How a routing table is populated, and how a routing table is searched through after it is populated.
When populating a routing table, the tiebreakers if multiple sources offer the same [Network, Netmask] entry for the routing table are:
As an example, consider this:
For each of these networks above, the routing protocols may also know about longer paths that have higher metrics, but they are uninteresting - what is shown above are only the least cost paths as known to the respective protocols.
Notice that these two protocols compete only for networks 10.0.1.0/24 and 0.0.0.0/0 - they both are trying to insert the very same network into the routing table. However, 10.0.0.0/16 and 10.0.0.0/24 are different networks because they differ in their netmask (or prefix length), and so there is no competition here. Therefore, the routing table will be:
Once again, when multiple protocols tried to insert the same network they know about, the protocol with the lower AD was preferred, and that protocol in turn installed the least cost path it knows, hence - lowest AD first, lowest metric second.
However, when searching this routing table for a match, the longest-prefix-match rule applies, and it always depends on the destination IP address of the packet to see which entry is matching:
Note: In this process, we were not looking at modifying the routing table contents anymore; we were just pondering the best match from the choices that were already available. Building a routing table is a different process than performing lookups in a routing table.
The bottom line is: There are two aspects to a routing table - one relates to how a routing table is populated with entries, the other is related how the contents of a routing table are used once they are there. When populating the routing table, the order of preference is AD first, metric second; when performing a lookup in the routing table, the longest-prefix-match rule is the exclusive rule.
Best regards,
Peter
09-07-2017 08:27 PM
09-08-2017 12:15 AM
>Cisco Employee so smart!
especially this one ... ;-)
Discover and save your favorite ideas. Come back to expert answers, step-by-step guides, recent topics, and more.
New here? Get started with these tips. How to use Community New member guide