Which two elements are valid in the BGP path selection algorithm? (Choose two.)
Click on the arrows to vote for the correct answer
A. B. C. D.BD
When a Junos device receives two similar route advertisements from different BGP peers, it will select the route will the lowest MED value. BGP route selection proceeds in this manner:
-> Prefer the highest local-preference value
-> Prefer the shortest AS-path length
-> Prefer the lowest origin value
-> Prefer the lowest MED value
-> Prefer routes learned from an EBGP peer over an IBGP peer
-> Prefer best exit from AS
-> For EBGP-receive routes, prefer the current active route:
-> otherwise, prefer routes from the peer with the lowest RID
-> Prefer paths with the shortest cluster length
-> Prefer routes from the peer with the lowest peer ID
The BGP (Border Gateway Protocol) path selection algorithm is used by routers to determine the best path to reach a given destination network. The algorithm takes into account various attributes of the BGP routes to select the most preferable path. Two of the attributes that are used in the path selection algorithm are:
Therefore, the correct options for elements that are valid in the BGP path selection algorithm are: A. Lowest Local preference value D. Highest Local preference value
Therefore, option B is correct: Lowest Multi-exit Discriminator. Option C (highest multi-exit discriminator) is incorrect because the lower MED value is more preferred.