--- 1/draft-ietf-idr-bgp-ls-flex-algo-04.txt 2020-11-15 00:13:10.057833008 -0800 +++ 2/draft-ietf-idr-bgp-ls-flex-algo-05.txt 2020-11-15 00:13:10.081833332 -0800 @@ -1,21 +1,21 @@ Inter-Domain Routing K. Talaulikar, Ed. Internet-Draft P. Psenak Intended status: Standards Track Cisco Systems -Expires: January 6, 2021 S. Zandi +Expires: May 17, 2021 S. Zandi G. Dawra LinkedIn - July 5, 2020 + November 13, 2020 Flexible Algorithm Definition Advertisement with BGP Link-State - draft-ietf-idr-bgp-ls-flex-algo-04 + draft-ietf-idr-bgp-ls-flex-algo-05 Abstract Flexible Algorithm is a solution that allows routing protocols (viz. OSPF and IS-IS) to compute paths over a network based on user-defined (and hence, flexible) constraints and metrics. The computation is performed by routers participating in the specific network in a distribute manner using a Flex Algorithm definition. This definition provisioned on one or more routers and propagated (viz. OSPF and IS- IS flooding) through the network. @@ -33,21 +33,21 @@ Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at https://datatracker.ietf.org/drafts/current/. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." - This Internet-Draft will expire on January 6, 2021. + This Internet-Draft will expire on May 17, 2021. Copyright Notice Copyright (c) 2020 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents @@ -246,21 +246,21 @@ TLV as described below. This information is derived from the protocol specific advertisements as below.. o IS-IS, as defined by the ISIS Flexible Algorithm Definition sub- TLV in [I-D.ietf-lsr-flex-algo]. o OSPFv2/OSPFv3, as defined by the OSPF Flexible Algorithm Definition TLV in [I-D.ietf-lsr-flex-algo]. The BGP-LS Attribute associated with a Node NLRI MAY include one or - more FAD TLVs corresponding to the Flexibile Algorithm Definition for + more FAD TLVs corresponding to the Flexible Algorithm Definition for each algorithm that the particular node is advertising. The following sub-sections define the sub-TLVs for the FAD TLV. 3.1. Flex Algo Exclude Any Affinity The Flex Algo Exclude Any Affinity sub-TLV is an optional sub-TLV that is used to carry the affinity constraints [RFC2702] associated with the flex algo definition and enable the exclusion of links carrying any of the specified affinities from the computation of the @@ -287,27 +287,27 @@ o Exclude-Any EAG : the bitmask used to represent the affinities to be excluded. The information in the Flex Algo Exclude Any Affinity sub-TLV is derived from the IS-IS and OSPF protocol specific Flexible Algorithm Exclude Admin Group sub-TLV as defined in [I-D.ietf-lsr-flex-algo]. 3.2. Flex Algo Include Any Affinity - The Flex Algo Incude Any Affinity sub-TLV is an optional sub-TLV that - is used to carry the affinity constraints [RFC2702] associated with - the flex algo definition and enable the inclusion of links carrying - any of the specified affinities in the computation of the specific - algorithm as described in [I-D.ietf-lsr-flex-algo]. The affinity is - expressed in terms of Extended Admin Group (EAG) as defined in - [RFC7308]. + The Flex Algo Include Any Affinity sub-TLV is an optional sub-TLV + that is used to carry the affinity constraints [RFC2702] associated + with the flex algo definition and enable the inclusion of links + carrying any of the specified affinities in the computation of the + specific algorithm as described in [I-D.ietf-lsr-flex-algo]. The + affinity is expressed in terms of Extended Admin Group (EAG) as + defined in [RFC7308]. The TLV has the following format: 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Include-Any EAG (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ @@ -322,27 +322,27 @@ o Include-Any EAG : the bitmask used to represent the affinities to be included. The information in the Flex Algo Include Any Affinity sub-TLV is derived from the IS-IS and OSPF protocol specific Flexible Algorithm Include-Any Admin Group sub-TLV as defined in [I-D.ietf-lsr-flex-algo]. 3.3. Flex Algo Include All Affinity - The Flex Algo Incude All Affinity sub-TLV is an optional sub-TLV that - is used to carry the affinity constraints [RFC2702] associated with - the flex algo definition and enable the inclusion of links carrying - all of the specified affinities in the computation of the specific - algorithm as described in [I-D.ietf-lsr-flex-algo]. The affinity is - expressed in terms of Extended Admin Group (EAG) as defined in - [RFC7308]. + The Flex Algo Include All Affinity sub-TLV is an optional sub-TLV + that is used to carry the affinity constraints [RFC2702] associated + with the flex algo definition and enable the inclusion of links + carrying all of the specified affinities in the computation of the + specific algorithm as described in [I-D.ietf-lsr-flex-algo]. The + affinity is expressed in terms of Extended Admin Group (EAG) as + defined in [RFC7308]. The TLV has the following format: 0 1 2 3 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Include-All EAG (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ @@ -410,21 +410,21 @@ 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Shared Risk Link Group Values (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ where: o Type: TBD - o Length: variable, depedent on the number of SRLG values. MUST be + o Length: variable, dependent on the number of SRLG values. MUST be a multiple of 4 octets. o SRLG Values : One or more SRLG values, each of 4 octet size, as defined in [RFC4202]. The information in the Flex Algo SRLG Exclude sub-TLV is derived from the IS-IS and OSPF protocol specific Flexible Algorithm Exclude SRLG sub-TLV as defined in [I-D.ietf-lsr-flex-algo]. 4. Flex Algorithm Prefix Metric @@ -453,33 +453,33 @@ inclusive which is the range defined for Flexible Algorithms in the IANA "IGP Parameters" registries under the "IGP Algorithm Types" registry [I-D.ietf-lsr-flex-algo]. o Reserved : 3 octet value that SHOULD be set to 0 by the originator and MUST be ignored by the receiver. o Metric : 4 octets field to carry the metric information. The FAPM TLV can be added to the BGP-LS Attribute of the Prefix NLRI - orginated by a node, only if the corresponding node originates the + originated by a node, only if the corresponding node originates the Prefix in along with the underlying IGP TLV/sub-TLV as described below. This information is derived from the protocol specific advertisements as below. o IS-IS, as defined by the ISIS Flexible Algorithm Prefix Metric sub-TLV in [I-D.ietf-lsr-flex-algo]. o OSPFv2/OSPFv3, as defined by the OSPF Flexible Algorithm Prefix Metric sub-TLV in [I-D.ietf-lsr-flex-algo]. The BGP-LS Attribute associated with a Prefix NLRI MAY include one or - more FAPM TLVs corresponding to the Flexibile Algorithm Prefix Metric + more FAPM TLVs corresponding to the Flexible Algorithm Prefix Metric for each algorithm associated with that the particular prefix. 5. IANA Considerations This document requests assigning code-points from the registry "BGP- LS Node Descriptor, Link Descriptor, Prefix Descriptor, and Attribute TLVs" based on table below which reflects the values assigned via the early allocation process. The column "IS-IS TLV/Sub-TLV" defined in the registry does not require any value and should be left empty. @@ -527,41 +527,41 @@ 8. Acknowledgements The authors would like to thank Les Ginsberg for his reviews and contributions to this work. 9. References 9.1. Normative References [I-D.ietf-idr-bgp-ls-app-specific-attr] - Talaulikar, K., Psenak, P., and J. Tantsura, "Application + Talaulikar, K., Psenak, P., and J. Tantsura, "Application- Specific Attributes Advertisement with BGP Link-State", - draft-ietf-idr-bgp-ls-app-specific-attr-02 (work in - progress), May 2020. + draft-ietf-idr-bgp-ls-app-specific-attr-03 (work in + progress), July 2020. [I-D.ietf-idr-bgp-ls-segment-routing-ext] Previdi, S., Talaulikar, K., Filsfils, C., Gredler, H., and M. Chen, "BGP Link-State extensions for Segment Routing", draft-ietf-idr-bgp-ls-segment-routing-ext-16 (work in progress), June 2019. [I-D.ietf-idr-bgpls-srv6-ext] Dawra, G., Filsfils, C., Talaulikar, K., Chen, M., daniel.bernier@bell.ca, d., and B. Decraene, "BGP Link State Extensions for SRv6", draft-ietf-idr-bgpls- - srv6-ext-02 (work in progress), January 2020. + srv6-ext-04 (work in progress), November 2020. [I-D.ietf-lsr-flex-algo] Psenak, P., Hegde, S., Filsfils, C., Talaulikar, K., and A. Gulko, "IGP Flexible Algorithm", draft-ietf-lsr-flex- - algo-07 (work in progress), April 2020. + algo-13 (work in progress), October 2020. [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, March 1997, . [RFC4202] Kompella, K., Ed. and Y. Rekhter, Ed., "Routing Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS)", RFC 4202, DOI 10.17487/RFC4202, October 2005, . @@ -577,30 +577,30 @@ DOI 10.17487/RFC7752, March 2016, . [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, May 2017, . 9.2. Informative References [I-D.ietf-spring-segment-routing-policy] - Filsfils, C., Sivabalan, S., Voyer, D., Bogdanov, A., and + Filsfils, C., Talaulikar, K., Voyer, D., Bogdanov, A., and P. Mattes, "Segment Routing Policy Architecture", draft- - ietf-spring-segment-routing-policy-07 (work in progress), - May 2020. + ietf-spring-segment-routing-policy-09 (work in progress), + November 2020. [I-D.ietf-spring-srv6-network-programming] Filsfils, C., Camarillo, P., Leddy, J., Voyer, D., Matsushima, S., and Z. Li, "SRv6 Network Programming", - draft-ietf-spring-srv6-network-programming-16 (work in - progress), June 2020. + draft-ietf-spring-srv6-network-programming-24 (work in + progress), October 2020. [RFC2702] Awduche, D., Malcolm, J., Agogbua, J., O'Dell, M., and J. McManus, "Requirements for Traffic Engineering Over MPLS", RFC 2702, DOI 10.17487/RFC2702, September 1999, . [RFC3209] Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP Tunnels", RFC 3209, DOI 10.17487/RFC3209, December 2001, .