
Figure 24. BGP Router Rules
1.
Router B receives an advertisement from Router A through eBGP. Because the route is learned through eBGP, Router B
advertises it to all its iBGP peers: Routers C and D.
2.
Router C receives the advertisement but does not advertise it to any peer because its only other peer is Router D, an iBGP
peer, and Router D has already learned it through iBGP from Router B.
3.
Router D does not advertise the route to Router C because Router C is a nonclient peer and the route advertisement came
from Router B who is also a nonclient peer.
4.
Router D does reflect the advertisement to Routers E and G because they are client peers of Router D.
5.
Routers E and G then advertise this iBGP learned route to their eBGP peers Routers F and H.
BGP Attributes
Routes learned using BGP have associated properties that are used to determine the best route to a destination when multiple paths
exist to a particular destination.
These properties are referred to as BGP attributes, and an understanding of how BGP attributes influence route selection is required
for the design of robust networks. This section describes the attributes that BGP uses in the route selection process:
•
•
•
Multi-Exit Discriminators (MEDs)
•
•
•
NOTE: There are no hard coded limits on the number of attributes that are supported in the BGP. Taking into account
other constraints such as the Packet Size, maximum number of attributes are supported in BGP.
Communities
BGP communities are sets of routes with one or more common attributes. Communities are a way to assign common attributes to
multiple routes at the same time.
NOTE: Duplicate communities are not rejected.
Best Path Selection Criteria
Paths for active routes are grouped in ascending order according to their neighboring external AS number (BGP best path selection
is deterministic by default, which means the
bgp non-deterministic-med
command is NOT applied).
The best path in each group is selected based on specific criteria. Only one “best path” is selected at a time. If any of the criteria
results in more than one path, BGP moves on to the next option in the list. For example, two paths may have the same weights, but
different local preferences. BGP sees that the Weight criteria results in two potential “best paths” and moves to local preference to
Border Gateway Protocol IPv4 (BGPv4)
173
Содержание S4048-ON
Страница 1: ...Dell Configuration Guide for the S4048 ON System 9 9 0 0 ...
Страница 146: ...Figure 14 BFD Three Way Handshake State Changes 146 Bidirectional Forwarding Detection BFD ...
Страница 477: ...Figure 68 Inspecting Configuration of LAG 10 on ALPHA Link Aggregation Control Protocol LACP 477 ...
Страница 480: ...Figure 70 Inspecting a LAG Port on BRAVO Using the show interface Command 480 Link Aggregation Control Protocol LACP ...
Страница 481: ...Figure 71 Inspecting LAG 10 Using the show interfaces port channel Command Link Aggregation Control Protocol LACP 481 ...
Страница 522: ...Figure 87 Configuring Interfaces for MSDP 522 Multicast Source Discovery Protocol MSDP ...
Страница 523: ...Figure 88 Configuring OSPF and BGP for MSDP Multicast Source Discovery Protocol MSDP 523 ...
Страница 524: ...Figure 89 Configuring PIM in Multiple Routing Domains 524 Multicast Source Discovery Protocol MSDP ...
Страница 528: ...Figure 91 MSDP Default Peer Scenario 1 528 Multicast Source Discovery Protocol MSDP ...
Страница 529: ...Figure 92 MSDP Default Peer Scenario 2 Multicast Source Discovery Protocol MSDP 529 ...
Страница 530: ...Figure 93 MSDP Default Peer Scenario 3 530 Multicast Source Discovery Protocol MSDP ...
Страница 633: ...Policy based Routing PBR 633 ...
Страница 777: ...Figure 119 Single and Double Tag TPID Match Service Provider Bridging 777 ...
Страница 778: ...Figure 120 Single and Double Tag First byte TPID Match 778 Service Provider Bridging ...