Hi,
I am stuck on some networking BGP Valley Free Routing homework, so more explanation focused answers would be greatly appreciated!
In this assignment I am trying to construct the FIB table from the given Network Diagram above.
For clarification on the network diagram, the red numbers are the Local Preferences. For example, moving from router 1 to 2 has a local preference of 100, while moving form router 2 to 1 has a local preference of 300. Arrows show a customer/provider relationship where the arrow points to the provider and a normal line shows a peer relationship.
Where I am stuck at is picking the ideal paths for the table because I don't know when Local Preference gets out weighed by Shortest path.
For example: Finding the shortest path between routers 3 and 6. Since Local_preference is highest on the order or operations for selecting the best choice next hop, I initially go 3 -> 1. Which leaves me to select 2 as the next router to hop to, so my path becomes 3 -> 1 -> 2. (It is specified in the assignment that in cases of tie, use the lowest router number). Continuing the local pref train gets my final path to be 3 -> 1 -> 2 -> 5 -> 6. But the shortest path would be to take the local preference hit and route the path as 3 -> 6.
3 -> 6 seems much more correct but Local_Pref has a higher operation order which leaves me unsure.
Any insight on this question is greatly appreciated, I'm sure I'm just over thinking this.
Thanks!