idnits 2.17.1 draft-chen-idr-bgp-ls-algo-related-adjacency-sid-00.txt: Checking boilerplate required by RFC 5378 and the IETF Trust (see https://trustee.ietf.org/license-info): ---------------------------------------------------------------------------- No issues found here. 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 : ---------------------------------------------------------------------------- ** The document seems to lack a Security Considerations section. ** The abstract seems to contain references ([RFC9085]), which it shouldn't. Please replace those with straight textual mentions of the documents in question. -- The abstract seems to indicate that this document updates RFC9085, but the header doesn't have an 'Updates:' line to match this. Miscellaneous warnings: ---------------------------------------------------------------------------- == The copyright year in the IETF Trust and authors Copyright Line does not match the current year -- The document date (September 10, 2021) is 951 days in the past. Is this intentional? Checking references for intended status: Proposed Standard ---------------------------------------------------------------------------- (See RFCs 3967 and 4897 for information about using normative references to lower-maturity documents in RFCs) == Outdated reference: A later version (-06) exists of draft-ietf-lsr-algorithm-related-adjacency-sid-00 Summary: 2 errors (**), 0 flaws (~~), 2 warnings (==), 2 comments (--). Run idnits with the --verbose option for more detailed information about the items above. -------------------------------------------------------------------------------- 2 L R. chen 3 Internet-Draft Sh. Peng 4 Intended status: Standards Track ZTE Corporation 5 Expires: March 14, 2022 P. Psenak 6 Cisco Systems 7 September 10, 2021 9 Updates to Algorithm Related Adjacency SID Advertisement in RF9085 10 draft-chen-idr-bgp-ls-algo-related-adjacency-sid-00 12 Abstract 14 This draft updates [RFC9085] to defines extensions to the Border 15 Gateway Protocol-Link State (BGP-LS) address family in order to carry 16 algorithm Related Adjacency SID. 18 Status of This Memo 20 This Internet-Draft is submitted in full conformance with the 21 provisions of BCP 78 and BCP 79. 23 Internet-Drafts are working documents of the Internet Engineering 24 Task Force (IETF). Note that other groups may also distribute 25 working documents as Internet-Drafts. The list of current Internet- 26 Drafts is at https://datatracker.ietf.org/drafts/current/. 28 Internet-Drafts are draft documents valid for a maximum of six months 29 and may be updated, replaced, or obsoleted by other documents at any 30 time. It is inappropriate to use Internet-Drafts as reference 31 material or to cite them other than as "work in progress." 33 This Internet-Draft will expire on March 14, 2022. 35 Copyright Notice 37 Copyright (c) 2021 IETF Trust and the persons identified as the 38 document authors. All rights reserved. 40 This document is subject to BCP 78 and the IETF Trust's Legal 41 Provisions Relating to IETF Documents 42 (https://trustee.ietf.org/license-info) in effect on the date of 43 publication of this document. Please review these documents 44 carefully, as they describe your rights and restrictions with respect 45 to this document. Code Components extracted from this document must 46 include Simplified BSD License text as described in Section 4.e of 47 the Trust Legal Provisions and are provided without warranty as 48 described in the Simplified BSD License. 50 Table of Contents 52 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 53 2. Requirements Language . . . . . . . . . . . . . . . . . . . . 2 54 3. BGP-LS Extensions for link Attribute . . . . . . . . . . . . 2 55 3.1. Adjacency SID per Algorithm TLV . . . . . . . . . . . . . 3 56 3.2. LAN Adjacency SID per Algorithm TLV . . . . . . . . . . . 4 57 4. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 5 58 5. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 5 59 6. Normative References . . . . . . . . . . . . . . . . . . . . 5 60 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 6 62 1. Introduction 64 [I-D.ietf-lsr-algorithm-related-adjacency-sid] defines the algorithm 65 identifier can be included as part of an Adjacency-SID advertisement 66 for SR-MPLS. 68 [RFC9085]defines extensions to the Border Gateway Protocol-Link State 69 (BGP-LS) address family in order to carry SR information via BGP, and 70 an algorithm identifier is included as part of the Prefix-SID TLV 71 advertisement. This draft updates [RFC9085] and defines extensions 72 to the Border Gateway Protocol-Link State (BGP-LS) address family in 73 order to carry algorithm Related Adjacency SID. 75 2. Requirements Language 77 The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", 78 "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and 79 "OPTIONAL" in this document are to be interpreted as described in BCP 80 14 [RFC2119] [RFC8174] when, and only when, they appear in all 81 capitals, as shown here. 83 3. BGP-LS Extensions for link Attribute 85 The following link attribute TLVs are defined: 87 +======+===========================================+ 88 | Type | Description | 89 +======+===========================================+ 90 | TBD1 | Adjacency SID per Algorithm | 91 +------+-------------------------------------------+ 92 | TBD2 | LAN Adjacency SID per Algorithm | 93 +------+-------------------------------------------+ 95 Figure 1: Link Attribute TLVs 97 3.1. Adjacency SID per Algorithm TLV 99 The Adjacency SID per Algorithm TLV is used in order to advertise 100 information related to an algorithm Related Adjacency SID. This 101 information is derived from the Adjacency Segment Identifier (Adj- 102 SID) per Algorithm Sub-TLV of ISIS/OSPFv2/OSPFv3(Section 4 of 103 [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 105 The Adjacency SID per Algorithm TLV has the following format: 107 0 1 2 3 108 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 109 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 110 | Type | Length | 111 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 112 | Flags | Weight | Algorithm | Reserved | 113 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 114 | SID/Label/Index (variable) // 115 +---------------------------------------------------------------+ 117 Figure 2: Adjacency SID per Algorithm TLV 119 where: 121 Type: TBD1 (Suggested value to be assigned by IANA) 123 Length: variable. 125 Flags: 1-octet value that should be set as: 127 o IS-IS Adj-SID per Algorithm flags as defined in Section 4.1.1 of 128 [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 130 o OSPFv2 Adj-SID per Algorithm Sub-TLV as defined in Section 4.2.1 131 of [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 133 o OSPFv3 Adj-SID per Algorithm Sub-TLV as defined in Section 4.3.1 134 of [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 136 Weight: 1 octet carrying the weight used for load-balancing purposes. 137 The use of weight is described in Section 3.4 of [RFC8402]. 139 Algorithm: Refer to ISIS/OSPFv2/OSPFv3 Adj-SID per 140 Algorithm([I-D.ietf-lsr-algorithm-related-adjacency-sid]). 142 Reserved: 1-octet that MUST be set to 0 and ignored on receipt. 144 SID/Label/Index:Refer to ISIS/OSPFv2/OSPFv3 Adj-SID per 145 Algorithm([I-D.ietf-lsr-algorithm-related-adjacency-sid]). 147 3.2. LAN Adjacency SID per Algorithm TLV 149 This information is derived from LAN-Adj-SID per Algorithm Sub-TLV of 150 ISIS/OSPFv2/OSPFv3(Section 4 of 151 [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 153 The LAN Adjacency SID per Algorithm TLV has the following format: 155 0 1 2 3 156 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 157 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 158 | Type | Length | 159 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 160 | Flags | Weight | Algorithm | Reserved | 161 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 163 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 164 | OSPF Neighbor ID / IS-IS System ID | 165 + +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 166 | | 167 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 169 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ 170 | SID/Label/Index (variable) // 171 +---------------------------------------------------------------+ 173 Figure 3:LAN Adjacency SID per Algorithm TLV 175 where: 177 Type: TBD2 (Suggested value to be assigned by IANA) 179 Length: variable. 181 Flags: 1-octet value that should be set as: 183 o IS-IS LAN-Adj-SID per Algorithm flags as defined in Section 4.1.2 184 of [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 186 o OSPFv2 LAN-Adj-SID per Algorithm Sub-TLV as defined in 187 Section 4.2.2 of [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 189 o OSPFv3 LAN-Adj-SID per Algorithm Sub-TLV as defined in 190 Section 4.3.2 of [I-D.ietf-lsr-algorithm-related-adjacency-sid]). 192 Weight: 1 octet carrying the weight used for load-balancing purposes. 193 The use of weight is described in Section 3.4 of [RFC8402]. 195 Algorithm: Refer to ISIS/OSPFv2/OSPFv3 LAN-Adj-SID per 196 Algorithm([I-D.ietf-lsr-algorithm-related-adjacency-sid]). 198 Reserved: 1-octet that MUST be set to 0 and ignored on receipt. 200 Neighbor ID/IS-IS System ID: Refer to ISIS/OSPFv2/OSPFv3 LAN-Adj-SID 201 per Algorithm([I-D.ietf-lsr-algorithm-related-adjacency-sid]). 203 SID/Label/Index:Refer to ISIS/OSPFv2/OSPFv3 LAN-Adj-SID per 204 Algorithm([I-D.ietf-lsr-algorithm-related-adjacency-sid]). 206 4. IANA Considerations 208 This document makes the following Link Attribute TLVs registry under 209 the "Border Gateway Protocol-Link State (BGP-LS) Parameter". 211 +======+===========================================+ 212 | Type | Description | 213 +======+===========================================+ 214 | TBD1 | Adjacency SID per Algorithm | 215 +------+-------------------------------------------+ 216 | TBD2 | LAN Adjacency SID per Algorithm | 217 +------+-------------------------------------------+ 219 Table 1: The new Link Attribute TLVs 221 5. Acknowledgements 223 TBD 225 6. Normative References 227 [I-D.ietf-lsr-algorithm-related-adjacency-sid] 228 Peng, S., Chen, R., Talaulikar, K., and P. Psenak, 229 "Algorithm Related IGP-Adjacency SID Advertisement", 230 draft-ietf-lsr-algorithm-related-adjacency-sid-00 (work in 231 progress), June 2021. 233 [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate 234 Requirement Levels", BCP 14, RFC 2119, 235 DOI 10.17487/RFC2119, March 1997, 236 . 238 [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 239 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, 240 May 2017, . 242 [RFC8402] Filsfils, C., Ed., Previdi, S., Ed., Ginsberg, L., 243 Decraene, B., Litkowski, S., and R. Shakir, "Segment 244 Routing Architecture", RFC 8402, DOI 10.17487/RFC8402, 245 July 2018, . 247 [RFC9085] Previdi, S., Talaulikar, K., Ed., Filsfils, C., Gredler, 248 H., and M. Chen, "Border Gateway Protocol - Link State 249 (BGP-LS) Extensions for Segment Routing", RFC 9085, 250 DOI 10.17487/RFC9085, August 2021, 251 . 253 Authors' Addresses 255 Ran Chen 256 ZTE Corporation 257 No.50 Software Avenue,Yuhuatai District 258 Nanjing, Jiangsu Province 210012 259 China 261 Email: chen.ran@zte.com.cn 263 Shaofu 264 ZTE Corporation 265 No.50 Software Avenue,Yuhuatai District 266 Nanjing, Jiangsu Province 210012 267 China 269 Email: peng.shaofu@zte.com.cn 271 Peter Psenak 272 Cisco Systems 274 Email: ppsenak@cisco.com