Debian Codegraph @

rfc7911.html

raw
1 <pre>Internet Engineering Task Force (IETF) D. Walton
2 Request for Comments: 7911 Cumulus Networks
3 Category: Standards Track A. Retana
4 ISSN: 2070-1721 E. Chen
5 Cisco Systems, Inc.
6 J. Scudder
7 Juniper Networks
8 July 2016
9
10
11 <span class="h1">Advertisement of Multiple Paths in BGP</span>
12
13 Abstract
14
15 This document defines a BGP extension that allows the advertisement
16 of multiple paths for the same address prefix without the new paths
17 implicitly replacing any previous ones. The essence of the extension
18 is that each path is identified by a Path Identifier in addition to
19 the address prefix.
20
21 Status of This Memo
22
23 This is an Internet Standards Track document.
24
25 This document is a product of the Internet Engineering Task Force
26 (IETF). It represents the consensus of the IETF community. It has
27 received public review and has been approved for publication by the
28 Internet Engineering Steering Group (IESG). Further information on
29 Internet Standards is available in <a href="./rfc7841#section-2">Section&nbsp;2 of RFC 7841</a>.
30
31 Information about the current status of this document, any errata,
32 and how to provide feedback on it may be obtained at
33 <a href="http://www.rfc-editor.org/info/rfc7911">http://www.rfc-editor.org/info/rfc7911</a>.
34
35 Copyright Notice
36
37 Copyright (c) 2016 IETF Trust and the persons identified as the
38 document authors. All rights reserved.
39
40 This document is subject to <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and the IETF Trust's Legal
41 Provisions Relating to IETF Documents
42 (<a href="http://trustee.ietf.org/license-info">http://trustee.ietf.org/license-info</a>) in effect on the date of
43 publication of this document. Please review these documents
44 carefully, as they describe your rights and restrictions with respect
45 to this document. Code Components extracted from this document must
46 include Simplified BSD License text as described in Section 4.e of
47 the Trust Legal Provisions and are provided without warranty as
48 described in the Simplified BSD License.
49
50
51
52 <span class="grey">Walton, et al. Standards Track [Page 1]</span></pre>
53 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
54 <span class="grey"><a href="./rfc7911">RFC 7911</a> ADD-PATH July 2016</span>
55
56
57 Table of Contents
58
59 <a href="#section-1">1</a>. Introduction . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-2">2</a>
60 <a href="#section-1.1">1.1</a>. Specification of Requirements . . . . . . . . . . . . . . <a href="#page-2">2</a>
61 <a href="#section-2">2</a>. How to Identify a Path . . . . . . . . . . . . . . . . . . . <a href="#page-3">3</a>
62 <a href="#section-3">3</a>. Extended NLRI Encodings . . . . . . . . . . . . . . . . . . . <a href="#page-3">3</a>
63 <a href="#section-4">4</a>. ADD-PATH Capability . . . . . . . . . . . . . . . . . . . . . <a href="#page-4">4</a>
64 <a href="#section-5">5</a>. Operation . . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-4">4</a>
65 <a href="#section-6">6</a>. Deployment Considerations . . . . . . . . . . . . . . . . . . <a href="#page-5">5</a>
66 <a href="#section-7">7</a>. IANA Considerations . . . . . . . . . . . . . . . . . . . . . <a href="#page-6">6</a>
67 <a href="#section-8">8</a>. Security Considerations . . . . . . . . . . . . . . . . . . . <a href="#page-6">6</a>
68 <a href="#section-9">9</a>. References . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-6">6</a>
69 <a href="#section-9.1">9.1</a>. Normative References . . . . . . . . . . . . . . . . . . <a href="#page-6">6</a>
70 <a href="#section-9.2">9.2</a>. Informative References . . . . . . . . . . . . . . . . . <a href="#page-7">7</a>
71 Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-8">8</a>
72 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . <a href="#page-8">8</a>
73
74 <span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span>
75
76 The BGP specification [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>] defines an Update-Send Process to
77 advertise the routes chosen by the Decision Process to other BGP
78 speakers. No provisions are made to allow the advertisement of
79 multiple paths for the same address prefix or Network Layer
80 Reachability Information (NLRI). In fact, a route with the same NLRI
81 as a previously advertised route implicitly replaces the previous
82 advertisement.
83
84 This document defines a BGP extension that allows the advertisement
85 of multiple paths for the same address prefix without the new paths
86 implicitly replacing any previous ones. The essence of the extension
87 is that each path is identified by a Path Identifier in addition to
88 the address prefix.
89
90 The availability of the additional paths can help reduce or eliminate
91 persistent route oscillations [<a href="./rfc3345" title="&quot;Border Gateway Protocol (BGP) Persistent Route Oscillation Condition&quot;">RFC3345</a>]. It can also help with
92 optimal routing and routing convergence in a network by providing
93 potential alternate or backup paths, respectively.
94
95 <span class="h3"><a class="selflink" id="section-1.1" href="#section-1.1">1.1</a>. Specification of Requirements</span>
96
97 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
98 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
99 document are to be interpreted as described in [<a href="./rfc2119" title="&quot;Key words for use in RFCs to Indicate Requirement Levels&quot;">RFC2119</a>].
100
101
102
103
104
105
106
107
108 <span class="grey">Walton, et al. Standards Track [Page 2]</span></pre>
109 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
110 <span class="grey"><a href="./rfc7911">RFC 7911</a> ADD-PATH July 2016</span>
111
112
113 <span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. How to Identify a Path</span>
114
115 As defined in [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>], a path refers to the information reported in
116 the Path Attribute field of an UPDATE message. As the procedures
117 specified in [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>] allow only the advertisement of one path for a
118 particular address prefix, a path for an address prefix from a BGP
119 peer can be keyed on the address prefix.
120
121 In order for a BGP speaker to advertise multiple paths for the same
122 address prefix, a new identifier (termed "Path Identifier" hereafter)
123 needs to be introduced so that a particular path for an address
124 prefix can be identified by the combination of the address prefix and
125 the Path Identifier.
126
127 The assignment of the Path Identifier for a path by a BGP speaker is
128 purely a local matter. However, the Path Identifier MUST be assigned
129 in such a way that the BGP speaker is able to use the (Prefix, Path
130 Identifier) to uniquely identify a path advertised to a neighbor. A
131 BGP speaker that re-advertises a route MUST generate its own Path
132 Identifier to be associated with the re-advertised route. A BGP
133 speaker that receives a route should not assume that the identifier
134 carries any particular semantics.
135
136 <span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Extended NLRI Encodings</span>
137
138 In order to carry the Path Identifier in an UPDATE message, the NLRI
139 encoding MUST be extended by prepending the Path Identifier field,
140 which is of four octets.
141
142 For example, the NLRI encoding specified in [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>] is extended as
143 the following:
144
145 +--------------------------------+
146 | Path Identifier (4 octets) |
147 +--------------------------------+
148 | Length (1 octet) |
149 +--------------------------------+
150 | Prefix (variable) |
151 +--------------------------------+
152
153 The usage of the extended NLRI encodings is specified in <a href="#section-5">Section 5</a>.
154
155
156
157
158
159
160
161
162
163
164 <span class="grey">Walton, et al. Standards Track [Page 3]</span></pre>
165 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
166 <span class="grey"><a href="./rfc7911">RFC 7911</a> ADD-PATH July 2016</span>
167
168
169 <span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. ADD-PATH Capability</span>
170
171 The ADD-PATH Capability is a BGP capability [<a href="./rfc5492" title="&quot;Capabilities Advertisement with BGP-4&quot;">RFC5492</a>], with
172 Capability Code 69. The Capability Length field of this capability
173 is variable. The Capability Value field consists of one or more of
174 the following tuples:
175
176 +------------------------------------------------+
177 | Address Family Identifier (2 octets) |
178 +------------------------------------------------+
179 | Subsequent Address Family Identifier (1 octet) |
180 +------------------------------------------------+
181 | Send/Receive (1 octet) |
182 +------------------------------------------------+
183
184 The meaning and use of the fields are as follows:
185
186 Address Family Identifier (AFI):
187
188 This field is the same as the one used in [<a href="./rfc4760" title="&quot;Multiprotocol Extensions for BGP-4&quot;">RFC4760</a>].
189
190 Subsequent Address Family Identifier (SAFI):
191
192 This field is the same as the one used in [<a href="./rfc4760" title="&quot;Multiprotocol Extensions for BGP-4&quot;">RFC4760</a>].
193
194 Send/Receive:
195
196 This field indicates whether the sender is (a) able to receive
197 multiple paths from its peer (value 1), (b) able to send
198 multiple paths to its peer (value 2), or (c) both (value 3) for
199 the &lt;AFI, SAFI&gt;.
200
201 If any other value is received, then the capability SHOULD be
202 treated as not understood and ignored [<a href="./rfc5492" title="&quot;Capabilities Advertisement with BGP-4&quot;">RFC5492</a>].
203
204 A BGP speaker that wishes to indicate support for multiple AFI/SAFIs
205 MUST do so by including the information in a single instance of the
206 ADD-PATH Capability.
207
208 <span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Operation</span>
209
210 The Path Identifier specified in <a href="#section-3">Section 3</a> can be used to advertise
211 multiple paths for the same address prefix without subsequent
212 advertisements replacing the previous ones. Apart from the fact that
213 this is now possible, the route advertisement rules of [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>] are
214 not changed. In particular, a new advertisement for a given address
215 prefix and a given Path Identifier replaces a previous advertisement
216
217
218
219
220 <span class="grey">Walton, et al. Standards Track [Page 4]</span></pre>
221 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
222 <span class="grey"><a href="./rfc7911">RFC 7911</a> ADD-PATH July 2016</span>
223
224
225 for the same address prefix and Path Identifier. If a BGP speaker
226 receives a message to withdraw a prefix with a Path Identifier not
227 seen before, it SHOULD silently ignore it.
228
229 For a BGP speaker to be able to send multiple paths to its peer, that
230 BGP speaker MUST advertise the ADD-PATH Capability with the Send/
231 Receive field set to either 2 or 3, and MUST receive from its peer
232 the ADD-PATH Capability with the Send/Receive field set to either 1
233 or 3, for the corresponding &lt;AFI, SAFI&gt;.
234
235 A BGP speaker MUST follow the procedures defined in [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>] when
236 generating an UPDATE message for a particular &lt;AFI, SAFI&gt; to a peer
237 unless the BGP speaker advertises the ADD-PATH Capability to the peer
238 indicating its ability to send multiple paths for the &lt;AFI, SAFI&gt;,
239 and also receives the ADD-PATH Capability from the peer indicating
240 its ability to receive multiple paths for the &lt;AFI, SAFI&gt;, in which
241 case the speaker MUST generate a route update for the &lt;AFI, SAFI&gt;
242 based on the combination of the address prefix and the Path
243 Identifier, and use the extended NLRI encodings specified in this
244 document. The peer SHALL act accordingly in processing an UPDATE
245 message related to a particular &lt;AFI, SAFI&gt;.
246
247 A BGP speaker SHOULD include the best route [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>] when more than
248 one path is advertised to a neighbor, unless it is a path received
249 from that neighbor.
250
251 As the Path Identifiers are locally assigned, and may or may not be
252 persistent across a control plane restart of a BGP speaker, an
253 implementation SHOULD take special care so that the underlying
254 forwarding plane of a "Receiving Speaker" as described in [<a href="./rfc4724" title="&quot;Graceful Restart Mechanism for BGP&quot;">RFC4724</a>]
255 is not affected during the graceful restart of a BGP session.
256
257 <span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Deployment Considerations</span>
258
259 The extension proposed in this document provides a mechanism for a
260 BGP speaker to advertise multiple paths over a BGP session. Care
261 needs to be taken in its deployment to ensure consistent routing and
262 forwarding in a network [<a href="#ref-ADDPATH" title="&quot;Best Practices for Advertisement of Multiple Paths in IBGP&quot;">ADDPATH</a>].
263
264 The only explicit indication that the encoding described in <a href="#section-3">Section 3</a>
265 is in use in a particular BGP session is the exchange of Capabilities
266 described in <a href="#section-4">Section 4</a>. If the exchange is successful [<a href="./rfc5492" title="&quot;Capabilities Advertisement with BGP-4&quot;">RFC5492</a>],
267 then the BGP speakers will be able to process all BGP UPDATES
268 properly, as described in <a href="#section-5">Section 5</a>. However, if, for example, a
269 packet analyzer is used on the wire to examine an active BGP session,
270 it may not be able to properly decode the BGP UPDATES because it
271 lacks prior knowledge of the exchanged Capabilities.
272
273
274
275
276 <span class="grey">Walton, et al. Standards Track [Page 5]</span></pre>
277 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
278 <span class="grey"><a href="./rfc7911">RFC 7911</a> ADD-PATH July 2016</span>
279
280
281 When deployed as a provider edge router or a peering router that
282 interacts with external neighbors, a BGP speaker usually advertises
283 at most one path to the internal neighbors in a network. In the case
284 where the speaker is configured to advertise multiple paths to the
285 internal neighbors, and additional information is needed for the
286 application, the speaker could use attributes such as the
287 Edge_Discriminator attribute [<a href="#ref-FAST" title="&quot;Fast Connectivity Restoration Using BGP Add-path&quot;">FAST</a>]. The use of that type of
288 additional information is outside the scope of this document.
289
290 <span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. IANA Considerations</span>
291
292 IANA has assigned the value 69 for the ADD-PATH Capability described
293 in this document. This registration is in the "Capability Codes"
294 registry.
295
296 <span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Security Considerations</span>
297
298 This document defines a BGP extension that allows the advertisement
299 of multiple paths for the same address prefix without the new paths
300 implicitly replacing any previous ones. As a result, multiple paths
301 for a large number of prefixes may be received by a BGP speaker,
302 potentially depleting memory resources or even causing network-wide
303 instability, which can be considered a denial-of-service attack.
304 Note that this is not a new vulnerability, but one that is present in
305 the base BGP specification [<a href="./rfc4272" title="&quot;BGP Security Vulnerabilities Analysis&quot;">RFC4272</a>].
306
307 The use of the ADD-PATH Capability is intended to address specific
308 needs related to, for example, eliminating route oscillations that
309 were induced by the MULTI_EXIT_DISC (MED) attribute [<a href="#ref-STOP-OSC" title="&quot;BGP Persistent Route Oscillation Solutions&quot;">STOP-OSC</a>].
310 While describing the applications for the ADD-PATH Capability is
311 outside the scope of this document, users are encouraged to examine
312 their behavior and potential impact by studying the best practices
313 described in [<a href="#ref-ADDPATH" title="&quot;Best Practices for Advertisement of Multiple Paths in IBGP&quot;">ADDPATH</a>].
314
315 Security concerns in the base operation of BGP [<a href="./rfc4271" title="&quot;A Border Gateway Protocol 4 (BGP-4)&quot;">RFC4271</a>] also apply.
316
317 <span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. References</span>
318
319 <span class="h3"><a class="selflink" id="section-9.1" href="#section-9.1">9.1</a>. Normative References</span>
320
321 [<a id="ref-RFC2119">RFC2119</a>] Bradner, S., "Key words for use in RFCs to Indicate
322 Requirement Levels", <a href="https://www.rfc-editor.org/bcp/bcp14">BCP 14</a>, <a href="./rfc2119">RFC 2119</a>,
323 DOI 10.17487/RFC2119, March 1997,
324 &lt;<a href="http://www.rfc-editor.org/info/rfc2119">http://www.rfc-editor.org/info/rfc2119</a>&gt;.
325
326
327
328
329
330
331
332 <span class="grey">Walton, et al. Standards Track [Page 6]</span></pre>
333 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
334 <span class="grey"><a href="./rfc7911">RFC 7911</a> ADD-PATH July 2016</span>
335
336
337 [<a id="ref-RFC4271">RFC4271</a>] Rekhter, Y., Ed., Li, T., Ed., and S. Hares, Ed., "A
338 Border Gateway Protocol 4 (BGP-4)", <a href="./rfc4271">RFC 4271</a>,
339 DOI 10.17487/RFC4271, January 2006,
340 &lt;<a href="http://www.rfc-editor.org/info/rfc4271">http://www.rfc-editor.org/info/rfc4271</a>&gt;.
341
342 [<a id="ref-RFC4760">RFC4760</a>] Bates, T., Chandra, R., Katz, D., and Y. Rekhter,
343 "Multiprotocol Extensions for BGP-4", <a href="./rfc4760">RFC 4760</a>,
344 DOI 10.17487/RFC4760, January 2007,
345 &lt;<a href="http://www.rfc-editor.org/info/rfc4760">http://www.rfc-editor.org/info/rfc4760</a>&gt;.
346
347 [<a id="ref-RFC5492">RFC5492</a>] Scudder, J. and R. Chandra, "Capabilities Advertisement
348 with BGP-4", <a href="./rfc5492">RFC 5492</a>, DOI 10.17487/RFC5492, February
349 2009, &lt;<a href="http://www.rfc-editor.org/info/rfc5492">http://www.rfc-editor.org/info/rfc5492</a>&gt;.
350
351 <span class="h3"><a class="selflink" id="section-9.2" href="#section-9.2">9.2</a>. Informative References</span>
352
353 [<a id="ref-ADDPATH">ADDPATH</a>] Uttaro, J., Francois, P., Patel, K., Haas, J., Simpson,
354 A., and R. Fragassi, "Best Practices for Advertisement of
355 Multiple Paths in IBGP", Work in Progress,
356 <a href="./draft-ietf-idr-add-paths-guidelines-08">draft-ietf-idr-add-paths-guidelines-08</a>, April 2016.
357
358 [<a id="ref-FAST">FAST</a>] Mohapatra, P., Fernando, R., Filsfils, C., and R. Raszuk,
359 "Fast Connectivity Restoration Using BGP Add-path", Work
360 in Progress, <a href="./draft-pmohapat-idr-fast-conn-restore-03">draft-pmohapat-idr-fast-conn-restore-03</a>,
361 January 2013.
362
363 [<a id="ref-RFC3345">RFC3345</a>] McPherson, D., Gill, V., Walton, D., and A. Retana,
364 "Border Gateway Protocol (BGP) Persistent Route
365 Oscillation Condition", <a href="./rfc3345">RFC 3345</a>, DOI 10.17487/RFC3345,
366 August 2002, &lt;<a href="http://www.rfc-editor.org/info/rfc3345">http://www.rfc-editor.org/info/rfc3345</a>&gt;.
367
368 [<a id="ref-RFC4272">RFC4272</a>] Murphy, S., "BGP Security Vulnerabilities Analysis",
369 <a href="./rfc4272">RFC 4272</a>, DOI 10.17487/RFC4272, January 2006,
370 &lt;<a href="http://www.rfc-editor.org/info/rfc4272">http://www.rfc-editor.org/info/rfc4272</a>&gt;.
371
372 [<a id="ref-RFC4724">RFC4724</a>] Sangli, S., Chen, E., Fernando, R., Scudder, J., and Y.
373 Rekhter, "Graceful Restart Mechanism for BGP", <a href="./rfc4724">RFC 4724</a>,
374 DOI 10.17487/RFC4724, January 2007,
375 &lt;<a href="http://www.rfc-editor.org/info/rfc4724">http://www.rfc-editor.org/info/rfc4724</a>&gt;.
376
377 [<a id="ref-STOP-OSC">STOP-OSC</a>] Walton, D., Retana, A., Chen, E., and J. Scudder, "BGP
378 Persistent Route Oscillation Solutions", Work in Progress,
379 <a href="./draft-ietf-idr-route-oscillation-stop-03">draft-ietf-idr-route-oscillation-stop-03</a>, April 2016.
380
381
382
383
384
385
386
387
388 <span class="grey">Walton, et al. Standards Track [Page 7]</span></pre>
389 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
390 <span class="grey"><a href="./rfc7911">RFC 7911</a> ADD-PATH July 2016</span>
391
392
393 Acknowledgments
394
395 We would like to thank David Cook and Naiming Shen for their
396 contributions to the design and development of the extension.
397
398 Many people have made valuable comments and suggestions, including
399 Rex Fernando, Eugene Kim, Danny McPherson, Dave Meyer, Pradosh
400 Mohapatra, Keyur Patel, Robert Raszuk, Eric Rosen, Srihari Sangli,
401 Dan Tappan, Mark Turner, Jeff Haas, Jay Borkenhagen, Mach Chen, Denis
402 Ovsienko, Carlos Pignataro, Meral Shirazipour, and Kathleen Moriarty.
403
404 Authors' Addresses
405
406 Daniel Walton
407 Cumulus Networks
408 185 E. Dana Street
409 Mountain View, CA 94041
410 United States of America
411
412 Email: [email protected]
413
414
415 Alvaro Retana
416 Cisco Systems, Inc.
417 Kit Creek Rd.
418 Research Triangle Park, NC 27709
419 United States of America
420
421 Email: [email protected]
422
423
424 Enke Chen
425 Cisco Systems, Inc.
426 170 W. Tasman Dr.
427 San Jose, CA 95134
428 United States of America
429
430 Email: [email protected]
431
432
433 John Scudder
434 Juniper Networks
435 1194 N. Mathilda Ave
436 Sunnyvale, CA 94089
437 United States of America
438
439 Email: [email protected]
440
441
442
443
444 Walton, et al. Standards Track [Page 8]
445 </pre>