Network Engineering Stack Exchange is a question and answer site for network engineers. It only takes a minute to sign up.
Sign up to join this community
By default I understand that IBGP should have a full mesh implementation, otherwise route reflectors should be configured while EBGP should be directly connected to establish external neighbor, but how does BGP prevents loops by its default behavior, and how does BGP prevents slow peer and troubleshooting for this scenario?
Furthermore, does BGP dynamically advertise its routes like OSPF or the network statement command should be configured?
The BGP rule is that iBGP cannot learn an iBGP-learned route from an iBGP neighbor. That is a loop prevention mechanism. BGP will not use a route with its own AS in the AS_PATH.
I don't understand this question:
how does BGP prevents slow peer and troubleshooting for this scenario?
BGP can use redistribution, like other routing protocols, or it can use network statements, which simply tells BGP to advertise a route if that exact route exists in the router's routing table. You cannot simply add a network statement and assume BGP will advertise that prefix.
Yes, BGP advertisements are dynamic, like other routing protocols. As routes come into or leave the routing table, routes will be advertised or withdrawn, assuming proper redistribution or network statements are configured for the routes.
