Network Working Group E. Chen
Request for Comments: 5004 S. Sangli
Category: Standards Track Cisco Systems
September 2007
Avoid BGP Best Path Transitions from One External to Another
1. Introduction
The last two steps of the BGP route selection (Section 9.1.2.2, [BGP]) involve comparing the BGP identifiers and the peering addresses. The BGP identifier (treated either as an IP address or just an integer [BGP-ID]) for a BGP speaker is allocated by the Autonomous System (AS) to which the speaker belongs. As a result, for a local BGP speaker, the BGP identifier of a route received from an external peer is just a random number. When routes under consideration are from external peers, the result from the last two steps of the route selection is therefore "random" as far as the local BGP speaker is concerned.
Chen & Sangli Standards Track [Page 1]
RFC 5004 Best BGP Route Selection September 2007 2. Specification of RequirementsThe key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119 [RFC2119].
3. The Algorithm
Consider the case in which the existing best path A is from an external peer, and another external path B is then selected as the new best path by the route selection algorithm described in [BGP]. When comparing all the paths in route selection, if neither Path A nor Path B is eliminated by the route selection algorithm prior to Step f) -- BGP identifier comparison (Section 9.1.2.2, [BGP]) -- we propose that the existing best path (Path A) be kept as the best path (thus avoiding switching the best path to Path B).
4. The Benefits
The proposed extension to the BGP route selection rules avoids unnecessary best-path transitions between external paths under certain conditions. Clearly, the extension would help reduce routing and forwarding changes in a network, thus helping the overall network stability.
Chen & Sangli Standards Track [Page 2]
RFC 5004 Best BGP Route Selection September 2007
o R1, R2, R3, and R4 belong to one AS. o R1 is a route reflector with R3 as its client. o R2 is a route reflector with R4 as its client. o The IGP metrics are as listed. o External paths (a), (b), and (c) are as described in Figure 2.
+----+ 40 +----+
| R1 |--------------| R2 |
+----+ +----+
| |
| |
| 10 | 10
| |
| |
+----+ +----+
| R3 | | R4 |
+----+ +----+
/ \ |
/ \ |
Chen & Sangli Standards Track [Page 3]
RFC 5004 Best BGP Route Selection September 2007 5. RemarksThe proposed algorithm is backward-compatible, and can be deployed on a per-BGP-speaker basis. The deployment of the algorithm is highly recommended on a BGP speaker with multiple external BGP peers (especially the ones connecting to an inter-exchange point).
6. Security Considerations
This extension does not introduce any security issues.
7. Acknowledgments
The idea presented was inspired by a route oscillation case observed in the BBN/Genuity network in 1998. The algorithm was also implemented and deployed at that time.
8. Normative References
[BGP] Rekhter, Y., Ed., Li, T., Ed., and S. Hares, Ed., "A Border
9. Informative References
[BGP-ID] Chen, E. and J. Yuan, "AS-wide Unique BGP Identifier for
Chen & Sangli Standards Track [Page 4]
RFC 5004 Best BGP Route Selection September 2007
[RFC3345] McPherson, D., Gill, V., Walton, D., and A. Retana, "Border
Chen & Sangli Standards Track [Page 5]
RFC 5004 Best BGP Route Selection September 2007
Full Copyright Statement