Debian Codegraph @

rfc5298.html

raw
1 <pre>Network Working Group T. Takeda, Ed.
2 Request for Comments: 5298 NTT
3 Category: Informational A. Farrel, Ed.
4 Old Dog Consulting
5 Y. Ikejiri
6 NTT Communications
7 JP. Vasseur
8 Cisco Systems, Inc.
9 August 2008
10
11
12 <span class="h1">Analysis of Inter-Domain Label Switched Path (LSP) Recovery</span>
13
14 Status of This Memo
15
16 This memo provides information for the Internet community. It does
17 not specify an Internet standard of any kind. Distribution of this
18 memo is unlimited.
19
20 Abstract
21
22 Protection and recovery are important features of service offerings
23 in Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS)
24 networks. Increasingly, MPLS and GMPLS networks are being extended
25 from single domain scope to multi-domain environments.
26
27 Various schemes and processes have been developed to establish Label
28 Switched Paths (LSPs) in multi-domain environments. These are
29 discussed in <a href="./rfc4726">RFC 4726</a>: "A Framework for Inter-Domain Multiprotocol
30 Label Switching Traffic Engineering".
31
32 This document analyzes the application of these techniques to
33 protection and recovery in multi-domain networks. The main focus for
34 this document is on establishing end-to-end diverse Traffic
35 Engineering (TE) LSPs in multi-domain networks.
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52 <span class="grey">Takeda, et al. Informational [Page 1]</span></pre>
53 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
54 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
55
56
57 Table of Contents
58
59 <a href="#section-1">1</a>. Introduction ....................................................<a href="#page-3">3</a>
60 <a href="#section-1.1">1.1</a>. Terminology ................................................<a href="#page-3">3</a>
61 <a href="#section-1.2">1.2</a>. Domain .....................................................<a href="#page-4">4</a>
62 <a href="#section-1.3">1.3</a>. Document Scope .............................................<a href="#page-5">5</a>
63 <a href="#section-1.4">1.4</a>. Note on Other Recovery Techniques ..........................<a href="#page-6">6</a>
64 <a href="#section-1.5">1.5</a>. Signaling Options ..........................................<a href="#page-6">6</a>
65 <a href="#section-2">2</a>. Diversity in Multi-Domain Networks ..............................<a href="#page-6">6</a>
66 <a href="#section-2.1">2.1</a>. Multi-Domain Network Topology ..............................<a href="#page-7">7</a>
67 <a href="#section-2.2">2.2</a>. Note on Domain Diversity ...................................<a href="#page-8">8</a>
68 <a href="#section-3">3</a>. Factors to Consider .............................................<a href="#page-9">9</a>
69 <a href="#section-3.1">3.1</a>. Scalability versus Optimality ..............................<a href="#page-9">9</a>
70 <a href="#section-3.2">3.2</a>. Key Concepts ..............................................<a href="#page-10">10</a>
71 <a href="#section-4">4</a>. Diverse LSP Setup Schemes without Confidentiality ..............<a href="#page-12">12</a>
72 <a href="#section-4.1">4.1</a>. Management Configuration ..................................<a href="#page-12">12</a>
73 <a href="#section-4.2">4.2</a>. Head-End Path Computation (with Multi-Domain Visibility) ..12
74 <a href="#section-4.3">4.3</a>. Per-Domain Path Computation ...............................<a href="#page-12">12</a>
75 <a href="#section-4.3.1">4.3.1</a>. Sequential Path Computation ........................<a href="#page-13">13</a>
76 <a href="#section-4.3.2">4.3.2</a>. Simultaneous Path Computation ......................<a href="#page-14">14</a>
77 <a href="#section-4.4">4.4</a>. Inter-Domain Collaborative Path Computation ...............<a href="#page-15">15</a>
78 <a href="#section-4.4.1">4.4.1</a>. Sequential Path Computation ........................<a href="#page-15">15</a>
79 <a href="#section-4.4.2">4.4.2</a>. Simultaneous Path Computation ......................<a href="#page-15">15</a>
80 <a href="#section-5">5</a>. Diverse LSP Setup Schemes with Confidentiality .................<a href="#page-16">16</a>
81 <a href="#section-5.1">5.1</a>. Management Configuration ..................................<a href="#page-17">17</a>
82 <a href="#section-5.2">5.2</a>. Head-End Path Computation (with Multi-Domain Visibility) ..17
83 <a href="#section-5.3">5.3</a>. Per-Domain Path Computation ...............................<a href="#page-17">17</a>
84 <a href="#section-5.3.1">5.3.1</a>. Sequential Path Computation ........................<a href="#page-18">18</a>
85 <a href="#section-5.3.2">5.3.2</a>. Simultaneous Path Computation ......................<a href="#page-19">19</a>
86 <a href="#section-5.4">5.4</a>. Inter-Domain Collaborative Path Computation ...............<a href="#page-20">20</a>
87 <a href="#section-5.4.1">5.4.1</a>. Sequential Path Computation ........................<a href="#page-20">20</a>
88 <a href="#section-5.4.2">5.4.2</a>. Simultaneous Path Computation ......................<a href="#page-20">20</a>
89 <a href="#section-6">6</a>. Network Topology Specific Considerations .......................<a href="#page-20">20</a>
90 <a href="#section-7">7</a>. Addressing Considerations ......................................<a href="#page-21">21</a>
91 <a href="#section-8">8</a>. Note on SRLG Diversity .........................................<a href="#page-21">21</a>
92 <a href="#section-9">9</a>. Security Considerations ........................................<a href="#page-21">21</a>
93 <a href="#section-10">10</a>. References ....................................................<a href="#page-22">22</a>
94 <a href="#section-10.1">10.1</a>. Normative References .....................................<a href="#page-22">22</a>
95 <a href="#section-10.2">10.2</a>. Informative References ...................................<a href="#page-22">22</a>
96 <a href="#section-11">11</a>. Acknowledgements ..............................................<a href="#page-25">25</a>
97
98
99
100
101
102
103
104
105
106
107
108 <span class="grey">Takeda, et al. Informational [Page 2]</span></pre>
109 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
110 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
111
112
113 <span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Introduction</span>
114
115 Protection and recovery in Multiprotocol Label Switching (MPLS) and
116 Generalized MPLS (GMPLS) networks are described in [<a href="./rfc4428" title="&quot;Analysis of Generalized Multi-Protocol Label Switching (GMPLS)-based Recovery Mechanisms (including Protection and Restoration)&quot;">RFC4428</a>]. These
117 are important features for service delivery in MPLS and GMPLS
118 networks.
119
120 MPLS and GMPLS networks were originally limited to single domain
121 environments. Increasingly, multi-domain MPLS and GMPLS networks are
122 being considered, where a domain is considered to be any collection
123 of network elements within a common sphere of address management or
124 path computational responsibility. Examples of such domains include
125 Interior Gateway Protocol (IGP) areas and Autonomous Systems (ASes).
126
127 [<a id="ref-RFC4726">RFC4726</a>] provides a framework for inter-domain MPLS and GMPLS
128 traffic engineering. It introduces and discusses the various schemes
129 and processes to establish Label Switched Paths (LSPs) in multi-
130 domain environments.
131
132 However, protection and recovery introduce additional complexities to
133 LSP establishment. Protection LSPs are generally required to be path
134 diverse from the working LSPs that they protect. Achieving this is
135 particularly challenging in multi-domain environments because no
136 single path computation or planning point is capable of determining
137 path diversity for both paths from one end to the other.
138
139 This document analyzes various schemes to realize MPLS and GMPLS LSP
140 recovery in multi-domain networks. The main focus for this document
141 is on establishing end-to-end diverse Traffic Engineering (TE) LSPs
142 in multi-domain networks.
143
144 <span class="h3"><a class="selflink" id="section-1.1" href="#section-1.1">1.1</a>. Terminology</span>
145
146 The reader is assumed to be familiar with the terminology for LSP
147 recovery set out in [<a href="./rfc4427" title="&quot;Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS)&quot;">RFC4427</a>], and with the terms introduced in
148 [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>] that provides a framework for inter-domain Label Switched
149 Path (LSP) setup. Key terminology may also be found in [<a href="./rfc4216" title="&quot;MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) Requirements&quot;">RFC4216</a>]
150 that sets out requirements for inter-AS MPLS traffic engineering.
151
152 The following key terms from those sources are used within this
153 document.
154
155 - Domain: See [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>]. A domain is considered to be any collection
156 of network elements within a common sphere of address management or
157 path computational responsibility. Note that nested domains
158 continue to be out of scope. <a href="#section-1.2">Section 1.2</a> provides additional
159 details.
160
161
162
163
164 <span class="grey">Takeda, et al. Informational [Page 3]</span></pre>
165 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
166 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
167
168
169 - Working LSP: See [<a href="./rfc4427" title="&quot;Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS)&quot;">RFC4427</a>]. The working LSP transports normal user
170 traffic. Note that the term LSP and TE LSP will be used
171 interchangeably.
172
173 - Recovery LSP: See [<a href="./rfc4427" title="&quot;Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS)&quot;">RFC4427</a>]. The recovery LSP transports normal
174 user traffic when the working LSP fails. The recovery LSP may also
175 carry user traffic even when the working LSP is operating normally
176 and transporting the user traffic (e.g., 1+1 protection). The
177 recovery LSP is sometimes referred to as a protecting LSP.
178
179 - Diversity: See [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>]. Diversity means the relationship of
180 multiple LSPs, where those LSPs do not share some specific type of
181 resource (e.g., link, node, or shared risk link group (SRLG)).
182 Diversity is also referred to as disjointness.
183
184 Diverse LSPs may be used for various purposes, such as load-
185 balancing and recovery. In this document, the recovery aspect of
186 diversity, specifically the end-to-end diversity of two traffic
187 engineering (TE) LSPs, is the focus. The two diverse LSPs are
188 referred to as the working LSP and recovery LSP.
189
190 - Confidentiality: See [<a href="./rfc4216" title="&quot;MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) Requirements&quot;">RFC4216</a>]. Confidentiality refers to the
191 protection of information about the topology and resources of one
192 domain from visibility by people or applications outside that
193 domain.
194
195 <span class="h3"><a class="selflink" id="section-1.2" href="#section-1.2">1.2</a>. Domain</span>
196
197 In order to fully understand the issues addressed in this document,
198 it is necessary to carefully define and scope the term "domain".
199
200 As defined in [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>], a domain is considered to be any collection
201 of network elements within a common sphere of address management or
202 path computational responsibility. Examples of such domains include
203 IGP areas and Autonomous Systems. Networks accessed over the GMPLS
204 User-to-Network Interface (UNI) [<a href="./rfc4208" title="&quot;Generalized Multiprotocol Label Switching (GMPLS) User-Network Interface (UNI): Resource ReserVation Protocol-Traffic Engineering (RSVP-TE) Support for the Overlay Model&quot;">RFC4208</a>], and Layer One Virtual
205 Private Networks (L1VPNs) [<a href="./rfc4847" title="&quot;Framework and Requirements for Layer 1 Virtual Private Networks&quot;">RFC4847</a>] are special cases of multi-domain
206 networks.
207
208 Example motivations for using more than one domain include
209 administrative separation, scalability, and the construction of
210 domains for the purpose of providing protection. These latter
211 "protection domains" offer edge-to-edge protection facilities for
212 spans or segments of end-to-end LSPs.
213
214
215
216
217
218
219
220 <span class="grey">Takeda, et al. Informational [Page 4]</span></pre>
221 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
222 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
223
224
225 As described in [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>], there could be TE parameters (such as
226 color and priority) whose meanings are specific to each domain. In
227 such scenarios, in order to set up inter-domain LSPs, mapping
228 functions may be needed to transform the TE parameters based on
229 policy agreements between domain administrators.
230
231 <span class="h3"><a class="selflink" id="section-1.3" href="#section-1.3">1.3</a>. Document Scope</span>
232
233 This document analyzes various schemes to realize MPLS and GMPLS LSP
234 recovery in multi-domain networks. It is based on the existing
235 framework for multi-domain LSP setup [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>]. Note that this
236 document does not prevent the development of additional techniques
237 where appropriate (i.e., additional to the ones described in this
238 document). In other words, this document shows how the existing
239 techniques can be applied.
240
241 There are various recovery techniques for LSPs. For TE LSPs, the
242 major techniques are end-to-end recovery [<a href="./rfc4872" title="&quot;RSVP-TE Extensions in Support of End-to-End Generalized Multi-Protocol Label Switching (GMPLS) Recovery&quot;">RFC4872</a>], local protection
243 such as Fast Reroute (FRR) [<a href="./rfc4090" title="&quot;Fast Reroute Extensions to RSVP-TE for LSP Tunnels&quot;">RFC4090</a>] (in packet switching
244 environments), and segment recovery [<a href="./rfc4873" title="&quot;GMPLS Segment Recovery&quot;">RFC4873</a>] (in GMPLS).
245
246 The main focus of this document is the analysis of diverse TE LSP
247 setup schemes that can be used in the context of end-to-end recovery.
248 The methodology is to show different combinations of functional
249 elements such as path computation and signaling techniques.
250
251 [<a id="ref-RFC4105">RFC4105</a>] and [<a href="./rfc4216" title="&quot;MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) Requirements&quot;">RFC4216</a>] describe requirements for diverse LSPs.
252 There are various types of diversity, and this document focuses on
253 node, link, and shared risk link group (SRLG) diversity.
254
255 Recovery LSPs may be used for 1+1 protection, 1:1 protection, or
256 shared mesh restoration. However, the requirements for path
257 diversity, the ways to compute diverse paths, and the signaling of
258 these TE LSPs are common across all uses. These topics are the main
259 scope of this document.
260
261 Note that diverse LSPs may be used for various purposes in addition
262 to recovery. An example is for load-balancing, so as to limit the
263 traffic disruption to a portion of the traffic flow in case of a
264 single node failure. This document does not preclude use of diverse
265 LSP setup schemes for other purposes.
266
267 The following are beyond the scope of this document.
268
269 - Analysis of recovery techniques other than the use of link, node,
270 or SRLG diverse LSPs (see <a href="#section-1.4">Section 1.4</a>).
271
272
273
274
275
276 <span class="grey">Takeda, et al. Informational [Page 5]</span></pre>
277 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
278 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
279
280
281 - Details of maintenance of diverse LSPs, such as re-optimization and
282 Operations and Maintenance (OAM).
283
284 - Comparative evaluation of LSP setup schemes.
285
286 <span class="h3"><a class="selflink" id="section-1.4" href="#section-1.4">1.4</a>. Note on Other Recovery Techniques</span>
287
288 Fast Reroute and segment recovery in multi-domain networks are
289 described in <a href="./rfc4726#section-5.4">Section&nbsp;5.4 of [RFC4726]</a>, and a more detailed analysis
290 is provided in <a href="./rfc5151#section-5">Section&nbsp;5 of [RFC5151]</a>. This document does not cover
291 any additional analysis for Fast Reroute and segment recovery in
292 multi-domain networks.
293
294 The recovery type of an LSP or service may change at a domain
295 boundary. That is, the recovery type could remain the same within
296 one domain, but might be different in the next domain or on the
297 connections between domains. This may be due to the capabilities of
298 each domain, administrative policies, or to topology limitations. An
299 example is where protection at the domain boundary is provided by
300 link protection on the inter-domain links, but where protection
301 within each domain is achieved through segment recovery. This
302 mixture of protection techniques is beyond the scope of this
303 document.
304
305 Domain diversity (that is, the selection of paths that have only the
306 ingress and egress domains in common) may be considered as one form
307 of diversity in multi-domain networks, but this is beyond the scope
308 of this document (see <a href="#section-2.2">Section 2.2</a>).
309
310 <span class="h3"><a class="selflink" id="section-1.5" href="#section-1.5">1.5</a>. Signaling Options</span>
311
312 There are three signaling options for establishing inter-domain TE
313 LSPs: nesting, contiguous LSPs, and stitching [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>]. The
314 description in this document of diverse LSP setup is agnostic in
315 relation to the signaling option used, unless otherwise specified.
316
317 Note that signaling option considerations for Fast Reroute and
318 segment recovery are described in [<a href="./rfc5151" title="&quot;Inter-Domain MPLS and GMPLS Traffic Engineering -- Resource Reservation Protocol-Traffic Engineering (RSVP-TE) Extensions&quot;">RFC5151</a>].
319
320 <span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Diversity in Multi-Domain Networks</span>
321
322 This section describes some assumptions about achieving path
323 diversity in multi-domain networks.
324
325
326
327
328
329
330
331
332 <span class="grey">Takeda, et al. Informational [Page 6]</span></pre>
333 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
334 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
335
336
337 <span class="h3"><a class="selflink" id="section-2.1" href="#section-2.1">2.1</a>. Multi-Domain Network Topology</span>
338
339 Figures 1 and 2 show examples of multi-domain network topologies. In
340 Figure 1, domains are connected in a linear topology. There are
341 multiple paths between nodes A and L, but all of them cross domain#1-
342 domain#2-domain#3 in that order.
343
344 +--Domain#1--+ +--Domain#2--+ +--Domain#3--+
345 | | | | | |
346 | B------+---+---D-----E--+---+------J |
347 | / | | \ / | | \ |
348 | / | | \ / | | \ |
349 | A | | H | | L |
350 | \ | | / \ | | / |
351 | \ | | / \ | | / |
352 | C------+---+---F-----G--+---+------K |
353 | | | | | |
354 +------------+ +------------+ +------------+
355
356 Figure 1: Linear Domain Connectivity
357
358
359 +-----Domain#2-----+
360 | |
361 | E--------------F |
362 | | | |
363 | | | |
364 +-+--------------+-+
365 | |
366 | |
367 +--Domain#1-+--+ +-------+------+
368 | | | | | |
369 | | | | | |
370 | A----B--+---+--C----D |
371 | | | | | |
372 | | | | | |
373 +------+-------+ +--+-Domain#4--+
374 | |
375 +-+--------------+-+
376 | | | |
377 | | | |
378 | G--------------H |
379 | |
380 +-----Domain#3-----+
381
382 Figure 2: Meshed Domain Connectivity
383
384
385
386
387
388 <span class="grey">Takeda, et al. Informational [Page 7]</span></pre>
389 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
390 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
391
392
393 In Figure 2, domains are connected in a mesh topology. There are
394 multiple paths between nodes A and D, and these paths do not cross
395 the same domains. If inter-domain connectivity forms a mesh,
396 domain-level routing is required (even for the unprotected case).
397 This is tightly coupled with the next-hop domain resolution/discovery
398 mechanisms used in IP networks.
399
400 In this document, we assume that domain-level routing is given via
401 configuration, policy, or some external mechanism, and that this is
402 not part of the path computation process described later in this
403 document.
404
405 Domain-level routing may also allow "domain re-entry" where a path
406 re-enters a domain that it has previously exited (e.g., domain#X-
407 domain#Y-domain#X). This requires specific considerations when
408 confidentiality (described in <a href="#section-3.2">Section 3.2</a>) is required, and is beyond
409 the scope of this document.
410
411 Furthermore, the working LSP and the recovery LSP may or may not be
412 routed along the same set of domains in the same order. In this
413 document, we assume that the working LSP and recovery LSP follow the
414 same set of domains in the same order (via configuration, policy or
415 some external mechanism). That is, we assume that the domain mesh
416 topology is reduced to a linear domain topology for each pair of
417 working and recovery LSPs.
418
419 In summary,
420
421 - There is no assumption about the multi-domain network topology.
422 For example, there could be more than two domain boundary nodes or
423 inter-domain links (links connecting a pair of domain boundary
424 nodes belonging to different domains).
425
426 - It is assumed that in a multi-domain topology, the sequence of
427 domains that the working LSP and the recovery LSP follow must be
428 the same and is pre-configured.
429
430 - Domain re-entry is out of scope and is not considered further.
431
432 <span class="h3"><a class="selflink" id="section-2.2" href="#section-2.2">2.2</a>. Note on Domain Diversity</span>
433
434 As described in <a href="#section-1.4">Section 1.4</a>, domain diversity means the selection of
435 paths that have only the ingress and egress domains in common. This
436 may provide enhanced resilience against failures, and is a way to
437 ensure path diversity for most of the path of the LSP.
438
439
440
441
442
443
444 <span class="grey">Takeda, et al. Informational [Page 8]</span></pre>
445 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
446 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
447
448
449 In <a href="#section-2.1">Section 2.1</a>, we assumed that the working LSP and the recovery LSP
450 follow the same set of domains in the same order. Under this
451 assumption, domain diversity cannot be achieved. However, by
452 relaxing this assumption, domain diversity could be achieved, e.g.,
453 by either of the following schemes.
454
455 - Consider domain diversity as a special case of SRLG diversity
456 (i.e., assign an SRLG ID to each domain).
457
458 - Configure domain-level routing to provide domain-diverse paths
459 (e.g., by means of AS_PATH in BGP).
460
461 Further details of the operation of domain diversity are beyond the
462 scope of this document.
463
464 <span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Factors to Consider</span>
465
466 <span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Scalability versus Optimality</span>
467
468 As described in [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>], scalability and optimality are two
469 conflicting objectives. Note that the meaning of optimality differs
470 depending on each network operation. Some examples of optimality in
471 the context of diverse LSPs are:
472
473 - Minimizing the sum of their cost while maintaining diversity.
474
475 - Restricting the difference of their costs (for example, so as to
476 minimize the delay difference after switch-over) while maintaining
477 diversity.
478
479 By restricting TE information distribution to only within each domain
480 (and not across domain boundaries) as required by [<a href="./rfc4105" title="&quot;Requirements for Inter-Area MPLS Traffic Engineering&quot;">RFC4105</a>] and
481 [<a href="./rfc4216" title="&quot;MPLS Inter-Autonomous System (AS) Traffic Engineering (TE) Requirements&quot;">RFC4216</a>], it may not be possible to compute an optimal path. As
482 such, it might not be possible to compute diverse paths, even if they
483 exist. However, if we assume domain-level routing is given (as
484 discussed in <a href="#section-2">Section 2</a>), it would be possible to compute diverse
485 paths using specific computation schemes, if such paths exist. This
486 is discussed further in <a href="#section-4">Section 4</a>.
487
488
489
490
491
492
493
494
495
496
497
498
499
500 <span class="grey">Takeda, et al. Informational [Page 9]</span></pre>
501 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
502 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
503
504
505 <span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>. Key Concepts</span>
506
507 Three key concepts to classify various diverse LSP computation and
508 setup schemes are presented below.
509
510 o With or without confidentiality
511
512 - Without confidentiality
513
514 It is possible to specify a path across multiple domains in
515 signaling (by means of the Resource Reservation Protocol-TE
516 (RSVP-TE) Explicit Route Object (ERO)), and to obtain record of
517 the inter-domain path used (by means of the RSVP-TE Record Route
518 Object (RRO)). In this case, it is clear that one domain has
519 control over the path followed in another domain, and that the
520 path actually used in one domain is visible from within another
521 domain.
522
523 Examples of this configuration are multi-area networks, and some
524 forms of multi-AS networks (especially within the same provider).
525 In these cases, there is no requirement for confidentiality.
526
527 - With confidentiality
528
529 Where confidentiality of domain topology and operational policy
530 is required, it is not possible to specify or obtain a full path
531 across other domains. Partial paths may be specified and
532 reported using domain identifiers or the addresses of domain
533 border routers in the EROs and RROs.
534
535 Examples of this configuration are some forms of multi-AS
536 networks (especially inter-provider networks), GMPLS-UNI
537 networks, and L1VPNs.
538
539 o Multi-domain path computation, per-domain path computation, and
540 inter-domain collaborative path computation
541
542 - Multi-domain path computation
543
544 If a single network element can see the topology of all domains
545 along the path, it is able to compute a full end-to-end path.
546 Clearly, this is only possible where confidentiality is not
547 required.
548
549 Such a network element might be the head-end Label Switching
550 Router (LSR), a Path Computation Element (PCE) [<a href="./rfc4655" title="&quot;A Path Computation Element (PCE)-Based Architecture&quot;">RFC4655</a>], or a
551 Network Management System (NMS). This mode of path computation
552 is discussed in Sections <a href="#section-4">4</a> and <a href="#section-5">5</a>.
553
554
555
556 <span class="grey">Takeda, et al. Informational [Page 10]</span></pre>
557 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span>
558 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
559
560
561 - Per-domain path computation
562
563 The path of an LSP may be computed domain-by-domain as LSP
564 signaling progresses through the network. This scheme requires
565 ERO expansion in each domain to construct the next segment of the
566 path toward the destination. The establishment of unprotected
567 LSPs in this way is covered in [<a href="./rfc5152" title="&quot;A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs)&quot;">RFC5152</a>].
568
569 - Inter-domain collaborative path computation
570
571 In this scheme, path computation is typically done before
572 signaling and uses communication between cooperating PCEs. An
573 example of such a scheme is Backward Recursive Path Computation
574 (BRPC) [<a href="#ref-BRPC" title="&quot;A Backward Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Inter-Domain Traffic Engineering Label Switched Paths&quot;">BRPC</a>].
575
576 It is possible to combine multiple path computation techniques
577 (including using a different technique for the working and
578 recovery LSPs), but details are beyond the scope of this
579 document.
580
581 o Sequential path computation or simultaneous path computation
582
583 - Sequential path computation
584
585 The path of the working LSP is computed without considering the
586 recovery LSP, and then the path of the recovery LSP is computed.
587 This scheme is applicable when the recovery LSP is added later as
588 a change to the service grade, but may also be used when both the
589 working and recovery LSPs are established from the start.
590
591 Using this approach, it may not be possible to find diverse paths
592 for the LSPs in "trap" topologies. Furthermore, such sequential
593 path computation approaches reduce the likelihood of selecting an
594 "optimal" solution with regards to a specific objective function.
595
596 - Simultaneous path computation
597
598 The path of the working LSP and the path of the recovery LSP are
599 computed simultaneously. In this scheme, it is possible to avoid
600 trap conditions and it may be more possible to achieve an optimal
601 result.
602
603 Note that LSP setup, with or without confidentiality, depends on per-
604 domain configuration. The choice of per-domain path computation or
605 inter-domain collaborative path computation, and the choice between
606 sequential path computation or simultaneous path computation can be
607 determined for each individual pair of working/recovery LSPs.
608
609
610
611
612 <span class="grey">Takeda, et al. Informational [Page 11]</span></pre>
613 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span>
614 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
615
616
617 The analysis of various diverse LSP setup schemes is described in
618 Sections <a href="#section-4">4</a> and <a href="#section-5">5</a>, based on the concepts set out above.
619
620 Some other considerations, such as network topology-specific
621 considerations, addressing considerations, and SRLG diversity are
622 described in Sections <a href="#section-6">6</a>, <a href="#section-7">7</a>, and <a href="#section-8">8</a>.
623
624 <span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Diverse LSP Setup Schemes without Confidentiality</span>
625
626 This section examines schemes for diverse LSP setup based on
627 different path computation techniques assuming that there is no
628 requirement for domain confidentiality. <a href="#section-5">Section 5</a> makes a similar
629 examination of schemes where domain confidentiality is required.
630
631 <span class="h3"><a class="selflink" id="section-4.1" href="#section-4.1">4.1</a>. Management Configuration</span>
632
633 [<a id="ref-RFC4726">RFC4726</a>] describes this path computation technique where the full
634 explicit paths for the working and recovery LSPs are specified by a
635 management application at the head-end, and no further computation or
636 signaling considerations are needed.
637
638 <span class="h3"><a class="selflink" id="section-4.2" href="#section-4.2">4.2</a>. Head-End Path Computation (with Multi-Domain Visibility)</span>
639
640 <a href="./rfc4726#section-3.2.1">Section&nbsp;3.2.1 [RFC4726]</a> describes this path computation technique.
641 The full explicit paths for the working and recovery LSPs are
642 computed at the head-end either by the head-end itself or by a PCE.
643 In either case, the computing entity has full TE visibility across
644 multiple domains and no further computation or signaling
645 considerations are needed.
646
647 <span class="h3"><a class="selflink" id="section-4.3" href="#section-4.3">4.3</a>. Per-Domain Path Computation</span>
648
649 Sections <a href="#section-3.2.2">3.2.2</a>, <a href="#section-3.2.3">3.2.3</a>, and <a href="#section-3.3">3.3</a> of [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>] describe this path
650 computation technique. More detailed procedures are described in
651 [<a href="./rfc5152" title="&quot;A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs)&quot;">RFC5152</a>].
652
653 In this scheme, the explicit paths of the working and recovery LSPs
654 are specified as the complete strict paths through the source domain
655 followed by either of the following:
656
657 - The complete list of boundary LSRs or domain identifiers (e.g.,
658 AS numbers) along the paths.
659
660 - The LSP destination.
661
662 Thus, in order to navigate each domain, the path must be expanded at
663 each domain boundary, i.e., per-domain. This path computation is
664 performed by the boundary LSR or by a PCE on its behalf.
665
666
667
668 <span class="grey">Takeda, et al. Informational [Page 12]</span></pre>
669 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span>
670 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
671
672
673 There are two schemes for establishing diverse LSPs using per-domain
674 computation. These are described Sections <a href="#section-4.3.1">4.3.1</a> and <a href="#section-4.3.2">4.3.2</a>.
675
676 <span class="h4"><a class="selflink" id="section-4.3.1" href="#section-4.3.1">4.3.1</a>. Sequential Path Computation</span>
677
678 As previously noted, the main issue with sequential path computation
679 is that diverse paths cannot be guaranteed. Where a per-domain path
680 computation scheme is applied, the computation of second path needs
681 to be aware of the path used by the first path in order that path
682 diversity can be attempted.
683
684 The RSVP-TE EXCLUDE_ROUTE Object (XRO) [<a href="./rfc4874" title="&quot;Exclude Routes - Extension to Resource ReserVation Protocol-Traffic Engineering (RSVP-TE)&quot;">RFC4874</a>] can be used when the
685 second path is signaled to report the details of the first path. It
686 should be noted that the PRIMARY_PATH_ROUTE Object defined in
687 [<a href="./rfc4872" title="&quot;RSVP-TE Extensions in Support of End-to-End Generalized Multi-Protocol Label Switching (GMPLS) Recovery&quot;">RFC4872</a>] for end-to-end protection is not intended as a path
688 exclusion mechanism and should not be used for this purpose.
689
690 The process for sequential path computation is as follows:
691
692 - The working LSP is established using per-domain path computation
693 as described in [<a href="./rfc5152" title="&quot;A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs)&quot;">RFC5152</a>]. The path of the working LSP is
694 available at the head-end through the RSVP-TE RRO since domain
695 confidentiality is not required.
696
697 - The path of the recovery LSP across the first domain is computed
698 excluding the resources used by the working LSP within that
699 domain. If a PCE is used, the resources to be avoided can be
700 passed to the PCE using the Exclude Route Object (XRO) extensions
701 to the PCE Protocol [<a href="#ref-PCEP-XRO" title="&quot;Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions&quot;">PCEP-XRO</a>], [<a href="#ref-PCEP" title="&quot;Path Computation Element (PCE) Communication Protocol (PCEP)&quot;">PCEP</a>].
702
703 - The recovery LSP is now signaled across the first domain as
704 usual, but the path of the working LSP is also conveyed in an
705 RSVP-TE XRO. The XRO lists nodes, links and SRLGs that must be
706 avoided by the LSP being signaled, and its contents are copied
707 from the RRO of the working LSP.
708
709 - At each subsequent domain boundary, a segment of the path of the
710 recovery LSP can be computed across the new domain excluding the
711 resources indicated in the RSVP-TE XRO.
712
713 This scheme cannot guarantee to establish diverse LSPs (even if they
714 could exist) because the first (working) LSP is established without
715 consideration of the need for a diverse recovery LSP. It is possible
716 to modify the path of the working LSP using the crankback techniques
717 [<a href="./rfc4920" title="&quot;Crankback Signaling Extensions for MPLS and GMPLS RSVP-TE&quot;">RFC4920</a>] if the setup of the recovery LSP is blocked or if some
718 resources are shared.
719
720
721
722
723
724 <span class="grey">Takeda, et al. Informational [Page 13]</span></pre>
725 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span>
726 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
727
728
729 Note that, even if a solution is found, the degree of optimality of
730 the solution (i.e., of the set of diverse TE LSPs) might not be
731 maximal.
732
733 <span class="h4"><a class="selflink" id="section-4.3.2" href="#section-4.3.2">4.3.2</a>. Simultaneous Path Computation</span>
734
735 Simultaneous path computation gives a better likelihood of finding a
736 pair of diverse paths as the diversity requirement forms part of the
737 computation process. In per-domain path computation mechanisms,
738 there are several aspects to consider.
739
740 Simultaneous path computation means that the paths of the working and
741 recovery LSPs are computed at the same time. Since we are
742 considering per-domain path computation, these two paths must be
743 computed at the boundary of each domain.
744
745 The process for simultaneous path computation is as follows:
746
747 - The ingress LSR (or a PCE) computes a pair of diverse paths
748 across the first domain. If a PCE is used, PCEP offers the
749 ability to request disjoint paths.
750
751 - The working LSP is signaled across the first domain as usual, but
752 must carry with it the requirement for a disjoint recovery LSP
753 and the information about the path already computed for the
754 recovery LSP across the first domain. In particular, the domain
755 boundary node used by the recovery LSP must be reported.
756
757 - Each domain boundary router, in turn, computes a pair of disjoint
758 paths across the next domain. The working LSP is signaled as
759 usual, and the computed path of the recovery LSP is collected in
760 the signaling messages.
761
762 - When the working LSP has been set up, the full path of the
763 recovery LSP is returned to the head-end LSR in the signaling
764 messages for the working LSP. This allows the head-end LSR to
765 signal the recovery LSP using a full path without the need for
766 further path computation.
767
768 Note that the signaling protocol mechanisms do not currently exist to
769 collect the path of the recovery LSP during the signaling of the
770 working LSP. Definition of protocol mechanisms are beyond the scope
771 of this document, but it is believed that such mechanisms would be
772 simple to define and implement.
773
774 Note also that the mechanism described is still not able to guarantee
775 the selection of diverse paths even where they exist since, when
776 domains are multiply interconnected, the determination of diverse
777
778
779
780 <span class="grey">Takeda, et al. Informational [Page 14]</span></pre>
781 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span>
782 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
783
784
785 end-to-end paths may depend on the correct selection of inter-domain
786 links. Crankback [<a href="./rfc4920" title="&quot;Crankback Signaling Extensions for MPLS and GMPLS RSVP-TE&quot;">RFC4920</a>] may also be used in combination with this
787 scheme to improve the chances of success.
788
789 Note that even if a solution is found, the degree of optimality of
790 the solution (i.e., set of diverse TE LSPs) might not be maximal.
791
792 <span class="h3"><a class="selflink" id="section-4.4" href="#section-4.4">4.4</a>. Inter-Domain Collaborative Path Computation</span>
793
794 Collaborative path computation requires the cooperation between PCEs
795 that are responsible for different domains. This approach is
796 described in <a href="./rfc4726#section-3.4">Section&nbsp;3.4 of [RFC4726]</a>. Backward recursive path
797 computation (BRPC) [<a href="#ref-BRPC" title="&quot;A Backward Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Inter-Domain Traffic Engineering Label Switched Paths&quot;">BRPC</a>] provides a collaborative path computation
798 technique where the paths of LSPs are fully determined by
799 communication between PCEs before the LSPs are established. Two ways
800 to use BRPC for diverse LSPs are described in the following sections.
801
802 <span class="h4"><a class="selflink" id="section-4.4.1" href="#section-4.4.1">4.4.1</a>. Sequential Path Computation</span>
803
804 In sequential path computation, the path of the working LSP is
805 computed using BRPC as described in [<a href="#ref-BRPC" title="&quot;A Backward Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Inter-Domain Traffic Engineering Label Switched Paths&quot;">BRPC</a>]. The path of the recovery
806 LSP is then computed also using BRPC with the addition that the path
807 of the working LSP is explicitly excluded using the XRO route
808 exclusion techniques described in [<a href="#ref-PCEP-XRO" title="&quot;Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions&quot;">PCEP-XRO</a>].
809
810 In this case, the working LSP could be set up before or after the
811 path of the recovery LSP is computed. In the latter case, the actual
812 path of the working LSP as reported in the RSVP-TE RRO should be used
813 when computing the path of the recovery LSP.
814
815 This scheme cannot guarantee to establish diverse LSPs (even if they
816 exist) because the working LSP may block the recovery LSP. In such a
817 scenario, re-optimization of the working and recovery LSPs may be
818 used to achieve fully diverse paths.
819
820 <span class="h4"><a class="selflink" id="section-4.4.2" href="#section-4.4.2">4.4.2</a>. Simultaneous Path Computation</span>
821
822 In simultaneous path computation, the PCEs collaborate to compute the
823 paths of both the working and the recovery LSPs at the same time.
824 Since both LSPs are computed in a single pass, the LSPs can be
825 signaled simultaneously of sequentially according to the preference
826 of the head-end LSR.
827
828
829
830
831
832
833
834
835
836 <span class="grey">Takeda, et al. Informational [Page 15]</span></pre>
837 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span>
838 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
839
840
841 Collaborative simultaneous path computation is achieved using the
842 Synchronization Vector (SVEC) object in the PCE Protocol [<a href="#ref-PCEP" title="&quot;Path Computation Element (PCE) Communication Protocol (PCEP)&quot;">PCEP</a>].
843 This object allows two computation requests to be associated and made
844 dependent. The coordination of multiple computation requests within
845 the BRPC mechanism is not described in [<a href="#ref-BRPC" title="&quot;A Backward Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Inter-Domain Traffic Engineering Label Switched Paths&quot;">BRPC</a>]. It is believed that
846 it is possible to specify procedures for such coordination, but the
847 development of new procedures is outside the scope of this document.
848
849 This scheme can guarantee to establish diverse LSPs where they are
850 possible, assuming that domain-level routing is pre-determined as
851 described in <a href="#section-2">Section 2</a>. Furthermore, the computed set of TE LSPs can
852 be guaranteed to be optimal with respect to some objective functions.
853
854 <span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. Diverse LSP Setup Schemes with Confidentiality</span>
855
856 In the context of this section, the term confidentiality applies to
857 the protection of information about the topology and resources
858 present within one domain from visibility by people or applications
859 outside that domain. This includes, but is not limited to, recording
860 of LSP routes, and the advertisements of TE information. The
861 confidentiality does not apply to the protection of user traffic.
862
863 Diverse LSP setup schemes with confidentiality are similar to ones
864 without confidentiality. However, several additional mechanisms are
865 needed to preserve confidentiality. Examples of such mechanisms are:
866
867 - Path key: A path key is used in place of a segment of the path of
868 an LSP when the LSP is signaled, when the path of the LSP is
869 reported by signaling, or when the LSP's path is generated by a
870 PCE. This allows the exact path of the LSP to remain
871 confidential through the substitution of "confidential path
872 segments" (CPSs) by these path keys.
873
874 [<a id="ref-PCE-PATH-KEY">PCE-PATH-KEY</a>] describes how path keys can be used by PCEs to
875 preserve path confidentiality, and [<a href="#ref-RSVP-PATH-KEY" title="&quot;RSVP Extensions for Path Key Support&quot;">RSVP-PATH-KEY</a>] explains how
876 path keys are used in signaling. Note that if path keys are
877 signaled in RSVP-TE EROs they must be expanded so that the
878 signaling can proceed. This expansion normally takes place when
879 the first node in the CPS is reached. The expansion of the path
880 key would normally be carried out by the PCE that generated the
881 key, and for that reason, the path key contains an identifier of
882 the PCE (the PCE-ID).
883
884 - LSP segment: LSP segments can be pre-established across domains
885 according to some management policy. The LSP segments can be
886 used to support end-to-end LSPs as hierarchical LSPs [<a href="./rfc4206" title="&quot;Label Switched Paths (LSP) Hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Engineering (TE)&quot;">RFC4206</a>] or
887 as LSP stitching segments [<a href="./rfc5150" title="&quot;Label Switched Path Stitching with Generalized Multiprotocol Label Switching Traffic Engineering (GMPLS TE)&quot;">RFC5150</a>].
888
889
890
891
892 <span class="grey">Takeda, et al. Informational [Page 16]</span></pre>
893 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span>
894 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
895
896
897 The end-to-end LSPs are signaled indicating just the series of
898 domains or domain border routers. Upon entry to each domain, an
899 existing trans-domain LSP is selected and used to carry the end-
900 to-end LSP across the domain.
901
902 Note that although the LSP segments are described as being pre-
903 established, they could be set up on demand on receipt of the
904 request for the end-to-end LSP at the domain border.
905
906 It is also worth noting that in schemes that result in a single
907 contiguous end-to-end LSP (without LSP tunneling or stitching),
908 the same concept of LSP segments may apply provided that ERO
909 expansion is applied at domain boundaries and that the path of
910 the LSP is not reported in the RSVP-TE RRO.
911
912 These techniques may be applied directly or may require protocol
913 extensions depending on the specific diverse LSP setup schemes
914 described below. Note that in the schemes below, the paths of the
915 working and recovery LSPs are not impacted by the confidentiality
916 requirements.
917
918 <span class="h3"><a class="selflink" id="section-5.1" href="#section-5.1">5.1</a>. Management Configuration</span>
919
920 Although management systems may exist that can determine end-to-end
921 paths even in the presence of domain confidentiality, the full paths
922 cannot be provided to the head-end LSR for LSP signaling as this
923 would break the confidentiality requirements.
924
925 Thus, for LSPs that are configured through management applications,
926 the end-to-end path must either be constructed using LSP segments
927 that cross the domains, or communicated to the head-end LSR with the
928 use of path keys.
929
930 <span class="h3"><a class="selflink" id="section-5.2" href="#section-5.2">5.2</a>. Head-End Path Computation (with Multi-Domain Visibility)</span>
931
932 It is not possible for the head-end LSR to compute the full end-to-
933 end path of an inter-domain LSP when domain confidentiality is in use
934 because the LSR will not have any TE information about the other
935 domains.
936
937 <span class="h3"><a class="selflink" id="section-5.3" href="#section-5.3">5.3</a>. Per-Domain Path Computation</span>
938
939 Per-domain path computation for working and recovery LSPs is
940 practical with domain confidentiality. As when there are no
941 confidentiality restrictions, we can separate the cases of sequential
942 and simultaneous path computation.
943
944
945
946
947
948 <span class="grey">Takeda, et al. Informational [Page 17]</span></pre>
949 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span>
950 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
951
952
953 <span class="h4"><a class="selflink" id="section-5.3.1" href="#section-5.3.1">5.3.1</a>. Sequential Path Computation</span>
954
955 In sequential path computation, we can assume that the working LSP
956 has its path computed and is set up using the normal per-domain
957 technique as described in [<a href="./rfc5152" title="&quot;A Per-Domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs)&quot;">RFC5152</a>]. However, because of
958 confidentiality issues, the full path of the working LSP is not
959 returned in the signaling messages and is not available to the head-
960 end LSR.
961
962 To compute a disjoint path for the recovery LSP, each domain border
963 node needs to know the path of the working LSP within the domain to
964 which it provides entry. This is easy for the ingress LSR as it has
965 access to the RSVP-TE RRO within first domain. In subsequent
966 domains, the process requires that the path of the working LSP is
967 somehow made available to the domain border router as the recovery
968 LSP is signaled. Note that the working and recovery LSPs do not use
969 the same border routers if the LSPs are node or SRLG diverse.
970
971 There are several possible mechanisms to achieve this.
972
973 - Path keys could be used in the RRO for the working LSP. As the
974 signaling messages are propagated back towards the head-end LSR,
975 each domain border router substitutes a path key for the segment
976 of the working LSP's path within its domain. Thus, the RRO
977 received at the head-end LSR consists of the path within the
978 initial domain followed by a series of path keys.
979
980 When the recovery LSP is signaled, the path keys can be included
981 in the ERO as exclusions. Each domain border router in turn can
982 expand the path key for its domain and know which resources must
983 be avoided. PCEP provides a protocol that can be used to request
984 the expansion of the path key from the domain border router used
985 by the working LSP, or from some third party such as a PCE.
986
987 - Instead of using path keys, each confidential path segment in the
988 RRO of the working LSP could be encrypted by the domain border
989 routers. These encrypted segments would appear as exclusions in
990 the ERO for the recovery LSP and could be decrypted by the domain
991 border routers.
992
993 No mechanism currently exists in RSVP-TE for this function, which
994 would probably assume a domain-wide encryption key.
995
996 - The identity of the working LSP could be included in the XRO of
997 the recovery LSP to indicate that a disjoint path must be found.
998
999 This option could require a simple extension to the current XRO
1000 specification [<a href="./rfc4874" title="&quot;Exclude Routes - Extension to Resource ReserVation Protocol-Traffic Engineering (RSVP-TE)&quot;">RFC4874</a>] to allow LSP identifiers to be included.
1001
1002
1003
1004 <span class="grey">Takeda, et al. Informational [Page 18]</span></pre>
1005 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span>
1006 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1007
1008
1009 It could also use the Association Object [<a href="./rfc4872" title="&quot;RSVP-TE Extensions in Support of End-to-End Generalized Multi-Protocol Label Switching (GMPLS) Recovery&quot;">RFC4872</a>] to identify
1010 the working LSP.
1011
1012 This scheme would also need a way for a domain border router to
1013 find the path of an LSP within its domain. An efficient way to
1014 achieve this would be to also include the domain border router
1015 used by the working LSP in the signaling for the recovery LSP,
1016 but other schemes based on management applications or stateful
1017 PCEs might also be developed.
1018
1019 Clearly, the details of this alternative have not been specified.
1020
1021 <span class="h4"><a class="selflink" id="section-5.3.2" href="#section-5.3.2">5.3.2</a>. Simultaneous Path Computation</span>
1022
1023 In per-domain simultaneous path computation the path of the recovery
1024 LSP is computed at the same time as the working LSP (i.e., as the
1025 working LSP is signaled). The computed path of the recovery LSP is
1026 propagated to the head-end LSR as part of the signaling process for
1027 the working LSP, but confidentiality must be maintained, so the full
1028 path cannot be returned. There are two options as follows.
1029
1030 - LSP segment: As the signaling of the working LSP progresses and
1031 the path of the recovery LSP is computed domain-by-domain,
1032 trans-domain LSPs can be set up for use by the recovery LSP.
1033 When the recovery LSP is signaled, it will pick up these LSP
1034 segments and use them for tunneling or stitching.
1035
1036 This mechanism needs coordination through the management plane
1037 between domain border routers so that a router on the working
1038 path can request the establishment of an LSP segment for use by
1039 the protection path. This could be achieved through the TE MIB
1040 modules [<a href="./rfc3812" title="&quot;Multiprotocol Label Switching (MPLS) Traffic Engineering (TE) Management Information Base (MIB)&quot;">RFC3812</a>], [<a href="./rfc4802" title="&quot;Generalized Multiprotocol Label Switching (GMPLS) Traffic Engineering Management Information Base&quot;">RFC4802</a>].
1041
1042 Furthermore, when the recovery LSP is signaled it needs to be
1043 sure to pick up the correct LSP segment. Therefore, some form of
1044 LSP segment identifier needs to be reported in the signaling of
1045 the working LSP and propagated in the signaling of the recovery
1046 LSP. Mechanisms for this do not currently exist, but would be
1047 relatively simple to construct.
1048
1049 Alternatively, the LSP segments could be marked as providing
1050 protection for the working LSP. In this case, the recovery LSP
1051 can be signaled with the identifier of the working LSP using the
1052 Association Object [<a href="./rfc4872" title="&quot;RSVP-TE Extensions in Support of End-to-End Generalized Multi-Protocol Label Switching (GMPLS) Recovery&quot;">RFC4872</a>] enabling the correct LSP segments to
1053 be selected.
1054
1055
1056
1057
1058
1059
1060 <span class="grey">Takeda, et al. Informational [Page 19]</span></pre>
1061 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span>
1062 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1063
1064
1065 - Path key: The path of the recovery LSP can be determined and
1066 returned to the head-end LSR just described in <a href="#section-4.4.2">Section 4.4.2</a>, but
1067 each CPS is replaced by a path key. As the recovery path is
1068 signaled each path key is expanded, domain-by-domain to achieve
1069 the correct path. This requires that the entity that computes
1070 the path of the recovery LSP (domain border LSR or PCE) is
1071 stateful.
1072
1073 <span class="h3"><a class="selflink" id="section-5.4" href="#section-5.4">5.4</a> Inter-Domain Collaborative Path Computation</span>
1074
1075 Cooperative collaboration between PCEs is also applicable when domain
1076 confidentiality is required.
1077
1078 <span class="h4"><a class="selflink" id="section-5.4.1" href="#section-5.4.1">5.4.1</a>. Sequential Path Computation</span>
1079
1080 In sequential cooperative path computation, the path of the working
1081 LSP is determined first using a mechanism such as BRPC. Since domain
1082 confidentiality is in use, the path returned may contain path keys.
1083
1084 When the path of the recovery LSP is computed (which may be before or
1085 after the working LSP is signaled) the path exclusions supplied to
1086 the PCE and exchanged between PCEs must use path keys as described in
1087 [<a href="#ref-PCEP-XRO" title="&quot;Extensions to the Path Computation Element Communication Protocol (PCEP) for Route Exclusions&quot;">PCEP-XRO</a>].
1088
1089 <span class="h4"><a class="selflink" id="section-5.4.2" href="#section-5.4.2">5.4.2</a>. Simultaneous Path Computation</span>
1090
1091 As described in <a href="#section-4.4.2">Section 4.4.2</a>, diverse path computation can be
1092 requested using the PCEP SVEC Object [<a href="#ref-PCEP" title="&quot;Path Computation Element (PCE) Communication Protocol (PCEP)&quot;">PCEP</a>], and BRPC could be
1093 extended for inter-domain diverse path computation. However, to
1094 conform to domain confidentiality requirements, path keys must be
1095 used in the paths returned by the PCEs and signaled by RSVP-TE.
1096
1097 Note that the LSP segment approach may not be applicable here because
1098 a path cannot be determined until BRPC procedures are completed.
1099
1100 <span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. Network Topology Specific Considerations</span>
1101
1102 In some specific network topologies the schemes for setting up
1103 diverse LSPs could be significantly simplified.
1104
1105 For example, consider the L1VPN or GMPLS UNI case. This may be
1106 viewed as a linear sequence of three domains where the first and last
1107 domains contain only a single node each. In such a scenario, no BRPC
1108 procedures are needed, because there is no need for path computation
1109 in the first and last domains even if the source and destination
1110 nodes are multi-homed.
1111
1112
1113
1114
1115
1116 <span class="grey">Takeda, et al. Informational [Page 20]</span></pre>
1117 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span>
1118 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1119
1120
1121 <span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Addressing Considerations</span>
1122
1123 All of the schemes described in this document are applicable when a
1124 single address space is used across all domains.
1125
1126 There may also be cases where private address spaces are used within
1127 some of the domains. This problem is similar to the use of domain
1128 confidentiality since the ERO and RRO are meaningless outside a
1129 domain even if they are available, and the problem can be solved
1130 using the same techniques.
1131
1132 <span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Note on SRLG Diversity</span>
1133
1134 The schemes described in this document are applicable when the nodes
1135 and links in different domains belong to different SRLGs, which is
1136 normally the case.
1137
1138 However, it is possible that nodes or links in different domains
1139 belong to the same SRLG. That is, an SRLG may span domain
1140 boundaries. In such cases, in order to establish SRLG diverse LSPs,
1141 several considerations are needed:
1142
1143 - Record of the SRLGs used by the working LSP.
1144
1145 - Indication of a set of SRLGs to exclude in the computation of the
1146 recovery LSP's path.
1147
1148 In this case, there is a conflict between any requirement for domain
1149 confidentiality, and the requirement for SRLG diversity. One of the
1150 requirements must be compromised.
1151
1152 Furthermore, SRLG IDs may be assigned independently in each domain,
1153 and might not have global meaning. In such a scenario, some mapping
1154 functions are necessary, similar to the mapping of other TE
1155 parameters mentioned in <a href="#section-1.2">Section 1.2</a>.
1156
1157 <span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. Security Considerations</span>
1158
1159 The core protocols used to achieve the procedures described in this
1160 document are RSVP-TE and PCEP. These protocols include policy and
1161 authentication capabilities as described in [<a href="./rfc3209" title="&quot;RSVP-TE: Extensions to RSVP for LSP Tunnels&quot;">RFC3209</a>] and [<a href="#ref-PCEP" title="&quot;Path Computation Element (PCE) Communication Protocol (PCEP)&quot;">PCEP</a>].
1162 Furthermore, these protocols may be operated using more advanced
1163 security features such as IPsec [<a href="./rfc4301" title="&quot;Security Architecture for the Internet Protocol&quot;">RFC4301</a>] and TLS [<a href="./rfc4346" title="&quot;The Transport Layer Security (TLS) Protocol Version 1.1&quot;">RFC4346</a>].
1164
1165 Security may be regarded as particularly important in inter-domain
1166 deployments and serious consideration should be given to applying the
1167 available security techniques, as described in the documents
1168 referenced above and as set out in [<a href="./rfc4726" title="&quot;A Framework for Inter-Domain Multiprotocol Label Switching Traffic Engineering&quot;">RFC4726</a>].
1169
1170
1171
1172 <span class="grey">Takeda, et al. Informational [Page 21]</span></pre>
1173 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span>
1174 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1175
1176
1177 Additional discussion of security considerations for MPLG/GMPLS
1178 networks can be found in [<a href="#ref-SECURITY-FW" title="&quot; Security Framework for MPLS and GMPLS Networks&quot;">SECURITY-FW</a>].
1179
1180 This document does not of itself require additional security measures
1181 and does not modify the trust model implicit in the protocols used.
1182 Note, however, that domain confidentiality (that is the
1183 confidentiality of the topology and path information from within any
1184 one domain) is an important consideration in this document, and a
1185 significant number of the mechanisms described in this document are
1186 designed to preserve domain confidentiality.
1187
1188 <span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>. References</span>
1189
1190 <span class="h3"><a class="selflink" id="section-10.1" href="#section-10.1">10.1</a>. Normative References</span>
1191
1192 [<a id="ref-RFC3209">RFC3209</a>] Awduche, D., Berger, L., Gan, D., Li, T.,
1193 Srinivasan, V., and G. Swallow, "RSVP-TE: Extensions
1194 to RSVP for LSP Tunnels", <a href="./rfc3209">RFC 3209</a>, December 2001.
1195
1196 [<a id="ref-RFC4216">RFC4216</a>] Zhang, R., Ed., and J.-P. Vasseur, Ed., "MPLS
1197 Inter-Autonomous System (AS) Traffic Engineering
1198 (TE) Requirements", <a href="./rfc4216">RFC 4216</a>, November 2005.
1199
1200 [<a id="ref-RFC4427">RFC4427</a>] Mannie, E., Ed., and D. Papadimitriou, Ed.,
1201 "Recovery (Protection and Restoration) Terminology
1202 for Generalized Multi-Protocol Label Switching
1203 (GMPLS)", <a href="./rfc4427">RFC 4427</a>, March 2006.
1204
1205 [<a id="ref-RFC4726">RFC4726</a>] Farrel, A., Vasseur, J.-P., and A. Ayyangar, "A
1206 Framework for Inter-Domain Multiprotocol Label
1207 Switching Traffic Engineering", <a href="./rfc4726">RFC 4726</a>, November
1208 2006.
1209
1210 <span class="h3"><a class="selflink" id="section-10.2" href="#section-10.2">10.2</a>. Informative References</span>
1211
1212 [<a id="ref-RFC3812">RFC3812</a>] Srinivasan, C., Viswanathan, A., and T. Nadeau,
1213 "Multiprotocol Label Switching (MPLS) Traffic
1214 Engineering (TE) Management Information Base (MIB)",
1215 <a href="./rfc3812">RFC 3812</a>, June 2004.
1216
1217 [<a id="ref-RFC4090">RFC4090</a>] Pan, P., Ed., Swallow, G., Ed., and A. Atlas, Ed.,
1218 "Fast Reroute Extensions to RSVP-TE for LSP
1219 Tunnels", <a href="./rfc4090">RFC 4090</a>, May 2005.
1220
1221 [<a id="ref-RFC4105">RFC4105</a>] Le Roux, J.-L., Ed., Vasseur, J.-P., Ed., and J.
1222 Boyle, Ed., "Requirements for Inter-Area MPLS
1223 Traffic Engineering", <a href="./rfc4105">RFC 4105</a>, June 2005.
1224
1225
1226
1227
1228 <span class="grey">Takeda, et al. Informational [Page 22]</span></pre>
1229 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-23" ></span>
1230 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1231
1232
1233 [<a id="ref-RFC4206">RFC4206</a>] Kompella, K. and Y. Rekhter, "Label Switched Paths
1234 (LSP) Hierarchy with Generalized Multi-Protocol
1235 Label Switching (GMPLS) Traffic Engineering (TE)",
1236 <a href="./rfc4206">RFC 4206</a>, October 2005.
1237
1238 [<a id="ref-RFC4208">RFC4208</a>] Swallow, G., Drake, J., Ishimatsu, H., and Y.
1239 Rekhter, "Generalized Multiprotocol Label Switching
1240 (GMPLS) User-Network Interface (UNI): Resource
1241 ReserVation Protocol-Traffic Engineering (RSVP-TE)
1242 Support for the Overlay Model", <a href="./rfc4208">RFC 4208</a>, October
1243 2005.
1244
1245 [<a id="ref-RFC4301">RFC4301</a>] Kent, S. and K. Seo, "Security Architecture for the
1246 Internet Protocol", <a href="./rfc4301">RFC 4301</a>, December 2005.
1247
1248 [<a id="ref-RFC4346">RFC4346</a>] Dierks, T. and E. Rescorla, "The Transport Layer
1249 Security (TLS) Protocol Version 1.1", <a href="./rfc4346">RFC 4346</a>,
1250 April 2006.
1251
1252 [<a id="ref-RFC4428">RFC4428</a>] Papadimitriou, D., Ed., and E. Mannie, Ed.,
1253 "Analysis of Generalized Multi-Protocol Label
1254 Switching (GMPLS)-based Recovery Mechanisms
1255 (including Protection and Restoration)", <a href="./rfc4428">RFC 4428</a>,
1256 March 2006.
1257
1258 [<a id="ref-RFC4655">RFC4655</a>] Farrel, A., Vasseur, J.-P., and J. Ash, "A Path
1259 Computation Element (PCE)-Based Architecture", <a href="./rfc4655">RFC</a>
1260 <a href="./rfc4655">4655</a>, August 2006.
1261
1262 [<a id="ref-RFC4802">RFC4802</a>] Nadeau, T., Ed., and A. Farrel, Ed., "Generalized
1263 Multiprotocol Label Switching (GMPLS) Traffic
1264 Engineering Management Information Base", <a href="./rfc4802">RFC 4802</a>,
1265 February 2007.
1266
1267 [<a id="ref-RFC4847">RFC4847</a>] Takeda, T., Ed., "Framework and Requirements for
1268 Layer 1 Virtual Private Networks", <a href="./rfc4847">RFC 4847</a>, April
1269 2007.
1270
1271 [<a id="ref-RFC4872">RFC4872</a>] Lang, J., Ed., Rekhter, Y., Ed., and D.
1272 Papadimitriou, Ed., "RSVP-TE Extensions in Support
1273 of End-to-End Generalized Multi-Protocol Label
1274 Switching (GMPLS) Recovery", <a href="./rfc4872">RFC 4872</a>, May 2007.
1275
1276 [<a id="ref-RFC4873">RFC4873</a>] Berger, L., Bryskin, I., Papadimitriou, D., and A.
1277 Farrel, "GMPLS Segment Recovery", <a href="./rfc4873">RFC 4873</a>, May
1278 2007.
1279
1280
1281
1282
1283
1284 <span class="grey">Takeda, et al. Informational [Page 23]</span></pre>
1285 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-24" ></span>
1286 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1287
1288
1289 [<a id="ref-RFC4874">RFC4874</a>] Lee, CY., Farrel, A., and S. De Cnodder, "Exclude
1290 Routes - Extension to Resource ReserVation
1291 Protocol-Traffic Engineering (RSVP-TE)", <a href="./rfc4874">RFC 4874</a>,
1292 April 2007.
1293
1294 [<a id="ref-RFC4920">RFC4920</a>] Farrel, A., Ed., Satyanarayana, A., Iwata, A.,
1295 Fujita, N., and G. Ash, "Crankback Signaling
1296 Extensions for MPLS and GMPLS RSVP-TE", <a href="./rfc4920">RFC 4920</a>,
1297 July 2007.
1298
1299 [<a id="ref-RFC5150">RFC5150</a>] Ayyangar, A., Kompella, K., Vasseur, JP., and A.
1300 Farrel, "Label Switched Path Stitching with
1301 Generalized Multiprotocol Label Switching Traffic
1302 Engineering (GMPLS TE)", <a href="./rfc5150">RFC 5150</a>, February 2008.
1303
1304 [<a id="ref-RFC5151">RFC5151</a>] Farrel, A., Ed., Ayyangar, A., and JP. Vasseur,
1305 "Inter-Domain MPLS and GMPLS Traffic Engineering --
1306 Resource Reservation Protocol-Traffic Engineering
1307 (RSVP-TE) Extensions", <a href="./rfc5151">RFC 5151</a>, February 2008.
1308
1309 [<a id="ref-RFC5152">RFC5152</a>] Vasseur, JP., Ed., Ayyangar, A., Ed., and R. Zhang,
1310 "A Per-Domain Path Computation Method for
1311 Establishing Inter-Domain Traffic Engineering (TE)
1312 Label Switched Paths (LSPs)", <a href="./rfc5152">RFC 5152</a>, February
1313 2008.
1314
1315 [<a id="ref-BRPC">BRPC</a>] Vasseur, JP., Ed., Zhang, R., Bitar, N., and JL. Le
1316 Roux, "A Backward Recursive PCE-Based Computation
1317 (BRPC) Procedure to Compute Shortest Inter-Domain
1318 Traffic Engineering Label Switched Paths", Work in
1319 Progress, April 2008.
1320
1321 [<a id="ref-PCE-PATH-KEY">PCE-PATH-KEY</a>] Bradford, R., Vasseur, JP., and A. Farrel,
1322 "Preserving Topology Confidentiality in Inter-Domain
1323 Path Computation Using a Key-Based Mechanism", Work
1324 in Progress, May 2008.
1325
1326 [<a id="ref-PCEP">PCEP</a>] Vasseur, JP., Ed., and JL. Le Roux, Ed., "Path
1327 Computation Element (PCE) Communication Protocol
1328 (PCEP)", Work in Progress, March 2008.
1329
1330 [<a id="ref-PCEP-XRO">PCEP-XRO</a>] Oki, E., Takeda, T., and A. Farrel, "Extensions to
1331 the Path Computation Element Communication Protocol
1332 (PCEP) for Route Exclusions", Work in Progress, July
1333 2008.
1334
1335
1336
1337
1338
1339
1340 <span class="grey">Takeda, et al. Informational [Page 24]</span></pre>
1341 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-25" ></span>
1342 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1343
1344
1345 [<a id="ref-RSVP-PATH-KEY">RSVP-PATH-KEY</a>] Bradford, R., Vasseur, JP., and A. Farrel, "RSVP
1346 Extensions for Path Key Support", Work in Progress,
1347 May 2008.
1348
1349 [<a id="ref-SECURITY-FW">SECURITY-FW</a>] Fang, L., Ed., " Security Framework for MPLS and
1350 GMPLS Networks", Work in Progress, July 2008.
1351
1352 <span class="h2"><a class="selflink" id="section-11" href="#section-11">11</a>. Acknowledgments</span>
1353
1354 The authors would like to thank Eiji Oki, Ichiro Inoue, Kazuhiro
1355 Fujihara, Dimitri Papadimitriou, and Meral Shirazipour for valuable
1356 comments. Deborah Brungard provided useful advice about the text.
1357
1358 Authors' Addresses
1359
1360 Tomonori Takeda
1361 NTT Network Service Systems Laboratories, NTT Corporation
1362 3-9-11, Midori-Cho
1363 Musashino-Shi, Tokyo 180-8585 Japan
1364 EMail : [email protected]
1365
1366 Yuichi Ikejiri
1367 NTT Communications Corporation
1368 Tokyo Opera City Tower 3-20-2 Nishi Shinjuku, Shinjuku-ku
1369 Tokyo 163-1421, Japan
1370 EMail: [email protected]
1371
1372 Adrian Farrel
1373 Old Dog Consulting
1374 EMail: [email protected]
1375
1376 Jean-Philippe Vasseur
1377 Cisco Systems, Inc.
1378 300 Beaver Brook Road
1379 Boxborough, MA 01719
1380 USA
1381 EMail: [email protected]
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396 <span class="grey">Takeda, et al. Informational [Page 25]</span></pre>
1397 <hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-26" ></span>
1398 <span class="grey"><a href="./rfc5298">RFC 5298</a> Analysis of Inter-Domain LSP Recovery August 2008</span>
1399
1400
1401 Full Copyright Statement
1402
1403 Copyright (C) The IETF Trust (2008).
1404
1405 This document is subject to the rights, licenses and restrictions
1406 contained in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a>, and except as set forth therein, the authors
1407 retain all their rights.
1408
1409 This document and the information contained herein are provided on an
1410 "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
1411 OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
1412 THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
1413 OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
1414 THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
1415 WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
1416
1417 Intellectual Property
1418
1419 The IETF takes no position regarding the validity or scope of any
1420 Intellectual Property Rights or other rights that might be claimed to
1421 pertain to the implementation or use of the technology described in
1422 this document or the extent to which any license under such rights
1423 might or might not be available; nor does it represent that it has
1424 made any independent effort to identify any such rights. Information
1425 on the procedures with respect to rights in RFC documents can be
1426 found in <a href="https://www.rfc-editor.org/bcp/bcp78">BCP 78</a> and <a href="https://www.rfc-editor.org/bcp/bcp79">BCP 79</a>.
1427
1428 Copies of IPR disclosures made to the IETF Secretariat and any
1429 assurances of licenses to be made available, or the result of an
1430 attempt made to obtain a general license or permission for the use of
1431 such proprietary rights by implementers or users of this
1432 specification can be obtained from the IETF on-line IPR repository at
1433 <a href="http://www.ietf.org/ipr">http://www.ietf.org/ipr</a>.
1434
1435 The IETF invites any interested party to bring to its attention any
1436 copyrights, patents or patent applications, or other proprietary
1437 rights that may cover technology that may be required to implement
1438 this standard. Please address the information to the IETF at
1439 [email protected].
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452 Takeda, et al. Informational [Page 26]
1453 </pre>