Administrative Distance, prefix length, metric… Who is the winner?
March 18, 2013 2 Comments
- The Concept
- Procedural tasks
- Result table
- Conclusion
The concept
The idea of the lab is to test the RIB best route election criteria of a border router. To do so, four overlapping subnets are configured in different parts of the network and available to a border router through different routing protocols. One of them is directly connected.
All prefixes are made available and reachable in the same time to see who is going to be elected as best route, then remove the winner from the competition by making the corresponding path unavailable and iterate the selection process until the last path.
One directly connected segment and three routing protocols, so four administrative distances: directly connected (AD=0), RIP(AD=120),OSPF(AD=110) and EIGRP internal(AD=90).
Each protocol has two unequal paths (different metrics) to reach the same prefix.
Prefix masks are configured to be inversely proportional to routing protocol administrative distances.
Lab topology
Procedural tasks
For each test case, the routing table is checked for the best route, a trace route to check the path and make the winner path unavailable.
Result table
Classification |
Mask length |
metric |
AD |
prefix |
Path |
Routing protocol |
4 |
28 |
110 |
110 |
192.168.1.64 |
A |
OSPF |
3 |
74 |
192.168.1.64 |
B |
|||
1 |
29 |
1 |
120 |
192.168.1.64 |
C |
RIP |
2 |
2 |
192.168.1.64 |
D |
|||
6 |
27 |
32195456 |
90 |
192.168.1.64 |
E |
EIGRP |
5 |
2195456 |
192.168.1.64 |
F |
|||
7 |
26 |
0 |
0 |
192.168.1.64 |
G |
– Directly connected |
RIB looks at the mask length first. The directly connected prefix with the shortest mask length is considered last as the longer the mask, the more accurate the prefix.
Conclusion
With the same prefix and different mask lengths, the border router considers the following criteria in order of preference:
- Longest mask among all routing protocols
- Lowest cost with the same routing protocol