Ignore routes having an unreachable BGP nexthop

Prefer routes having the shortest AS-Path

Prefer routes having the smallest MED

Prefer routes learned via eBGP sessions over routes learned via iBGP sessions

Prefer routes having the highest local-pref

Prefer routes having the closest next-hop

Prefer routes having the smallest MED

Prefer routes learned via eBGP sessions over routes learned via iBGP sessions

Ignore routes having an unreachable BGP nexthop

Prefer routes having the shortest AS-Path

Prefer routes having the highest local-pref

4. Prefer routes having the closest next-hop
5. Prefer routes learned via eBGP sessions over routes learned via iBGP sessions
6. Prefer routes having the smallest MED
7. Tie breaking rules prefer routes learned from the router with lowest router id

4. Prefer routes having the smallest MED
5. Prefer routes learned via eBGP sessions over routes learned via iBGP sessions
6. Prefer routes having the closest next-hop
7. Tie breaking rules prefer routes learned from the router with lowest router id

4. Prefer routes learned via eBGP sessions over routes learned via iBGP sessions
5. Prefer routes having the smallest MED
6. Prefer routes having the closest next-hop
7. Tie breaking rules prefer routes learned from the router with lowest router id

4. Prefer routes learned via eBGP sessions over routes learned via iBGP sessions
5. Prefer routes having the closest next-hop
6. Prefer routes having the smallest MED
7. Tie breaking rules prefer routes learned from the router with lowest router id

The Multi-Exit Discriminator (MED)

The local-preference

The AS-Path

The BGP Communities

The BGP Nexthop

\(\frac{k \times (k-1)}{2}\)

\(k \times (k-1)\)

\(\frac{k}{2}\)

\(k\)