idnits 2.17.1 draft-ietf-ccamp-ospf-interas-te-extension-05.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- ** It looks like you're using RFC 3978 boilerplate. You should update this to the boilerplate described in the IETF Trust License Policy document (see https://trustee.ietf.org/license-info), which is required now. -- Found old boilerplate from RFC 3978, Section 5.1 on line 18. -- Found old boilerplate from RFC 3978, Section 5.5, updated by RFC 4748 on line 789. -- Found old boilerplate from RFC 3979, Section 5, paragraph 1 on line 766. -- Found old boilerplate from RFC 3979, Section 5, paragraph 2 on line 773. -- Found old boilerplate from RFC 3979, Section 5, paragraph 3 on line 779. Checking nits according to https://www.ietf.org/id-info/1id-guidelines.txt: ---------------------------------------------------------------------------- No issues found here. Checking nits according to https://www.ietf.org/id-info/checklist : ---------------------------------------------------------------------------- No issues found here. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust Copyright Line does not match the current year -- The document seems to lack a disclaimer for pre-RFC5378 work, but may have content which was first submitted before 10 November 2008. If you have contacted all the original authors and they are all willing to grant the BCP78 rights to the IETF Trust, then this is fine, and you can ignore this comment. If not, you may need to add the pre-RFC5378 disclaimer. (See the Legal Provisions document at https://trustee.ietf.org/license-info for more information.) -- Couldn't find a document date in the document -- date freshness check skipped. Checking references for intended status: Proposed Standard ---------------------------------------------------------------------------- (See RFCs 3967 and 4897 for information about using normative references to lower-maturity documents in RFCs) ** Obsolete normative reference: RFC 2370 (Obsoleted by RFC 5250) ** Obsolete normative reference: RFC 2740 (ref. 'OSPFV3') (Obsoleted by RFC 5340) Summary: 3 errors (**), 0 flaws (~~), 1 warning (==), 7 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 1 Network working group M. Chen 2 Internet Draft Renhai Zhang 3 Category: Standards Track Huawei Technologies Co.,Ltd 4 Created: April 14, 2008 Xiaodong Duan 5 Expires: October 14, 2008 China Mobile 7 OSPF Extensions in Support of Inter-AS Multiprotocol Label Switching 8 (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering 10 draft-ietf-ccamp-ospf-interas-te-extension-05.txt 12 Status of this Memo 14 By submitting this Internet-Draft, each author represents that 15 any applicable patent or other IPR claims of which he or she is 16 aware have been or will be disclosed, and any of which he or she 17 becomes aware will be disclosed, in accordance with Section 6 of 18 BCP 79. 20 Internet-Drafts are working documents of the Internet Engineering 21 Task Force (IETF), its areas, and its working groups. Note that other 22 groups may also distribute working documents as Internet-Drafts. 24 Internet-Drafts are draft documents valid for a maximum of six months 25 and may be updated, replaced, or obsoleted by other documents at any 26 time. It is inappropriate to use Internet-Drafts as reference 27 material or to cite them other than as "work in progress." 29 The list of current Internet-Drafts can be accessed at 30 http://www.ietf.org/ietf/1id-abstracts.txt 32 The list of Internet-Draft Shadow Directories can be accessed at 33 http://www.ietf.org/shadow.html 35 This Internet-Draft will expire on October 11, 2008. 37 Abstract 39 This document describes extensions to the OSPF version 2 and 3 40 protocols to support Multiprotocol Label Switching (MPLS) and 41 Generalized MPLS (GMPLS) Traffic Engineering (TE) for multiple 42 Autonomous Systems (ASes). OSPF-TE v2 and v3 extensions are defined 43 for the flooding of TE information about inter-AS links which can be 44 used to perform inter-AS TE path computation. 46 No support for flooding TE information from outside the AS is 47 proposed or defined in this document. 49 Conventions used in this document 51 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 52 "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this 53 document are to be interpreted as described in RFC-2119 [RFC2119]. 55 Table of Contents 57 1. Introduction.................................................3 58 2. Problem Statement............................................3 59 2.1. A Note on Non-Objectives................................4 60 2.2. Per-Domain Path Determination...........................4 61 2.3. Backward Recursive Path Computation.....................6 62 3. Extensions to OSPF...........................................7 63 3.1. LSA Definitions.........................................8 64 3.1.1. Inter-AS-TE-v2 LSA.................................8 65 3.1.2. Inter-AS-TE-v3 LSA.................................8 66 3.2. LSA Payload.............................................9 67 3.2.1. Link TLV...........................................9 68 3.3. Sub-TLV Detail.........................................10 69 3.3.1. Remote AS Number Sub-TLV..........................10 70 3.3.2. IPv4 Remote ASBR ID Sub-TLV.......................11 71 3.3.3. IPv6 Remote ASBR ID Sub-TLV.......................11 72 4. Procedure for Inter-AS TE Links.............................12 73 4.1. Origin of Proxied TE Information.......................13 74 5. Security Considerations.....................................14 75 6. IANA Considerations.........................................14 76 6.1. Inter-AS TE OSPF LSA...................................14 77 6.1.1. Inter-AS-TE-v2 LSA................................14 78 6.1.2. Inter-AS-TE-v3 LSA................................14 79 6.2. OSPF LSA Sub-TLVs type.................................15 80 7. Acknowledgments.............................................15 81 8. References..................................................15 82 8.1. Normative References...................................15 83 8.2. Informative References.................................16 84 Authors' Addresses.............................................16 85 Intellectual Property Statement................................17 86 Disclaimer of Validity.........................................17 87 Copyright Statement............................................17 89 1. Introduction 91 [OSPF-TE] defines extensions to the OSPF protocol [OSPF] to support 92 intra-area Traffic Engineering (TE). The extensions provide a way of 93 encoding the TE information for TE-enabled links within the network 94 (TE links) and flooding this information within an area. Type 10 95 opaque Link State Advertisements (LSAs) [RFC2370] are used to carry 96 such TE information. Two top-level Type Length Values (TLVs) are 97 defined in [OSPF-TE]: Router Address TLV and Link TLV. The Link TLV 98 has several nested sub-TLVs which describe the TE attributes for a TE 99 link. 101 [OSPF-V3-TE] defines similar extensions to OSPFv3 [OSPFV3]. It 102 defines a new LSA, which is referred to as the Intra-Area-TE LSA, to 103 advertise TE information. [OSPF-V3-TE] uses "Traffic Engineering 104 Extensions to OSPF" [OSPF-TE] as a base for TLV definitions and 105 defines some new TLVs and sub-TLVs to extend TE capabilities to IPv6 106 networks. 108 Requirements for establishing Multiprotocol Label Switching Traffic 109 Engineering (MPLS-TE) Label Switched Paths (LSPs) that cross multiple 110 Autonomous Systems (ASes) are described in [INTER-AS-TE-REQ]. As 111 described in [INTER-AS-TE-REQ], a method SHOULD provide the ability 112 to compute a path spanning multiple ASes. So a path computation 113 entity that may be the head-end Label Switching Router (LSR), an AS 114 Border Router (ASBR), or a Path Computation Element (PCE [PCE]) needs 115 to know the TE information not only of the links within an AS, but 116 also of the links that connect to other ASes. 118 In this document, two new separate LSAs are defined to advertise 119 inter-AS TE information for OSPFv2 and OSPFv3 respectively, and three 120 new sub-TLVs are added to the existing Link TLV to extend TE 121 capabilities for inter-AS Traffic Engineering. The detailed 122 definitions and procedures are discussed in the following sections. 124 This document does not propose or define any mechanisms to advertise 125 any other extra-AS TE information within OSPF. See Section 2.1 for a 126 full list of non-objectives for this work. 128 2. Problem Statement 130 As described in [INTER-AS-TE-REQ], in the case of establishing an 131 inter-AS TE LSP traversing multiple ASes, the Path message [RFC3209] 132 may include the following elements in the Explicit Route Object (ERO) 133 in order to describe the path of the LSP: 135 - a set of AS numbers as loose hops; and/or 137 - a set of LSRs including ASBRs as loose hops. 139 Two methods for determining inter-AS paths are currently being 140 discussed. The per-domain method [PD-PATH] determines the path one 141 domain at a time. The backward recursive method [BRPC] uses 142 cooperation between PCEs to determine an optimum inter-domain path. 143 The sections that follow examine how inter-AS TE link information 144 could be useful in both cases. 146 2.1. A Note on Non-Objectives 148 It is important to note that this document does not make any change 149 to the confidentiality and scaling assumptions surrounding the use of 150 ASes in the Internet. In particular, this document is conformant to 151 the requirements set out in [INTER-AS-TE-REQ]. 153 The following features are explicitly excluded: 155 o There is no attempt to distribute TE information from within one 156 AS to another AS. 158 o There is no mechanism proposed to distribute any form of TE 159 reachability information for destinations outside the AS. 161 o There is no proposed change to the PCE architecture or usage. 163 o TE aggregation is not supported or recommended. 165 o There is no exchange of private information between ASes. 167 o No OSPF adjacencies are formed on the inter-AS link. 169 Note also that the extensions proposed in this document are used only 170 to advertise information about inter-AS TE links. As such these 171 extensions address an entirely different problem from L1VPN Auto- 172 Discovery [L1VPN-OSPF-AD] which defines how TE information about 173 links between Customer Edge (CE) equipment and Provider Edge (PE) 174 equipment can be advertised in OSPF-TE alongside the auto-discovery 175 information for the CE-PE links. There is no overlap between this 176 document and [L1VPN-OSPF-AD]. 178 2.2. Per-Domain Path Determination 180 In the per-domain method of determining an inter-AS path for an MPLS- 181 TE LSP, when an LSR that is an entry-point to an AS receives a Path 182 message from an upstream AS with an ERO containing a next hop that is 183 an AS number, it needs to find which LSRs (ASBRs) within the local AS 184 are connected to the downstream AS so that it can compute a TE LSP 185 segment across the local AS to one of those LSRs and forward the Path 186 message to it and hence into the next AS. See Figure 1 for an 187 example: 189 R1------R3----R5-----R7------R9-----R11 190 | | \ | / | 191 | | \ | ---- | 192 | | \ | / | 193 R2------R4----R6 --R8------R10----R12 194 : : 195 <-- AS1 -->:<---- AS2 --->:<--- AS3 ---> 197 Figure 1: Inter-AS Reference Model 199 The figure shows three ASes (AS1, AS2, and AS3) and twelve LSRs (R1 200 through R12). R3 and R4 are ASBRs in AS1. R5, R6, R7, and R8 are 201 ASBRs in AS2. R9 and R10 are ASBRs in AS3. 203 If an inter-AS TE LSP is planned to be established from R1 to R12, 204 the AS sequence will be: AS1, AS2, AS3. 206 Suppose that the Path message enters AS2 from R3. The next hop in the 207 ERO shows AS3, and R5 must determine a path segment across AS2 to 208 reach AS3. It has a choice of three exit points from AS2 (R6, R7, and 209 R8) and it needs to know which of these provide TE connectivity to 210 AS3, and whether the TE connectivity (for example, available 211 bandwidth) is adequate for the requested LSP. 213 Alternatively, if the next hop in the ERO is the entry ASBR for AS3 214 (say R9), R5 needs to know which of its exit ASBRs has a TE link that 215 connects to R9. Since there may be multiple ASBRs that are connected 216 to R9 (both R7 and R8 in this example), R5 also needs to know the TE 217 properties of the inter-AS TE links so that it can select the correct 218 exit ASBR. 220 Once the path message reaches the exit ASBR, any choice of inter-AS 221 TE link can be made by the ASBR if not already made by entry ASBR 222 that computed the segment. 224 More details can be found in the Section 4. of [PD-PATH], which 225 clearly points out why advertising of inter-AS links is desired. 227 To enable R5 to make the correct choice of exit ASBR the following 228 information is needed: 230 o List of all inter-AS TE links for the local AS. 232 o TE properties of each inter-AS TE link. 234 o AS number of the neighboring AS connected to by each inter-AS TE 235 link. 237 o Identity (TE Router ID) of the neighboring ASBR connected to by 238 each inter-AS TE link. 240 In GMPLS networks further information may also be required to select 241 the correct TE links as defined in [GMPLS-TE]. 243 The example above shows how this information is needed at the entry 244 point ASBRs for each AS (or the PCEs that provide computation 245 services for the ASBRs), but this information is also needed 246 throughout the local AS if path computation function is fully 247 distributed among LSRs in the local AS, for example to support LSPs 248 that have start points (ingress nodes) within the AS. 250 2.3. Backward Recursive Path Computation 252 Another scenario using PCE techniques has the same problem. [BRPC] 253 defines a PCE-based TE LSP computation method (called Backward 254 Recursive Path Computation) to compute optimal inter-domain 255 constrained MPLS-TE or GMPLS LSPs. In this path computation method, a 256 specific set of traversed domains (ASes) are assumed to be selected 257 before computation starts. Each downstream PCE in domain(i) returns 258 to its upstream neighbor PCE in domain(i-1) a multipoint-to-point 259 tree of potential paths. Each tree consists of the set of paths from 260 all Boundary Nodes located in domain(i) to the destination where each 261 path satisfies the set of required constraints for the TE LSP 262 (bandwidth, affinities, etc.). 264 So a PCE needs to select Boundary Nodes (that is, ASBRs) that provide 265 connectivity from the upstream AS. In order that the tree of paths 266 provided by one PCE to its neighbor can be correlated, the identities 267 of the ASBRs for each path need to be referenced, so the PCE must 268 know the identities of the ASBRs in the remote AS reached by any 269 inter-AS TE link, and, in order that it provides only suitable paths 270 in the tree, the PCE must know the TE properties of the inter-AS TE 271 links. See the following figure as an example: 273 PCE1<------>PCE2<-------->PCE3 274 / : : 275 / : : 276 R1------R3----R5-----R7------R9-----R11 277 | | \ | / | 278 | | \ | ---- | 279 | | \ | / | 280 R2------R4----R6 --R8------R10----R12 281 : : 282 <-- AS1 -->:<---- AS2 --->:<--- AS3 ---> 284 Figure 2: BRPC for Inter-AS Reference Model 286 The figure shows three ASes (AS1, AS2, and AS3), three PCEs (PCE1, 287 PCE2, and PCE3), and twelve LSRs (R1 through R12). R3 and R4 are 288 ASBRs in AS1. R5, R6, R7, and R8 are ASBRs in AS2. R9 and R10 are 289 ASBRs in AS3. PCE1, PCE2, and PCE3 cooperate to perform inter-AS path 290 computation and are responsible for path segment computation within 291 their own domain(s). 293 If an inter-AS TE LSP is planned to be established from R1 to R12, 294 the traversed domains are assumed to be selected: AS1->AS2->AS3, and 295 the PCE chain is: PCE1->PCE2->PCE3. First, the path computation 296 request originated from the PCC (R1) is relayed by PCE1 and PCE2 297 along the PCE chain to PCE3, then PCE3 begins to compute the path 298 segments from the entry boundary nodes that provide connection from 299 AS2 to the destination (R12). But, to provide suitable path segments, 300 PCE3 must determine which entry boundary nodes provide connectivity 301 to its upstream neighbor AS (identified by its AS number), and must 302 know the TE properties of the inter-AS TE links. In the same way, 303 PCE2 also needs to determine the entry boundary nodes according to 304 its upstream neighbor AS and the inter-AS TE link capabilities. 306 Thus, to support Backward Recursive Path Computation the same 307 information listed in Section 2.2 is required. The AS number of the 308 neighboring AS connected to by each inter-AS TE link is particularly 309 important. 311 3. Extensions to OSPF 313 Note that this document does not define mechanisms for distribution 314 of TE information from one AS to another, does not distribute any 315 form of TE reachability information for destinations outside the AS, 316 does not change the PCE architecture or usage, does not suggest or 317 recommend any form of TE aggregation, and does not feed private 318 information between ASes. See section 2.1. 320 The extensions defined in this document allow an inter-AS TE link 321 advertisement to be easily identified as such by the use of two new 322 types of LSA, which are referred to as Inter-AS-TE-v2 LSA and Inter- 323 AS-TE-v3 LSA. Three new sub-TLVs are added to the Link TLV to carry 324 the information about the neighboring AS and the remote ASBR. 326 3.1. LSA Definitions 328 3.1.1. Inter-AS-TE-v2 LSA 330 For the advertisement of OSPFv2 inter-AS TE links, a new Opaque LSA, 331 the Inter-AS-TE-v2 LSA, is defined in this document. The Inter-AS-TE- 332 v2 LSA has the same format as "Traffic Engineering LSA" which is 333 defined in [OSPF-TE]. 335 The inter-AS TE link advertisement SHOULD be carried in a Type 10 336 Opaque LSA if the flooding scope is to be limited to within the 337 single IGP area to which the ASBR belongs, or MAY be carried in a 338 Type 11 Opaque LSA if the information is intended to reach all 339 routers (including area border routers, ASBRs, and PCEs) in the AS. 340 The choice between the use of a Type 10 or Type 11 Opaque LSA is a 341 AS-wide policy choice, and configuration control of it SHOULD be 342 provided in ASBR implementations that support the advertisement of 343 inter-AS TE links. 345 The Link State ID of an Opaque LSA as defined in [RFC2370] is divided 346 into two parts. One of them is the Opaque type (8-bit), the other is 347 the Opaque ID (24-bit). The suggested value for the Opaque type of 348 Inter-AS-TE-v2 LSA is TBD and will be assigned by IANA (see Section 349 6.1). We suggest the value 6. The Opaque ID (in this document called 350 the Instance) of the Inter-AS-TE-v2 LSA is an arbitrary value used to 351 uniquely identify Traffic Engineering LSAs. The Link State ID has no 352 topological significance. 354 The TLVs within the body of an Inter-AS-TE-v2 LSA have the same 355 format as used in OSPF-TE. The payload of the TLVs consists of one or 356 more nested Type/Length/Value triplets. New sub-TLVs specifically for 357 inter-AS TE Link advertisement are described in Section 3.2. 359 3.1.2. Inter-AS-TE-v3 LSA 361 In this document, a new LS type is defined for OSPFv3 inter-AS TE 362 link advertisement. The new LS type function code is 11 (which needs 363 to be confirmed by IANA see Section 6.1). 365 The format of an Inter-AS-TE-v3 LSA follows the standard definition 366 of an OSPFv3 LSA as defined in [OSPFV3]. 368 The high-order three bits of the LS type field of the OSPFv3 LSA 369 header encode generic properties of the LSA and are termed the U-bit, 370 S2-bit, and S1-bit [OSPFV3]. The remainder of the LS type carries the 371 LSA function code. 373 For the Inter-AS-TE-v3-LSA the bits are set as follows: 375 The U-bit is always set to 1 to indicate that an OSPFv3 router MUST 376 flood the LSA at its defined flooding scope even if it does not 377 recognize the LS type. 379 The S2 and S1 bits indicate the flooding scope of an LSA. For the 380 Inter-AS-TE-v3-LSA the S2 and S1 bits SHOULD be set to 01 to indicate 381 that the flooding scope is to be limited to within the single IGP 382 area to which the ASBR belongs, but MAY be set to 10 if the 383 information should reach all routers (including area border routers, 384 ASBRs, and PCEs) in the AS. The choice between the use of 01 or 10 is 385 a network-wide policy choice, and configuration control SHOULD be 386 provided in ASBR implementations that support the advertisement of 387 inter-AS TE links. 389 The Link State ID of the Inter-AS-TE-v3 LSA is an arbitrary value 390 used to uniquely identify Traffic Engineering LSAs. The LSA ID has no 391 topological significance. 393 The TLVs with the body of an Inter-AS-TE-v3 LSA have the same format 394 and semantic as defined above in [OSPF-V3-TE]. New sub-TLVs 395 specifically for inter-AS TE Link advertisement are described in 396 Section 3.2. 398 3.2. LSA Payload 400 Both the Inter-AS-TE-v2 LSA and Inter-AS-TE-v3 LSA contain one top 401 level TLV: 403 2 - Link TLV 405 For the Inter-AS-TE-v2 LSA this TLV is defined in [OSPF-TE] and for 406 the Inter-AS-TE-v3 LSA this TLV is defined in [OSPF-V3-TE]. The sub- 407 TLVs carried in this TLV are described in the following sections. 409 3.2.1. Link TLV 411 The Link TLV describes a single link and consists a set of sub-TLVs. 412 The sub-TLVs for inclusion in the Link TLV of the Inter-AS-TE-v2 LSA 413 and Inter-AS-TE-v3 LSA are defined respectively in [OSPF-TE] and 414 [OSPF-V3-TE] and the list of sub-TLVs may be extended by other 415 documents. However, this document defines one exception as follows. 417 The Link ID sub-TLV [OSPF-TE] MUST NOT be used in the Link TLV of an 418 Inter-AS-TE-v2 LSA, and the Neighbor ID sub-TLV [OSPF-V3-TE] MUST NOT 419 be used in the Link TLV of an Inter-AS-TE-v3 LSA. Given that OSPF is 420 an IGP and should only be utilized between routers in the same 421 routing domain, the OSPF specific Link ID and Neighbor ID sub-TLVs 422 are not applicable to inter-AS links. 424 Instead, the remote ASBR is identified by the inclusion of the 425 following new sub-TLVs defined in this document and described in the 426 subsequent sections. 428 21 - Remote AS Number sub-TLV 430 22 - IPv4 Remote ASBR ID sub-TLV 432 23 - IPv6 Remote ASBR ID sub-TLV 434 The Remote-AS-Number sub-TLV MUST be included in the Link TLV of both 435 the Inter-AS-TE-v2 LSA and Inter-AS-TE-v3 LSA. At least one of the 436 IPv4-Remote-ASBR-ID sub-TLV and the IPv6-Remote-ASBR-ID sub-TLV 437 SHOULD be included in the Link TLV of the Inter-AS-TE-v2 LSA and 438 Inter-AS-TE-v3 LSA. Note that it is possible to include the IPv6- 439 Remote-ASBR-ID sub-TLV in the Link TLV of the Inter-AS-TE-v2 LSA, and 440 to include the IPv4-Remote-ASBR-ID sub-TLV in the Link TLV of the 441 Inter-AS-TE-v3 LSA because the sub-TLVs refer to ASBRs that are in a 442 different addressing scope (that is, a different AS) from that where 443 the OSPF LSA is used. 445 3.3. Sub-TLV Detail 447 3.3.1. Remote AS Number Sub-TLV 449 A new sub-TLV, the Remote AS Number sub-TLV is defined for inclusion 450 in the Link TLV when advertising inter-AS links. The Remote AS Number 451 sub-TLV specifies the AS number of the neighboring AS to which the 452 advertised link connects. The Remote AS number sub-TLV is REQUIRED in 453 a Link TLV that advertises an inter-AS TE link. 455 The Remote AS number sub-TLV is TLV type 21 (which needs to be 456 confirmed by IANA see Section 6.2), and is four octets in length. The 457 format is as follows: 459 0 1 2 3 460 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 461 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 462 | Type | Length | 463 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 464 | Remote AS Number | 465 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 466 The Remote AS number field has 4 octets. When only two octets are 467 used for the AS number, as in current deployments, the left (high- 468 order) two octets MUST be set to zero. 470 3.3.2. IPv4 Remote ASBR ID Sub-TLV 472 A new sub-TLV, which is referred to as the IPv4 Remote ASBR ID sub- 473 TLV, can be included in the Link TLV when advertising inter-AS links. 474 The IPv4 Remote ASBR ID sub-TLV specifies the IPv4 identifier of the 475 remote ASBR to which the advertised inter-AS link connects. This 476 could be any stable and routable IPv4 address of the remote ASBR. Use 477 of the TE Router Address TE Router ID as specified in the Router 478 Address TLV [OSPF-TE] is RECOMMENDED. 480 The IPv4 Remote ASBR ID sub-TLV is TLV type 22 (which needs to be 481 confirmed by IANA see Section 6.2), and is four octets in length. Its 482 format is as follows: 484 0 1 2 3 485 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 486 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 487 | Type | Length | 488 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 489 | Remote ASBR ID | 490 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 492 In OSPFv2 advertisements, the IPv4 Remote ASBR ID sub-TLV MUST be 493 included if the neighboring ASBR has an IPv4 address. If the 494 neighboring ASBR does not have an IPv4 address (not even an IPv4 TE 495 Router ID), the IPv6 Remote ASBR ID sub-TLV MUST be included instead. 496 An IPv4 Remote ASBR ID sub-TLV and IPv6 Remote ASBR ID sub-TLV MAY 497 both be present in a Link TLV in OSPFv2 or OSPFv3. 499 3.3.3. IPv6 Remote ASBR ID Sub-TLV 501 A new sub-TLV, which is referred to as the IPv6 Remote ASBR ID sub- 502 TLV, can be included in the Link TLV when advertising inter-AS links. 503 The IPv6 Remote ASBR ID sub-TLV specifies the identifier of the 504 remote ASBR to which the advertised inter-AS link connects. This 505 could be any stable, routable and global IPv6 address of the remote 506 ASBR. Use of the TE Router IPv6 Address IPv6 TE Router ID as 507 specified in the IPv6 Router Address as specified in the IPv6 Router 508 Address TLV [OSPF-V3-TE] is RECOMMENDED. 510 The IPv6 Remote ASBR ID sub-TLV is TLV type 23 (which needs to be 511 confirmed by IANA see Section 6.2), and is sixteen octets in length. 512 Its format is as follows: 514 0 1 2 3 515 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 516 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 517 | Type | Length | 518 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 519 | Remote ASBR ID | 520 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 521 | Remote ASBR ID (continued) | 522 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 523 | Remote ASBR ID (continued) | 524 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 525 | Remote ASBR ID (continued) | 526 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 528 In OSPFv3 advertisements, the IPv6 Remote ASBR ID sub-TLV MUST be 529 included if the neighboring ASBR has an IPv6 address. If the 530 neighboring ASBR does not have an IPv6 address, the IPv4 Remote ASBR 531 ID sub-TLV MUST be included instead. An IPv4 Remote ASBR ID sub-TLV 532 and IPv6 Remote ASBR ID sub-TLV MAY both be present in a Link TLV in 533 OSPFv2 or OSPFv3. 535 4. Procedure for Inter-AS TE Links 537 When TE is enabled on an inter-AS link and the link is up, the ASBR 538 SHOULD advertise this link using the normal procedures for OSPF-TE 539 [OSPF-TE]. When either the link is down or TE is disabled on the 540 link, the ASBR SHOULD withdraw the advertisement. When there are 541 changes to the TE parameters for the link (for example, when the 542 available bandwidth changes) the ASBR SHOULD re-advertise the link, 543 but the ASBR MUST take precautions against excessive 544 re-advertisements as described in [OSPF-TE]. 546 Hellos MUST NOT be exchanged over the inter-AS link, and 547 consequently, an OSPF adjacency MUST NOT be formed. 549 The information advertised comes from the ASBR's knowledge of the TE 550 capabilities of the link, the ASBR's knowledge of the current status 551 and usage of the link, and configuration at the ASBR of the remote AS 552 number and remote ASBR TE Router ID. 554 Legacy routers receiving an advertisement for an inter-AS TE link are 555 able to ignore it because the Link Type carries an unknown value. 556 They will continue to flood the LSA, but will not attempt to use the 557 information received as if the link were an intra-AS TE link. 559 In the current operation of TE OSPF, the LSRs at each end of a TE 560 link emit LSAs describing the link. The databases in the LSRs then 561 have two entries (one locally generated, the other from the peer) 562 that describe the different 'directions' of the link. This enables 563 CSPF to do a two-way check on the link when performing path 564 computation and eliminate it from consideration unless both 565 directions of the link satisfy the required constraints. 567 In the case we are considering here (i.e., of a TE link to another 568 AS) there is, by definition, no IGP peering and hence no 569 bi-directional TE link information. In order for the CSPF route 570 computation entity to include the link as a candidate path, we have 571 to find a way to get LSAs describing its (bidirectional) 572 TE properties into the TE database. 574 This is achieved by the ASBR advertising, internally to its AS, 575 information about both directions of the TE link to the next AS. The 576 ASBR will normally generate an LSA describing its own side of a link; 577 here we have it 'proxy' for the ASBR at the edge of the other AS and 578 generate an additional LSA that describes that device's 'view' of the 579 link. 581 Only some essential TE information for the link needs to be 582 advertised; i.e., the Link Type, the Remote AS number and the Remote 583 ASBR ID. Routers or PCEs that are capable of processing 584 advertisements of inter-AS TE links SHOULD NOT use such links to 585 compute paths that exit an AS to a remote ASBR and then immediately 586 re-enter the AS through another TE link. Such paths would constitute 587 extremely rare occurrences and SHOULD NOT be allowed except as the 588 result of specific policy configurations at the router or PCE 589 computing the path. 591 4.1. Origin of Proxied TE Information 593 Section 4 describes how to an ASBR advertises TE link information as 594 a proxy for its neighbor ASBR, but does not describe where this 595 information comes from. 597 Although the source of this information is outside the scope of this 598 document, it is possible that it will be a configuration requirement 599 at the ASBR, as are other, local, properties of the TE link. Further, 600 where BGP is used to exchange IP routing information between the 601 ASBRs, a certain amount of additional local configuration about the 602 link and the remote ASBR is likely to be available. 604 We note further that it is possible, and may be operationally 605 advantageous, to obtain some of the required configuration 606 information from BGP. Whether and how to utilize these possibilities 607 is an implementation matter. 609 5. Security Considerations 611 The protocol extensions defined in this document are relatively minor 612 and can be secured within the AS in which they are used by the 613 existing OSPF security mechanisms. 615 There is no exchange of information between ASes, and no change to 616 the OSPF security relationship between the ASes. In particular, since 617 no OSPF adjacency is formed on the inter-AS links, there is no 618 requirement for OSPF security between the ASes. 620 Some of the information included in these new advertisements (e.g., 621 the remote AS number and the remote ASBR ID) is obtained manually 622 from a neighboring administration as part of commercial relationship. 623 The source and content of this information should be carefully 624 checked before it is entered as configuration information at the ASBR 625 responsible for advertising the inter-AS TE links. 627 It is worth noting that in the scenario we are considering a Border 628 Gateway Protocol (BGP) peering may exist between the two ASBRs and 629 this could be used to detect inconsistencies in configuration. For 630 example, if a different remote AS number is received in a BGP OPEN 631 [BGP] from that locally configured into OSPF-TE, as we describe here, 632 then something is amiss. Note, further, that if BGP is used to 633 exchange TE information as described in Section 4.1, the inter-AS BGP 634 session will need to be fully secured. 636 6. IANA Considerations 638 IANA is requested to make the following allocations from registries 639 under its control. 641 6.1. Inter-AS TE OSPF LSA 643 6.1.1. Inter-AS-TE-v2 LSA 645 IANA is requested to assign a new Opaque LSA type (TBD) to Inter-AS- 646 TE-v2 LSA. We suggest that the value 6 be assigned for the new Opaque 647 LSA type. 649 6.1.2. Inter-AS-TE-v3 LSA 651 IANA is requested to assign a new OSPFv3 LSA type function code (TBD) 652 to Inter-AS-TE-v3 LSA. We suggest that the value 11 be assigned for 653 the new OSPV3 LSA type function code. 655 6.2. OSPF LSA Sub-TLVs type 657 IANA maintains the "Open Shortest Path First (OSPF) Traffic 658 Engineering TLVs" registry with sub-registry "Types for sub-TLVs in a 659 TE Link TLV". IANA is requested to assign three new sub-TLVs as 660 follows. The following numbers are suggested (see section 3.3): 662 Value Meaning 664 21 Remote AS Number sub-TLV 666 22 IPv4 Remote ASBR ID sub-TLV 668 23 IPv6 Remote ASBR ID sub-TLV 670 7. Acknowledgments 672 The authors would like to thank Adrian Farrel, Acee Lindem, JP 673 Vasseur, Dean Cheng, and Jean-Louis Le Roux for their review and 674 comments to this document. 676 8. References 678 8.1. Normative References 680 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate 681 Requirement Levels", BCP 14, RFC 2119, March 1997. 683 [RFC3209] Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., 684 and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP 685 Tunnels", RFC 3209, December 2001. 687 [RFC2370] R. Coltun, "The OSPF Opaque LSA Option", RFC2370, July 688 1998. 690 [OSPF] Moy, J., "OSPF Version 2", STD 54, RFC 2328, April 1998. 692 [OSPF-TE] Katz, D., Kompella, K., and Yeung, D., "Traffic Engineering 693 (TE) Extensions to OSPF Version 2", RFC 3630, September 694 2003. 696 [OSPF-V3-TE] Ishiguro K., Manral V., Davey A., and Lindem A. "Traffic 697 Engineering Extensions to OSPF version 3", draft-ietf-ospf- 698 ospfv3-traffic, {work in progress}. 700 [GMPLS-TE] Rekhter, Y., and Kompella, K., "OSPF Extensions in Support 701 of Generalized Multi-Protocol Label Switching (GMPLS)", RFC 702 4203, October 2005. 704 [OSPFV3] Coltun, R., Ferguson, D., and J. Moy, "OSPF for IPv6", 705 RFC 2740, April 1998. 707 8.2. Informative References 709 [INTER-AS-TE-REQ] Zhang and Vasseur, "MPLS Inter-AS Traffic 710 Engineering Requirements", RFC4216, November 2005. 712 [PD-PATH] Ayyangar, A., Vasseur, JP., and Zhang, R., "A Per-domain 713 path computation method for establishing Inter-domain", RFC 714 5152, February 2008. 716 [BRPC] JP. Vasseur, Ed., R. Zhang, N. Bitar, JL. Le Roux, "A 717 Backward Recursive PCE-based Computation (BRPC) procedure 718 to compute shortest inter-domain Traffic Engineering Label 719 Switched Paths", draft-ietf-pce-brpc, (work in progress). 721 [PCE] Farrel, A., Vasseur, JP., and Ash, J., "A Path Computation 722 Element (PCE)-Based Architecture", RFC4655, August 2006. 724 [L1VPN-OSPF-AD] Bryskin, I., and Berger, L., "OSPF Based L1VPN Auto- 725 Discovery", draft-ietf-l1vpn-ospf-auto-discovery, (work in 726 progress). 728 [BGP] Rekhter, Li, Hares, "A Border Gateway Protocol 4 (BGP-4)", 729 RFC4271, January 2006 731 Authors' Addresses 733 Mach(Guoyi) Chen 734 Huawei Technologies Co.,Ltd 735 KuiKe Building, No.9 Xinxi Rd., 736 Hai-Dian District 737 Beijing, 100085 738 P.R. China 740 Email: mach@huawei.com 742 Renhai Zhang 743 Huawei Technologies Co.,Ltd 744 KuiKe Building, No.9 Xinxi Rd., 745 Hai-Dian District 746 Beijing, 100085 747 P.R. China 749 Email: zhangrenhai@huawei.com 750 Xiaodong Duan 751 China Mobile 752 53A,Xibianmennei Ave,Xunwu District 753 Beijing, China 755 Email: duanxiaodong@chinamobile.com 757 Intellectual Property Statement 759 The IETF takes no position regarding the validity or scope of any 760 Intellectual Property Rights or other rights that might be claimed to 761 pertain to the implementation or use of the technology described in 762 this document or the extent to which any license under such rights 763 might or might not be available; nor does it represent that it has 764 made any independent effort to identify any such rights. Information 765 on the procedures with respect to rights in RFC documents can be 766 found in BCP 78 and BCP 79. 768 Copies of IPR disclosures made to the IETF Secretariat and any 769 assurances of licenses to be made available, or the result of an 770 attempt made to obtain a general license or permission for the use of 771 such proprietary rights by implementers or users of this 772 specification can be obtained from the IETF on-line IPR repository at 773 http://www.ietf.org/ipr. 775 The IETF invites any interested party to bring to its attention any 776 copyrights, patents or patent applications, or other proprietary 777 rights that may cover technology that may be required to implement 778 this standard. Please address the information to the IETF at 779 ietf-ipr@ietf.org. 781 Disclaimer of Validity 783 This document and the information contained herein are provided on an 784 "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS 785 OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND 786 THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS 787 OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF 788 THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED 789 WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. 791 Copyright Statement 793 Copyright (C) The IETF Trust (2008). 795 This document is subject to the rights, licenses and restrictions 796 contained in BCP 78, and except as set forth therein, the authors 797 retain all their rights.