Advertisement of Segment Routing Policies Using BGP - Link State Individual
stefano@previdi.net
Cisco Systems
India ketant.ietf@gmail.com
Huawei Technologies
Huawei Campus, No. 156 Beiqing Rd. Beijing 100095 China jie.dong@huawei.com
RtBrick Inc.
hannes@rtbrick.com
Nvidia
jefftant.ietf@gmail.com
RTG idr BGP BGP-LS Segment Routing SR SR Policy SR-MPLS SRv6 Traffic Engineering BGP SR Policy This document describes a mechanism used to collect Segment Routing (SR) Policy information that is locally available in a node and advertise it into BGP - Link State (BGP-LS) updates. Such information can be used by external components for path computation, reoptimization, service placement, network visualization, etc.
Status of This Memo This is an Internet Standards Track document. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 7841. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at .
Copyright Notice Copyright (c) 2025 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 () in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.
Table of Contents
  • .  Introduction
    • .  Requirements Language
  • .  Carrying SR Policy Information in BGP
  • .  SR Policy Candidate Path NLRI Type
    • .  SR Policy Headend as the BGP-LS Producer
    • .  PCE as the BGP-LS Producer
  • .  SR Policy Candidate Path Descriptor
  • .  SR Policy State TLVs
    • .  SR Binding SID TLV
    • .  SRv6 Binding SID TLV
    • .  SR Candidate Path State TLV
    • .  SR Policy Name TLV
    • .  SR Candidate Path Name TLV
    • .  SR Candidate Path Constraints TLV
      • .  SR Affinity Constraint Sub-TLV
      • .  SR SRLG Constraint Sub-TLV
      • .  SR Bandwidth Constraint Sub-TLV
      • .  SR Disjoint Group Constraint Sub-TLV
      • .  SR Bidirectional Group Constraint Sub-TLV
      • .  SR Metric Constraint Sub-TLV
    • .  SR Segment List TLV
      • .  SR Segment Sub-TLV
      • .  SR Segment List Metric Sub-TLV
      • .  SR Segment List Bandwidth Sub-TLV
      • .  SR Segment List Identifier Sub-TLV
  • .  Procedures
  • .  Manageability Considerations
  • .  IANA Considerations
    • .  BGP-LS NLRI Types
    • .  BGP-LS Protocol-IDs
    • .  BGP-LS TLVs
    • .  SR Policy Protocol-Origin
    • .  BGP-LS SR Segment Descriptors
    • .  BGP-LS SR Policy Metric Type
  • .  Security Considerations
  • . References
    • .  Normative References
    • .  Informative References
  • Acknowledgements
  • Contributors
  • Authors' Addresses
Introduction SR Policy architecture details are specified in . An SR Policy comprises one or more candidate paths of which at a given time one and only one may be active (i.e., installed in forwarding and usable for the steering of traffic). Each candidate path in turn may have one or more SID lists of which one or more SID lists may be active. When multiple SID lists are active, traffic is load balanced over them. This document covers the advertisement of state information at the individual SR Policy candidate path level. SR Policies are generally instantiated at the headend and are based on either local configuration or controller-based programming of the node using various APIs and protocols (e.g., the Path Computation Element Communication Protocol (PCEP) or BGP). In many network environments, the configuration and state of each SR Policy that is available in the network is required by controllers. Such controllers, which are aware of both topology and SR Policy state information, allow the network operator to optimize several functions and operations in their networks. One example of a controller is the stateful Path Computation Element (PCE) , which can provide benefits in path optimization. While some extensions are proposed in the PCEP for Path Computation Clients (PCCs) to report Label Switched Path (LSP) states to the PCE, this mechanism may not be applicable in a management-based PCE architecture as specified in . As illustrated in the figure below, the PCC is not a Label Switching Router (LSR) in the routing domain, thus the headend nodes of the SR Policies may not implement the PCEP. In this case, a general mechanism to collect the SR Policy states from the ingress Label Edge Routers (LERs) is needed. This document proposes an SR Policy state collection mechanism complementary to the mechanism defined in .
Management-Based PCE Usage ----------- | ----- | Service | | TED |<-+-----------> Request | ----- | TED synchronization | | | | mechanism (e.g., the v | | | routing protocol) ------------- Request/ | v | | | Response| ----- | | NMS |<--------+> | PCE | | | | | ----- | ------------- ----------- Service | Request | v ---------- Signaling ---------- | Headend | Protocol | Adjacent | | Node |<---------->| Node | ---------- ----------
In networks with composite PCE nodes as specified in , PCE is implemented on several routers in the network, and the PCCs in the network can use the mechanism described in to report the SR Policy information to the PCE nodes. An external component may also need to collect the SR Policy information from all the PCEs in the network to obtain a global view of the state of all SR Policy paths in the network. In multi-area or multi-AS scenarios, each area or AS can have a child PCE to collect the SR Policies in its domain. In addition, a parent PCE needs to collect SR Policy information from multiple child PCEs to obtain a global view of SR Policy paths inside and across the domains involved. In another network scenario, a centralized controller is used for service placement. Obtaining the SR Policy state information is quite important for making appropriate service placement decisions with the purpose of both meeting the application's requirements and utilizing network resources efficiently. The Network Management System (NMS) may need to provide global visibility of the SR Policies in the network as part of the network visualization function. BGP has been extended to distribute link-state and Traffic Engineering (TE) information to external components . Using the same protocol to collect SR Policy and state information is desirable for these external components since this avoids introducing multiple protocols for network topology information collection. This document describes a mechanism to distribute SR Policy information (both SR-MPLS and SRv6 ) to external components using BGP-LS and covers both explicit and dynamic candidate paths. The advertisements of a composite candidate path are outside the scope of this document. The BGP-LS Producer that is originating the advertisement of SR Policy information can be either:
  • an SR Policy headend node or
  • a PCE that is receiving the SR Policy information from its PCCs (i.e., SR Policy headend nodes) via PCEP
The extensions specified in this document complement the BGP SR Policy SAFI and are used to advertise SR Policies from controllers to the headend routers using BGP by enabling the reporting of the operational state of those SR Policies back from the headend to the controllers. While this document focuses on SR Policies, introduces further extensions to support other TE paths such as MPLS-TE LSPs. The encodings specified in this document (specifically in Sections and ) make use of flags that convey various types of information of the SR Policy. The document uses the term "set" to indicate that the value of a flag bit is 1 and the term "clear" when the value is 0.
Requirements Language The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here.
Carrying SR Policy Information in BGP The "Link-State Network Layer Reachability Information (NLRI)" defined in is extended to carry the SR Policy information. New TLVs carried in the BGP-LS Attribute defined in are also defined to carry the attributes of an SR Policy in the subsequent sections. The format of the Link-State NLRI is defined in as follows:
BGP-LS NLRI 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | NLRI Type | Total NLRI Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | // Link-State NLRI (variable) // | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
An additional NLRI Type known as "SR Policy Candidate Path NLRI" (value 5) is defined for the advertisement of SR Policy Information. This SR Policy Candidate Path NLRI is used to report the state details of individual SR Policy candidate paths along with their underlying segment lists.
SR Policy Candidate Path NLRI Type This document defines the SR Policy Candidate Path NLRI type with its format as shown in the following figure:
SR Policy Candidate Path NLRI 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 +-+-+-+-+-+-+-+-+ | Protocol-ID | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Identifier | | (64 bits) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ // Local Node Descriptors TLV (for the Headend) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ // SR Policy Candidate Path Descriptor TLV // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Protocol-ID field:
Specifies the component that owns the SR Policy state in the advertising node. An additional Protocol-ID "Segment Routing" (value 9) is introduced by this document that MUST be used for the advertisement of SR Policies.
Identifier:
An 8-octet value as defined in .
Local Node Descriptors (TLV 256):
Defined in and used as specified further in this section.
SR Policy Candidate Path Descriptor TLV:
Specified in .
The Local Node Descriptors TLV carries information that only identifies the headend node of the SR Policy irrespective of whether the BGP-LS Producer is a headend or a PCE node. The Local Node Descriptors TLV MUST include at least one of the following Node Descriptor TLVs:
  • IPv4 Router-ID of Local Node (TLV 1028) , which identifies the headend node of the SR Policy as specified in .
  • IPv6 Router-ID of Local Node (TLV 1029) , which identifies the headend node of the SR Policy as specified in .
The following subsections describe the encoding of sub-TLVs within the Local Node Descriptors TLV depending on which node is the BGP-LS Producer.
SR Policy Headend as the BGP-LS Producer The Local Node Descriptors TLV MUST include the following Node Descriptor TLVs when the headend node is the BGP-LS Producer:
  • BGP Router-ID (TLV 516) , which contains a valid BGP Identifier of the headend node of the SR Policy.
  • Autonomous System (TLV 512) , which contains the Autonomous System Number (ASN) (or AS Confederation Identifier , if confederations are used) of the headend node of the SR Policy.
The Local Node Descriptors TLV MAY include the following Node Descriptor TLVs when the headend node is the BGP-LS Producer:
  • BGP Confederation Member (TLV 517) , which contains the ASN of the confederation member (i.e., Member-AS Number); if BGP confederations are used, it contains the headend node of the SR Policy.
  • Other Node Descriptors as defined in to identify the headend node of the SR Policy. The determination of whether the IGP Router-ID (TLV 515) contains a 4-octet OSPF Router-ID or a 6-octet ISO System-ID is to be done based on the length of that sub-TLV as the Protocol-ID in the NLRI is always going to be "Segment Routing".
PCE as the BGP-LS Producer The PCE node MUST NOT include its identifiers in the Node Descriptor TLV in the NLRI as the Node Descriptor TLV MUST only carry the identifiers of the SR Policy headend. The Local Node Descriptors TLV MAY include the following Node Descriptor TLVs when the PCE node is the BGP-LS Producer and it has this information about the headend (e.g., as part of its topology database):
  • BGP Router-ID (TLV 516) , which contains a valid BGP Identifier of the headend node of the SR Policy.
  • Autonomous System (TLV 512) , which contains the ASN (or AS Confederation Identifier , if confederations are used) of the headend node of the SR Policy.
  • BGP Confederation Member (TLV 517) , which contains the ASN of the confederation member (i.e., Member-AS Number); if BGP confederations are used, it contains the headend node of the SR Policy.
  • Other Node Descriptors as defined in to identify the headend node of the SR Policy. The determination of whether the IGP Router-ID (TLV 515) contains a 4-octet OSPF Router-ID or a 6-octet ISO System-ID is to be done based on the length of that sub-TLV since the Protocol-ID in the NLRI is always going to be "Segment Routing".
When a PCE node is functioning as the BGP-LS Producer on behalf of one or more headends, it MAY include its own BGP Router-ID (TLV 516), Autonomous System (TLV 512), or BGP Confederation Member (TLV 517) in the BGP-LS Attribute.
SR Policy Candidate Path Descriptor The SR Policy Candidate Path Descriptor TLV identifies an SR Policy candidate path as defined in . It is a mandatory TLV for the SR Policy Candidate Path NLRI type. The TLV has the following format:
SR Policy Candidate Path Descriptor 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |Protocol-Origin| Flags | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Endpoint (4 or 16 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Policy Color (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator AS Number (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Originator Address (4 or 16 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Discriminator (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
554
Length:
Variable (valid values are 24, 36, or 48 octets)
Protocol-Origin:
1-octet field that identifies the protocol or component that is responsible for the instantiation of this path as specified in . The protocol-origin code points to be used are listed in .
Flags:
1-octet field with the following bit positions defined. Other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 2 3 4 5 6 7 +-+-+-+-+-+-+-+-+ |E|O| | +-+-+-+-+-+-+-+-+ Where:
E-Flag:
Indicates the encoding of an endpoint as an IPv6 address when set and an IPv4 address when clear.
O-Flag:
Indicates the encoding of the originator address as an IPv6 address when set and an IPv4 address when clear.
Reserved:
2 octets that MUST be set to 0 by the originator and MUST be ignored by a receiver.
Endpoint:
4 or 16 octets (as indicated by the flags) containing the address of the endpoint of the SR Policy as specified in .
Policy Color:
4 octets that indicate the color of the SR Policy as specified in .
Originator ASN:
4 octets to carry the 4-byte encoding of the ASN of the originator. Refer to for details.
Originator Address:
4 or 16 octets (as indicated by the flags) to carry the address of the originator. Refer to for details.
Discriminator:
4 octets to carry the discriminator of the path. Refer to for details.
SR Policy State TLVs This section defines the various TLVs that enable the headend to report the state at the SR Policy candidate path level. These TLVs (and their sub-TLVs) are carried in the optional non-transitive BGP-LS Attribute defined in and are associated with the SR Policy Candidate Path NLRI type. The detailed procedures for the advertisement are described in .
SR Binding SID TLV The SR Binding Segment Identifier (BSID) is an optional TLV that is used to report the BSID and its attributes for the SR Policy candidate path. The TLV MAY also optionally contain the Specified BSID value for reporting as described in . Only a single instance of this TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The TLV has the following format:
SR Binding SID TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | BSID Flags | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Binding SID (4 or 16 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Specified Binding SID (4 or 16 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1201
Length:
Variable (valid values are 12 or 36 octets)
BSID Flags:
2-octet field that indicates the attribute and status of the Binding SID (BSID) associated with this candidate path. The following bit positions are defined, and the semantics are described in detail in . Other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |D|B|U|L|F| | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Where:
D-Flag:
Indicates the data plane for the BSIDs and if a BSID is a 16-octet SRv6 SID (when set) or 4-octet SR/MPLS label value (when clear).
B-Flag:
Indicates the allocation of the value in the BSID field when set and that BSID is not allocated when clear.
U-Flag:
Indicates that the specified BSID value is unavailable when set. When clear, it indicates that this candidate path is using the specified BSID. This flag is ignored when there is no specified BSID.
L-Flag:
Indicates that the BSID value is from the Segment Routing Local Block (SRLB) of the headend node when set and from the local dynamic label pool when clear.
F-Flag:
Indicates that the BSID value is one allocated from a dynamic label pool due to fallback (e.g., when a specified BSID is unavailable) when set and that there has been no fallback for BSID allocation when clear.
RESERVED:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Binding SID:
Indicates the operational or allocated BSID value based on the status flags.
Specified BSID:
Used to report the explicitly specified BSID value regardless of whether it is successfully allocated or not. The field is set to value 0 when the BSID has not been specified.
The BSID fields above depend on the data plane (SRv6 or MPLS) indicated by the D-flag. If the D-flag is set (SRv6 data plane), then the length of the BSID fields is 16 octets. If the D-flag is clear (MPLS data plane), then the length of the BSID fields is 4 octets. When carrying the MPLS Label, as shown in the figure below, the TC, S, and TTL (total of 12 bits) are RESERVED and MUST be set to 0 by the originator and MUST be ignored by a receiver.
SR Binding SID Label 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Label | TC |S| TTL | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
In the case of an SRv6, the SR Binding SID sub-TLV does not have the ability to signal the SRv6 Endpoint behavior or the structure of the SID. Therefore, the SR Binding SID sub-TLV SHOULD NOT be used for the advertisement of an SRv6 Binding SID. Instead, the SRv6 Binding SID TLV defined in SHOULD be used for the signaling of an SRv6 Binding SID. The use of the SR Binding SID sub-TLV for advertisement of the SRv6 Binding SID has been deprecated, and it is documented here only for backward compatibility with implementations that followed early draft versions of this specification.
SRv6 Binding SID TLV The SRv6 Binding SID (BSID) is an optional TLV that is used to report the SRv6 BSID and its attributes for the SR Policy candidate path. The TLV MAY also optionally contain the Specified SRv6 BSID value for reporting as described in . Multiple instances of this TLV may be used to report each of the SRv6 BSIDs associated with the candidate path. The TLV has the following format:
SRv6 Binding SID TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | BSID Flags | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Binding SID (16 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Specified Binding SID (16 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ // sub-TLVs (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1212
Length:
Variable
BSID Flags:
2-octet field that indicates the attribute and status of the BSID associated with this candidate path. The following bit positions are defined, and the semantics are described in detail in . Other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |B|U|F| | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Where:
B-Flag:
Indicates the allocation of the value in the BSID field when set and that BSID is not allocated when clear.
U-Flag:
Indicates the specified BSID value is unavailable when set. When clear, it indicates that this candidate path is using the specified BSID. This flag is ignored when there is no specified BSID.
F-Flag:
Indicates that the BSID value is one allocated dynamically due to fallback (e.g., when the specified BSID is unavailable) when set and that there has been no fallback for BSID allocation when clear.
RESERVED:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Binding SID:
Indicates the operational or allocated BSID value based on the status flags.
Specified BSID:
Used to report the explicitly specified BSID value regardless of whether it is successfully allocated or not. The field is set to value 0 when the BSID has not been specified.
Sub-TLVs:
Variable and contain any other optional attributes associated with the SRv6 BSID.
The SRv6 Endpoint Behavior TLV (1250) and the SRv6 SID Structure TLV (1252) MAY optionally be used as sub-TLVs of the SRv6 Binding SID TLV to indicate the SRv6 Endpoint behavior and SID structure for the Binding SID value in the TLV. defines the SRv6 Endpoint Behavior TLV and the SRv6 SID Structure TLV.
SR Candidate Path State TLV The SR Candidate Path State TLV provides the operational status and attributes of the SR Policy at the candidate path level. Only a single instance of this TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The TLV has the following format:
SR Candidate Path State TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Priority | RESERVED | Flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Preference (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1202
Length:
8 octets
Priority:
1-octet value that indicates the priority of the candidate path. Refer to .
RESERVED:
1 octet. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Flags:
2-octet field that indicates the attribute and status of the candidate path. The following bit positions are defined, and the semantics are described in unless stated otherwise for individual flags. Other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |S|A|B|E|V|O|D|C|I|T|U| | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Where:
S-Flag:
Indicates that the candidate path is in an administrative shut state when set and not in an administrative shut state when clear.
A-Flag:
Indicates that the candidate path is the active path (i.e., one provisioned in the forwarding plane as specified in ) for the SR Policy when set and not the active path when clear.
B-Flag:
Indicates that the candidate path is the backup path (i.e., one identified for path protection of the active path as specified in ) for the SR Policy when set and not the backup path when clear.
E-Flag:
Indicates that the candidate path has been evaluated for validity (e.g., headend may evaluate candidate paths based on their preferences) when set and has not been evaluated for validity when clear.
V-Flag:
Indicates that the candidate path has at least one valid SID list when set and that no valid SID list is available or evaluated when clear. When the E-flag is clear (i.e., the candidate path has not been evaluated), then this flag MUST be set to 0 by the originator and MUST be ignored by a receiver.
O-Flag:
Indicates that the candidate path was instantiated by the headend due to an on-demand next hop trigger based on a local template when set and that the candidate path has not been instantiated due to an on-demand next hop trigger when clear. Refer to for details.
D-Flag:
Indicates that the candidate path was delegated for computation to a PCE/controller when set and that the candidate path has not been delegated for computation when clear.
C-Flag:
Indicates that the candidate path was provisioned by a PCE/controller when set and that the candidate path was not provisioned by a PCE/controller when clear.
I-Flag:
Indicates that the candidate path is to perform the "Drop-Upon-Invalid" behavior when no other valid candidate path is available for this SR Policy when the flag is set. Refer to for details. When clear, it indicates that the candidate path is not enabled for the "Drop-Upon-Invalid" behavior.
T-Flag:
Indicates that the candidate path has been marked as eligible for use as a transit policy on the headend when set and not eligible for use as a transit policy when clear. Transit policy is a policy whose BSID can be used in the segment list of another SR Policy. Refer to for steering into a transit policy using its BSID.
U-Flag:
Indicates that the candidate path is reported as active and is dropping traffic as a result of the "Drop-Upon-Invalid" behavior being activated for the SR Policy when set. When clear, it indicates that the candidate path is not dropping traffic as a result of the "Drop-Upon-Invalid" behavior. Refer to for details.
Preference:
4-octet value that indicates the preference of the candidate path. Refer to for details.
SR Policy Name TLV The SR Policy Name TLV is an optional TLV that is used to carry the symbolic name associated with the SR Policy. Only a single instance of this TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The TLV has the following format:
SR Policy Name TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | SR Policy Name (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1213
Length:
Variable
SR Policy Name:
Symbolic name for the SR Policy without a NUL terminator as specified in . It is RECOMMENDED that the size of the symbolic name be limited to 255 bytes. Implementations MAY choose to truncate long names to 255 bytes when signaling via BGP-LS.
SR Candidate Path Name TLV The SR Candidate Path Name TLV is an optional TLV that is used to carry the symbolic name associated with the candidate path. Only a single instance of this TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The TLV has the following format:
SR Candidate Path Name TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Candidate Path Name (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1203
Length:
Variable
Candidate Path Name:
Symbolic name for the SR Policy candidate path without a NUL terminator as specified in . It is RECOMMENDED that the size of the symbolic name be limited to 255 bytes. Implementations MAY choose to truncate long names to 255 bytes when signaling via BGP-LS.
SR Candidate Path Constraints TLV The SR Candidate Path Constraints TLV is an optional TLV that is used to report the constraints associated with the candidate path. The constraints are generally applied to a dynamic candidate path that is either computed by the headend or delegated to a controller. The constraints may also be applied to an explicit path where the computation entity is expected to validate that the path satisfies the specified constraints; if not, the path is to be invalidated (e.g., due to topology changes). Only a single instance of this TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The TLV has the following format:
SR Candidate Path Constraints TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Flags | RESERVED1 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | MTID | Algorithm | RESERVED2 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | sub-TLVs (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1204
Length:
Variable
Flags:
2-octet field that indicates the constraints that are being applied to the candidate path. The following bit positions are defined, and the other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |D|P|U|A|T|S|F|H| | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Where:
D-Flag:
Indicates that the candidate path uses an SRv6 data plane when set and an SR/MPLS data plane when clear.
P-Flag:
Indicates that the candidate path prefers the use of only protected SIDs when set and that the candidate path does not prefer the use of only protected SIDs when clear. This flag is mutually exclusive with the U-flag (i.e., both of these flags cannot be set at the same time).
U-Flag:
Indicates that the candidate path prefers the use of only unprotected SIDs when set and that the candidate path does not prefer the use of only unprotected SIDs when clear. This flag is mutually exclusive with the P-Flag (i.e., both of these flags cannot be set at the same time).
A-Flag:
Indicates that the candidate path uses only the SIDs belonging to the specified SR Algorithm when set and that the candidate path does not use only the SIDs belonging to the specified SR Algorithm when clear.
T-Flag:
Indicates that the candidate path uses only the SIDs belonging to the specified topology when set and that the candidate path does not use only the SIDs belonging to the specified topology when clear.
S-Flag:
Indicates that the use of protected (P-flag) or unprotected (U-flag) SIDs becomes a strict constraint instead of a preference when set and that there is no strict constraint (and only a preference) when clear.
F-Flag:
Indicates that the candidate path is fixed once computed and not modified except on operator intervention and that the candidate path may be modified as part of recomputation when clear.
H-Flag:
Indicates that the candidate path uses only adjacency SIDs and traverses hop-by-hop over the links corresponding to those adjacency SIDs when set and that the candidate path is not restricted to using only hop-by-hop adjacency SIDs when clear.
RESERVED1:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
MTID:
Indicates the multi-topology identifier of the IGP topology that is preferred to be used when the path is set up. When the T-flag is set, then the path is strictly using the specified topology SIDs only.
Algorithm:
Indicates the algorithm that is preferred to be used when the path is set up. When the A-flag is set, then the path is strictly using the specified algorithm SIDs only. The algorithm values are from the "IGP Algorithm Types" IANA registry under the "Interior Gateway Protocol (IGP) Parameters" registry group.
RESERVED2:
1 octet. MUST be set to 0 by the originator and MUST be ignored by a receiver.
sub-TLVs:
One or more optional sub-TLVs MAY be included in this TLV to describe other constraints. These sub-TLVs are: SR Affinity Constraint, SR Shared Risk Link Group (SRLG) Constraint, SR Bandwidth Constraint, SR Disjoint Group Constraint, SR Bidirectional Group Constraint, and SR Metric Constraint.
These constraint sub-TLVs are defined below.
SR Affinity Constraint Sub-TLV The SR Affinity Constraint sub-TLV is an optional sub-TLV of the SR Candidate Path Constraints TLV that is used to carry the affinity constraints associated with the candidate path. The affinity is expressed in terms of an Extended Administrative Group (EAG) as defined in . Only a single instance of this sub-TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The sub-TLV has the following format:
SR Affinity Constraint Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Excl-Any-Size | Incl-Any-Size | Incl-All-Size | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Exclude-Any EAG (optional, variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Include-Any EAG (optional, variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Include-All EAG (optional, variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1208
Length:
Variable, dependent on the size of the EAG. MUST be a non-zero multiple of 4 octets.
Exclude-Any-Size:
1 octet to indicate the size of Exclude-Any EAG bitmask size in multiples of 4 octets (e.g., value 0 indicates the Exclude-Any EAG field is skipped, and value 1 indicates that 4 octets of Exclude-Any EAG are included).
Include-Any-Size:
1 octet to indicate the size of Include-Any EAG bitmask size in multiples of 4 octets (e.g., value 0 indicates the Include-Any EAG field is skipped, and value 1 indicates that 4 octets of Include-Any EAG are included).
Include-All-Size:
1 octet to indicate the size of Include-All EAG bitmask size in multiples of 4 octets (e.g., value 0 indicates the Include-All EAG field is skipped, and value 1 indicates that 4 octets of Include-All EAG are included).
RESERVED:
1 octet. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Exclude-Any EAG:
The bitmask used to represent the affinities that have been excluded from the path.
Include-Any EAG:
The bitmask used to represent the affinities that have been included in the path.
Include-All EAG:
The bitmask used to represent all the affinities that have been included in the path.
SR SRLG Constraint Sub-TLV The SR SRLG Constraint sub-TLV is an optional sub-TLV of the SR Candidate Path Constraints TLV that is used to carry the SRLG values that have been excluded from the candidate path. Only a single instance of this sub-TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The sub-TLV has the following format:
SR SRLG Constraint Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | SRLG Values (variable, multiples of 4 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1209
Length:
Variable, dependent on the number of SRLGs encoded. MUST be a non-zero multiple of 4 octets.
SRLG Values:
One or more SRLG values. Each SRLG value is of 4 octets.
SR Bandwidth Constraint Sub-TLV The SR Bandwidth Constraint sub-TLV is an optional sub-TLV of the SR Candidate Path Constraints TLV that is used to indicate the bandwidth that has been requested for the candidate path. Only a single instance of this sub-TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The sub-TLV has the following format:
SR Bandwidth Constraint Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Bandwidth | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1210
Length:
4 octets
Bandwidth:
4 octets that specify the desired bandwidth in unit of bytes per second in IEEE floating point format .
SR Disjoint Group Constraint Sub-TLV The SR Disjoint Group Constraint sub-TLV is an optional sub-TLV of the SR Candidate Path Constraints TLV that is used to carry the disjointness constraint associated with the candidate path. The disjointness between two SR Policy candidate paths is expressed by associating them with the same disjoint group identifier and then specifying the type of disjointness required between their paths. The types of disjointness are described in where the level of disjointness increases in the order: link, node, SRLG, Node + SRLG. The computation is expected to achieve the highest level of disjointness requested; when that is not possible, then fall back to a lesser level progressively based on the levels indicated. Only a single instance of this sub-TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The sub-TLV has the following format:
SR Disjoint Group Constraint Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Request Flags | Status Flags | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Disjoint Group Identifier (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1211
Length:
Variable. Minimum of 8 octets.
Request Flags:
1 octet to indicate the level of disjointness requested as specified in the form of flags. The following flags are defined, and the other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 2 3 4 5 6 7 +-+-+-+-+-+-+-+-+ |S|N|L|F|I| | +-+-+-+-+-+-+-+-+ Where:
S-Flag:
Indicates that SRLG disjointness is requested when set and that SRLG disjointness is not requested when clear.
N-Flag:
Indicates that node disjointness is requested when set and that node disjointness is not requested when clear.
L-Flag:
Indicates that link disjointness is requested when set and that the link disjointness is not requested when clear.
F-Flag:
Indicates that the computation may fall back to a lower level of disjointness amongst the ones requested when all cannot be achieved when set and that fallback to a lower level of disjointness is not allowed when clear.
I-Flag:
Indicates that the computation may fall back to the default best path (e.g., an IGP path) in case none of the desired disjointness can be achieved when set and that fallback to the default best path is not allowed when clear.
Status Flags:
1 octet to indicate the level of disjointness that has been achieved by the computation as specified in the form of flags. The following flags are defined, and the other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 2 3 4 5 6 7 +-+-+-+-+-+-+-+-+ |S|N|L|F|I|X| | +-+-+-+-+-+-+-+-+ Where:
S-Flag:
Indicates that SRLG disjointness is achieved when set and that SRLG disjointness is not achieved when clear.
N-Flag:
Indicates that node disjointness is achieved when set and that node disjointness was not achieved when clear.
L-Flag:
Indicates that link disjointness is achieved when set and that link disjointness was not achieved when clear.
F-Flag:
Indicates that the computation has fallen back to a lower level of disjointness than requested when set and that there has been no fallback to a lower level of disjointness when clear.
I-Flag:
Indicates that the computation has fallen back to the best path (e.g., an IGP path) and disjointness has not been achieved when set and that there has been no fallback to the best path when clear.
X-Flag:
Indicates that the disjointness constraint could not be achieved and hence the path has been invalidated when set and that the path has not been invalidated due to unmet disjointness constraints when clear.
RESERVED:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Disjoint Group Identifier:
4-octet value that is the group identifier for a set of disjoint paths. Alternatively, this field MAY contain the entire PCEP ASSOCIATION Object as specified in (including its optional TLVs) when PCEP is used for the signaling of the SR Policy candidate path and where the BGP-LS Producer is unable to determine the group identifier that can be accommodated in a 4-octet value (since PCEP supports multiple methods of encoding an association identifier). Note that the parsing of the PCEP object is expected to be performed only by the BGP-LS Consumer (hence, outside the scope of this document) and not by any BGP Speaker as specified in . If the PCEP object size is such that the update for a single SR Policy Candidate Path NLRI would exceed the supported BGP message size by the implementation, then the PCEP ASSOCIATION Object MUST NOT be encoded and this sub-TLV skipped along with an error log. Refer to for discussion on implications of encoding large sets of information into BGP-LS.
SR Bidirectional Group Constraint Sub-TLV The SR Bidirectional Group Constraint sub-TLV is an optional sub-TLV of the SR Candidate Path Constraints TLV that is used to carry the bidirectional constraint associated with the candidate path. The bidirectional relationship between two SR Policy candidate paths is expressed by associating them with the same bidirectional group identifier and then specifying the type of bidirectional routing required between their paths. Only a single instance of this sub-TLV is advertised for a given candidate path. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. The sub-TLV has the following format:
SR Bidirectional Group Constraint Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Flags | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Bidirectional Group Identifier (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1214
Length:
Variable. Minimum of 8 octets.
Flags:
2 octets to indicate the bidirectional path setup information as specified in the form of flags. The following flags are defined, and the other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |R|C| | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Where:
R-Flag:
Indicates that the candidate path of the SR Policy forms the reverse path when the R-flag is set. If the R-flag is clear, the candidate path forms the forward path.
C-Flag:
Indicates that the bidirectional path is co-routed when set and that the bidirectional path is not co-routed when clear.
RESERVED:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Bidirectional Group Identifier:
4-octet value that is the group identifier for a set of bidirectional paths. Alternatively, this field MAY contain the entire PCEP ASSOCIATION Object as specified in (including its optional TLVs) when PCEP is used for the signaling of the SR Policy candidate path and where the BGP-LS Producer is unable to determine the group identifier that can be accommodated in a 4-octet value (since PCEP supports multiple methods of encoding an association identifier). Note that the parsing of the PCEP object is expected to be performed only by the BGP-LS Consumer (hence, outside the scope of this document) and not by any BGP Speaker as specified in . If the PCEP object size is such that the update for a single SR Policy Candidate Path NLRI would exceed the supported BGP message size by the implementation, then the PCEP ASSOCIATION Object MUST NOT be encoded and this sub-TLV skipped along with an error log. Refer to for discussion on implications of encoding large sets of information into BGP-LS.
SR Metric Constraint Sub-TLV The SR Metric Constraint sub-TLV is an optional sub-TLV of the SR Candidate Path Constraints TLV that is used to report the optimization metric of the candidate path. For a dynamic path computation, it is used to report the optimization metric used along with its parameters. For an explicit path, this sub-TLV MAY be used to report the metric margin or is bound to be used for validation (i.e., the path is invalidated if the metric is beyond specified values). Multiple instances of this sub-TLV may be used to report different metric type uses. The sub-TLV has the following format:
SR Metric Constraint Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric Type | Flags | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric Margin | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric Bound | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1215
Length:
12 octets
Metric Type:
1-octet field that identifies the type of metric being used. Below is a list of metric types introduced by this document along with references for each. Where the references are for IS-IS and OSPF specifications, those metric types are defined for a link while in the SR Policy context those relate to the candidate path or the segment list. The metric type code points that may be used in this sub-TLV are also listed in of this document. Note that the metric types in this field are taken from the "BGP-LS SR Policy Metric Types" IANA registry, which includes IGP Metric Types as well as metric types specific to SR Policy path computation (i.e., the metric types are not from the "IGP Metric-Type" registry). Additional metric types may be introduced by future documents. This document does not make any assumptions about a smaller metric value being better than a higher metric value; that is something that is dependent on the semantics of the specific metric type. This document uses the words "best" and "worst" to abstract this aspect when referring to metric margins and bounds.
Type 0: IGP:
This is specified in for IS-IS and is known as the default metric. This is specified in for OSPFv2 and in for OSPFv3 and is known as the metric in both.
Type 1: Min Unidirectional Delay:
This is specified in for IS-IS and in for OSPFv2/OSPFv3.
Type 2: TE:
This is specified in for IS-IS as the TE default metric, in for OSPFv2, and in for OSPFv3.
Type 3: Hop Count:
This is specified in .
Type 4: SID List Length:
This is specified in .
Type 5: Bandwidth:
This is specified in .
Type 6: Avg Unidirectional Delay:
This is specified in for IS-IS and in for OSPFv2/OSPFv3.
Type 7: Unidirectional Delay Variation:
This is specified in for IS-IS and in for OSPFv2/OSPFv3.
Type 8: Loss:
This is specified in for IS-IS and in for OSPFv2/OSPFv3.
Types 128 to 255 (both inclusive): User Defined:
This is specified in for IS-IS and OSPF.
Flags:
1-octet field that indicates the validity of the metric fields and their semantics. The following bit positions are defined, and the other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 2 3 4 5 6 7 +-+-+-+-+-+-+-+-+ |O|M|A|B| | +-+-+-+-+-+-+-+-+ Where:
O-Flag:
Indicates that this is the optimization metric being reported for a dynamic candidate path when set and that the metric is not the optimization metric when clear. This bit MUST NOT be set in more than one instance of this TLV for a given candidate path advertisement.
M-Flag:
Indicates that the metric margin allowed is specified when set and that the metric margin allowed is not specified when clear.
A-Flag:
Indicates that the metric margin is specified as an absolute value when set and that the metric margin is expressed as a percentage of the minimum metric when clear.
B-Flag:
Indicates that the metric bound allowed for the path is specified when set and that the metric bound is not specified when clear.
RESERVED:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Metric Margin:
4-octet value that indicates the metric margin when the M-flag is set. The metric margin is specified, depending on the A-flag, as either an absolute value or a percentage of the best computed path metric based on the specified constraints for path calculation. The metric margin allows for the metric value of the computed path to vary (depending on the semantics of the specific metric type) from the best metric value possible to optimizing for other factors (that are not specified as constraints) such as bandwidth availability, minimal SID stack depth, and the maximizing of ECMP for the computed SR path.
Metric Bound:
4-octet value that indicates the worst metric value (depending on the semantics of the specific metric type) allowed when the B-flag is set. If the computed path metric crosses the specified bound value, then the path is considered invalid.
The absolute metric margin and the metric bound values are encoded as specified for each metric type. For metric types that are smaller than 4 octets in size, the most significant bits are filled with zeros. The percentage metric margin is encoded as an unsigned integer percentage value.
SR Segment List TLV The SR Segment List TLV is used to report a single SID list of a candidate path. Multiple instances of this TLV may be used to report multiple SID lists of a candidate path. The TLV has the following format:
SR Segment List TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Flags | RESERVED1 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | MTID | Algorithm | RESERVED2 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Weight (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | sub-TLVs (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1205
Length:
Variable
Flags:
2-octet field that indicates the attribute and status of the SID list. The following bit positions are defined, and the semantics are described in detail in . Other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |D|E|C|V|R|F|A|T|M| | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Where:
D-Flag:
Indicates that the SID list consists of SRv6 SIDs when set and SR/MPLS labels when clear.
E-Flag:
Indicates that the SID list is associated with an explicit candidate path when set and a dynamic candidate path when clear. All segment lists of a given candidate path MUST be either explicit or dynamic. In case of inconsistency, the receiver MAY consider them all to be dynamic.
C-Flag:
Indicates that the SID list has been computed for a dynamic path when set. It is always reported as set for explicit paths. When clear, it indicates that the SID list has not been computed for a dynamic path.
V-Flag:
Indicates that the SID list has passed verification or its verification was not required when set and that it failed verification when clear.
R-Flag:
Indicates that the first Segment has been resolved when set and that it failed resolution when clear.
F-Flag:
Indicates that the computation for the dynamic path failed when set and that it succeeded (or was not required in case of an explicit path) when clear.
A-Flag:
Indicates that all the SIDs in the SID list belong to the specified algorithm when set and that not all the SIDs belong to the specified algorithm when clear.
T-Flag:
Indicates that all the SIDs in the SID list belong to the specified topology (identified by the multi-topology ID) when set and that not all the SIDs belong to the specified topology when clear.
M-Flag:
Indicates that the SID list has been removed from the forwarding plane due to fault detection by a monitoring mechanism (e.g., Bidirectional Forwarding Detection (BFD)) when set and that no fault is detected or no monitoring is being done when clear.
RESERVED1:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
MTID:
2 octets that indicate the multi-topology identifier of the IGP topology that is to be used when the T-flag is set.
Algorithm:
1 octet that indicates the algorithm of the SIDs used in the SID list when the A-flag is set. The algorithm values are from the "IGP Algorithm Types" IANA registry under the "Interior Gateway Protocol (IGP) Parameters" registry group.
RESERVED2:
1 octet. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Weight:
4-octet field that indicates the weight associated with the SID list for weighted load balancing. Refer to Sections and of .
Sub-TLVs:
Variable and contain the ordered set of Segments and any other optional attributes associated with the specific SID list.
The SR Segment sub-TLV (defined in ) MUST be included as an ordered set of sub-TLVs within the SR Segment List TLV when the SID list is not empty. A SID list may be empty in certain situations (e.g., for a dynamic path) where the headend has not yet performed the computation and hence not derived the segments required for the path. In such cases where the SID list is empty, the SR Segment List TLV MUST NOT include any SR Segment sub-TLVs.
SR Segment Sub-TLV The SR Segment sub-TLV describes a single segment in a SID list. One or more instances of this sub-TLV in an ordered manner constitute a SID list for an SR Policy candidate path. It is a sub-TLV of the SR Segment List TLV and it has the following format:
SR Segment Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Segment Type | RESERVED | Flags | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | SID (4 or 16 octets) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ // Segment Descriptor (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ // sub-TLVs (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1206
Length:
Variable
Segment Type:
1 octet that indicates the type of segment. Initial values are specified by this document (see for details). Additional segment types are possible but are out of scope for this document.
RESERVED:
1 octet. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Flags:
2-octet field that indicates the attribute and status of the Segment and its SID. The following bit positions are defined, and the semantics are described in . Other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |S|E|V|R|A| | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ Where:
S-Flag:
Indicates the presence of the SID value in the SID field when set and no value when clear.
E-Flag:
Indicates that the SID value is an explicitly provisioned value (locally on headend or via controller/PCE) when set and is a dynamically resolved value by headend when clear.
V-Flag:
Indicates that the SID has passed verification or did not require verification when set. When the V-flag is clear, it indicates the SID has failed verification.
R-Flag:
Indicates that the SID has been resolved or did not require resolution (e.g., because it is not the first SID) when set. When the R-flag is clear, it indicates the SID has failed resolution.
A-Flag:
Indicates that the Algorithm indicated in the segment descriptor is valid when set. When clear, it indicates that the headend is unable to determine the algorithm of the SID.
SID:
4 octets carrying the MPLS Label or 16 octets carrying the SRv6 SID based on the Segment Type. When carrying the MPLS Label, as shown in the figure below, the TC, S, and TTL (total of 12 bits) are RESERVED and MUST be set to 0 by the originator and MUST be ignored by a receiver. 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Label | TC |S| TTL | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Segment Descriptor:
Variable size segment descriptor based on the type of segment (refer to for details).
Sub-Sub-TLVs:
Variable and contain any other optional attributes associated with the specific segment.
The SRv6 Endpoint Behavior TLV (1250) and the SRv6 SID Structure TLV (1252) defined in are used as sub-sub-TLVs of the SR Segment sub-TLV. These two sub-sub-TLVs are used to optionally indicate the SRv6 Endpoint behavior and SID structure when advertising the SRv6-specific segment types.
Segment Descriptors defines multiple types of segments and their descriptions. This section defines the encoding of the segment descriptors for each of those segment types to be used in the Segment sub-TLV described previously in . The following types are currently defined, and their mappings to the respective segment types are defined in : SR Segment Types
Type Segment Description
1 (Type A) SR-MPLS Label
2 (Type B) SRv6 SID
3 (Type C) IPv4 Prefix with optional SR Algorithm
4 (Type D) IPv6 Global Prefix with optional SR Algorithm for SR-MPLS
5 (Type E) IPv4 Prefix with Local Interface ID
6 (Type F) IPv4 Addresses for link endpoints as Local, Remote pair
7 (Type G) IPv6 Prefix and Interface ID for link endpoints as Local, Remote pair for SR-MPLS
8 (Type H) IPv6 Addresses for link endpoints as Local, Remote pair for SR-MPLS
9 (Type I) IPv6 Global Prefix with optional SR Algorithm for SRv6
10 (Type J) IPv6 Prefix and Interface ID for link endpoints as Local, Remote pair for SRv6
11 (Type K) IPv6 Addresses for link endpoints as Local, Remote pair for SRv6
Type 1: Segment Type A The Segment is an SR-MPLS type and is specified simply as the label. The format of its segment descriptor is as follows:
Type 1 Segment Descriptor 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 +-+-+-+-+-+-+-+-+ | Algorithm | +-+-+-+-+-+-+-+-+
Where:
Algorithm:
1-octet value that indicates the algorithm used for picking the SID. This is valid only when the A-flag has been set in the Segment TLV. The algorithm values are from the "IGP Algorithm Types" IANA registry under the "Interior Gateway Protocol (IGP) Parameters" registry group.
Type 2: Segment Type B The Segment is an SRv6 type and is specified simply as SRv6 SID. The format of its segment descriptor is as follows:
Type 2 Segment Descriptor 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 +-+-+-+-+-+-+-+-+ | Algorithm | +-+-+-+-+-+-+-+-+
Where:
Algorithm:
1-octet value that indicates the algorithm used for picking the SID. This is valid only when the A-flag has been set in the Segment TLV. The algorithm values are from the "IGP Algorithm Types" IANA registry under the "Interior Gateway Protocol (IGP) Parameters" registry group.
Type 3: Segment Type C The Segment is an SR-MPLS Prefix SID type and is specified as an IPv4 node address. The format of its segment descriptor is as follows:
Type 3 Segment Descriptor 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 +-+-+-+-+-+-+-+-+ | Algorithm | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IPv4 Node Address (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Algorithm:
1-octet value that indicates the algorithm used for picking the SID. The algorithm values are from the "IGP Algorithm Types" IANA registry under the "Interior Gateway Protocol (IGP) Parameters" registry group.
IPv4 Node Address:
4-octet value that carries the IPv4 address associated with the node.
Type 4: Segment Type D The Segment is an SR-MPLS Prefix SID type and is specified as an IPv6 node global address. The format of its segment descriptor is as follows:
Type 4 Segment Descriptor 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 +-+-+-+-+-+-+-+-+ | Algorithm | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Node Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Algorithm:
1-octet value that indicates the algorithm used for picking the SID. The algorithm values are from the "IGP Algorithm Types" IANA registry under the "Interior Gateway Protocol (IGP) Parameters" registry group.
IPv6 Node Global Address:
16-octet value that carries the IPv6 global address associated with the node.
Type 5: Segment Type E The Segment is an SR-MPLS Adjacency SID type and is specified as an IPv4 node address along with the local interface ID on that node. The format of its segment descriptor is as follows:
Type 5 Segment Descriptor 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IPv4 Node Address (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Local Interface ID (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
IPv4 Node Address:
4-octet value that carries the IPv4 address associated with the node.
Local Interface ID:
4-octet value that carries the local interface ID of the node identified by the Node Address.
Type 6: Segment Type F The Segment is an SR-MPLS Adjacency SID type and is specified as a pair of IPv4 local and remote interface addresses. The format of its segment descriptor is as follows:
Type 6 Segment Descriptor 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IPv4 Local Interface Address (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IPv4 Remote Interface Address (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
IPv4 Local Interface Address:
4-octet value that carries the local IPv4 address associated with the node's interface.
IPv4 Remote Interface Address:
4-octet value that carries the remote IPv4 address associated with the interface on the node's neighbor. This is optional and MAY be set to 0 when not used (e.g., when identifying point-to-point links).
Type 7: Segment Type G The Segment is an SR-MPLS Adjacency SID type and is specified as a pair of IPv6 global address and interface ID for local and remote nodes. The format of its segment descriptor is as follows:
Type 7 Segment Descriptor 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Local Node Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Local Node Interface ID (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Remote Node Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Remote Node Interface ID (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
IPv6 Local Node Global Address:
16-octet value that carries the IPv6 global address associated with the local node.
Local Node Interface ID:
4-octet value that carries the interface ID of the local node identified by the Local Node Address.
IPv6 Remote Node Global Address:
16-octet value that carries the IPv6 global address associated with the remote node. This is optional and MAY be set to 0 when not used (e.g., when identifying point-to-point links).
Remote Node Interface ID:
4-octet value that carries the interface ID of the remote node identified by the Remote Node Address. This is optional and MAY be set to 0 when not used (e.g., when identifying point-to-point links).
Type 8: Segment Type H The Segment is an SR-MPLS Adjacency SID type and is specified as a pair of IPv6 global addresses for local and remote interface addresses. The format of its segment descriptor is as follows:
Type 8 Segment Descriptor 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Local Interface Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Remote Interface Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
IPv6 Local Global Address:
16-octet value that carries the local IPv6 address associated with the node's interface.
IPv6 Remote Global Address:
16-octet value that carries the remote IPv6 address associated with the interface on the node's neighbor.
Type 9: Segment Type I The Segment is an SRv6 END SID type and is specified as an IPv6 node global address. The format of its segment descriptor is as follows:
Type 9 Segment Descriptor 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 +-+-+-+-+-+-+-+-+ | Algorithm | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Node Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Algorithm:
1-octet value that indicates the algorithm used for picking the SID. The algorithm values are from the "IGP Algorithm Types" IANA registry under the "Interior Gateway Protocol (IGP) Parameters" registry group.
IPv6 Node Global Address:
16-octet value that carries the IPv6 global address associated with the node.
Type 10: Segment Type J The Segment is an SRv6 END.X SID type and is specified as a pair of IPv6 global address and interface ID for local and remote nodes. The format of its segment descriptor is as follows:
Type 10 Segment Descriptor 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Local Node Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Local Node Interface ID (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Remote Node Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Remote Node Interface ID (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
IPv6 Local Node Global Address:
16-octet value that carries the IPv6 global address associated with the local node.
Local Node Interface ID:
4-octet value that carries the interface ID of the local node identified by the Local Node Address.
IPv6 Remote Node Global Address:
16-octet value that carries the IPv6 global address associated with the remote node. This is optional and MAY be set to 0 when not used (e.g., when identifying point-to-point links).
Remote Node Interface ID:
4-octet value that carries the interface ID of the remote node identified by the Remote Node Address. This is optional and MAY be set to 0 when not used (e.g., when identifying point-to-point links).
Type 11: Segment Type K The Segment is an SRv6 END.X SID type and is specified as a pair of IPv6 global addresses for local and remote interface addresses. The format of its segment descriptor is as follows:
Type 11 Segment Descriptor 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 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Local Interface Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | | | IPv6 Remote Interface Global Address (16 octets) | | | | | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
IPv6 Local Global Address:
16-octet value that carries the local IPv6 address associated with the node's interface.
IPv6 Remote Global Address:
16-octet value that carries the remote IPv6 address associated with the interface on the node's neighbor.
SR Segment List Metric Sub-TLV The SR Segment List Metric sub-TLV reports the computed metric of the specific SID list. It is used to report the type of metric and its computed value by the computation entity (i.e., either the headend or the controller when the path is delegated) when available. More than one instance of this sub-TLV may be present in the SR Segment List to report metric values of different metric types. The metric margin and bound may be optionally reported using this sub-TLV when this information is not being reported using the SR Metric Constraint sub-TLV (refer to ) at the SR Policy candidate path level. It is a sub-TLV of the SR Segment List TLV and has the following format:
SR Segment List Metric Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric Type | Flags | RESERVED | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric Margin | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric Bound | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Metric Value | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1207
Length:
16 octets
Metric Type:
1-octet field that identifies the type of metric. The semantics are the same as the metric type field in the SR Metric Constraint sub-TLV in of this document.
Flags:
1-octet field that indicates the validity of the metric fields and their semantics. The following bit positions are defined, and the other bits MUST be cleared by the originator and MUST be ignored by a receiver. 0 1 2 3 4 5 6 7 +-+-+-+-+-+-+-+-+ |M|A|B|V| | +-+-+-+-+-+-+-+-+ Where:
M-Flag:
Indicates that the metric margin allowed for this path computation is specified when set and that the metric margin allowed is not specified when clear.
A-Flag:
Indicates that the metric margin is specified as an absolute value when set and that the metric margin is expressed as a percentage of the minimum metric when clear.
B-Flag:
Indicates that the metric bound allowed for the path is specified when set and that the metric bound is not specified when clear.
V-Flag:
Indicates that the computed metric value is being reported when set and that the computed metric value is not being reported when clear.
RESERVED:
2 octets. MUST be set to 0 by the originator and MUST be ignored by a receiver.
Metric Margin:
4-octet value that indicates the metric margin value when the M-flag is set. The metric margin is specified, depending on the A-flag, as either an absolute value or a percentage of the best computed path metric based on the specified constraints for path calculation. The metric margin allows for the metric value of the computed path to vary (depending on the semantics of the specific metric type) from the best metric value possible to optimizing for other factors (that are not specified as constraints) such as bandwidth availability, minimal SID stack depth, and the maximizing of ECMP for the computed SR path.
Metric Bound:
4-octet value that indicates the worst metric value (depending on the semantics of the specific metric type) that is allowed when the B-flag is set. If the computed path metric crosses the specified bound value, then the path is considered invalid.
Metric Value:
4-octet value that indicates the metric of the computed path when the V-flag is set. This value is available and reported when the computation is successful and a valid path is available.
The absolute metric margin, metric bound, and metric values are encoded as specified for each metric type. For metric types that are smaller than 4 octets in size, the most significant bits are filled with zeros. The percentage metric margin is encoded as an unsigned integer percentage value.
SR Segment List Bandwidth Sub-TLV The SR Segment List Bandwidth sub-TLV is an optional sub-TLV used to report the bandwidth allocated to the specific SID list by the path computation entity. Only a single instance of this sub-TLV is advertised for a given segment list. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. It is a sub-TLV of the SR Segment List TLV and has the following format:
SR Segment List Bandwidth Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Bandwidth | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1216
Length:
4 octets
Bandwidth:
4 octets that specify the allocated bandwidth in unit of bytes per second in IEEE floating point format .
SR Segment List Identifier Sub-TLV The SR Segment List Identifier sub-TLV is an optional sub-TLV used to report an identifier associated with the specific SID list. Only a single instance of this sub-TLV is advertised for a given segment list. If multiple instances are present, then the first valid one (i.e., not determined to be malformed as per ) is used and the rest are ignored. It is a sub-TLV of the SR Segment List TLV and has the following format:
SR Segment List Identifier Sub-TLV 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 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Segment List Identifier | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where:
Type:
1217
Length:
4 octets
Segment List Identifier:
4 octets that carry a 32-bit unsigned non-zero integer that serves as the identifier associated with the segment list. A value of 0 indicates that there is no identifier associated with the segment list. The scope of this identifier is the SR Policy candidate path.
Procedures The BGP-LS advertisements for the SR Policy Candidate Path NLRI type are generally originated by the headend node for the SR Policies that are instantiated on its local node (i.e., the headend is the BGP-LS Producer). The BGP-LS Producer may also be a node (e.g., a PCE) that is advertising on behalf of the headend. For the reporting of SR Policy candidate paths, the NLRI descriptor TLV as specified in is used. An SR Policy candidate path may be instantiated on the headend node via a local configuration, PCEP, or BGP SR Policy signaling, and this is indicated via the SR Protocol-Origin. When a PCE node is the BGP-LS Producer, it uses the "in PCEP" variants of the SR Protocol-Origin (where available) so as to distinguish them from advertisements by headend nodes. The SR Policy candidate path's state and attributes are encoded in the BGP-LS Attribute field as SR Policy State TLVs and sub-TLVs as described in . The SR Candidate Path State TLV as defined in is included to report the state of the candidate path. The SR BSID TLV as defined in Sections and is included to report the BSID of the candidate path when one is either specified or allocated by the headend. The constraints and the optimization metric for the SR Policy candidate path are reported using the SR Candidate Path Constraints TLV and its sub-TLVs as described in . The SR Segment List TLV is included for each SID list(s) associated with the candidate path. Each SR Segment List TLV in turn includes an SR Segment sub-TLV(s) to report the segment(s) and its status. The SR Segment List Metric sub-TLV is used to report the metric values at an individual SID list level.
Manageability Considerations The existing BGP operational and management procedures apply to this document. No new procedures are defined in this document. The considerations as specified in apply to this document. In general, the SR Policy headend nodes are responsible for the advertisement of SR Policy state information.
IANA Considerations This section describes the code point allocations by IANA for this document.
BGP-LS NLRI Types IANA maintains a registry called "BGP-LS NLRI Types" under the "Border Gateway Protocol - Link State (BGP-LS) Parameters" registry group. The following NLRI Type code point has been allocated by IANA: NLRI Type Code Point
Type NLRI Type Reference
5 SR Policy Candidate Path NLRI RFC 9857
BGP-LS Protocol-IDs IANA maintains a registry called "BGP-LS Protocol-IDs" under the "Border Gateway Protocol - Link State (BGP-LS) Parameters" registry group. The following Protocol-ID code point has been allocated by IANA: Protocol-ID Code Point
Protocol-ID NLRI information source protocol Reference
9 Segment Routing RFC 9857
BGP-LS TLVs IANA maintains a registry called "BGP-LS NLRI and Attribute TLVs" under the "Border Gateway Protocol - Link State (BGP-LS) Parameters" registry group. The following table lists the TLV code points that have been allocated by IANA: NLRI and Attribute TLV Code Points
TLV Code Point Description Reference
554 SR Policy Candidate Path Descriptor RFC 9857
1201 SR Binding SID RFC 9857
1202 SR Candidate Path State RFC 9857
1203 SR Candidate Path Name RFC 9857
1204 SR Candidate Path Constraints RFC 9857
1205 SR Segment List RFC 9857
1206 SR Segment RFC 9857
1207 SR Segment List Metric RFC 9857
1208 SR Affinity Constraint RFC 9857
1209 SR SRLG Constraint RFC 9857
1210 SR Bandwidth Constraint RFC 9857
1211 SR Disjoint Group Constraint RFC 9857
1212 SRv6 Binding SID RFC 9857
1213 SR Policy Name RFC 9857
1214 SR Bidirectional Group Constraint RFC 9857
1215 SR Metric Constraint RFC 9857
1216 SR Segment List Bandwidth RFC 9857
1217 SR Segment List Identifier RFC 9857
SR Policy Protocol-Origin Per this document, IANA has created and maintains a new registry called "SR Policy Protocol-Origin" under the "Segment Routing" registry group with the allocation policy of Expert Review using the guidelines for designated experts as specified in . This registry contains the code points allocated to the "Protocol-Origin" field defined in . IANA has assigned the initial values as follows: SR Policy Protocol-Origin Code Points
Code Point Protocol-Origin Reference
0 Reserved RFC 9857
1 PCEP RFC 9857
2 BGP SR Policy RFC 9857
3 Configuration (CLI, YANG model via NETCONF, etc.) RFC 9857
4-9 Unassigned RFC 9857
10 PCEP (in PCEP or when BGP-LS Producer is PCE) RFC 9857
11-19 Unassigned RFC 9857
20 BGP SR Policy (in PCEP or when BGP-LS Producer is PCE) RFC 9857
21-29 Unassigned RFC 9857
30 Configuration (CLI, YANG model via NETCONF, etc. In PCEP or when BGP-LS Producer is PCE) RFC 9857
31-250 Unassigned RFC 9857
251-255 Reserved for Private Use RFC 9857
BGP-LS SR Segment Descriptors Per this document, IANA has created a registry called "BGP-LS SR Segment Descriptor Types" under the "Border Gateway Protocol - Link State (BGP-LS) Parameters" registry group with the allocation policy of Expert Review using the guidelines for designated experts as specified in . There is also an additional guideline for the designated experts to maintain the alignment between the allocations in this registry with those in the "Segment Types" registry under the "Segment Routing" registry group. This requires that an allocation in the Segment Routing "Segment Types" registry is required before allocation can be done in the "BGP-LS SR Segment Descriptor Types" registry for a new segment type. However, this does not mandate that the specification of a new Segment Routing Segment Type also requires the specification of its equivalent SR Segment Descriptor Type in BGP-LS; that can be done as and when required while maintaining alignment. This registry contains the code points allocated to the "Segment Type" field defined in and described in . IANA has assigned the initial values as follows: BGP-LS SR Segment Descriptor Type Code Points
Code Point Segment Descriptor Reference
0 Reserved RFC 9857
1 Type A Segment RFC 9857
2 Type B Segment RFC 9857
3 Type C Segment RFC 9857
4 Type D Segment RFC 9857
5 Type E Segment RFC 9857
6 Type F Segment RFC 9857
7 Type G Segment RFC 9857
8 Type H Segment RFC 9857
9 Type I Segment RFC 9857
10 Type J Segment RFC 9857
11 Type K Segment RFC 9857
12-255 Unassigned RFC 9857
BGP-LS SR Policy Metric Type Per this document, IANA has created a registry called "BGP-LS SR Policy Metric Types" under the "Border Gateway Protocol - Link State (BGP-LS) Parameters" registry group with the allocation policy of Expert Review using the guidelines for designated experts as specified in . This registry contains the code points allocated to the metric type field defined in . IANA has assigned the initial values as follows: SR Policy Metric Type Code Point
Code Point Metric Type Reference
0 IGP RFC 9857
1 Min Unidirectional Delay RFC 9857
2 TE RFC 9857
3 Hop Count RFC 9857
4 SID List Length RFC 9857
5 Bandwidth RFC 9857
6 Avg Unidirectional Delay RFC 9857
7 Unidirectional Delay Variation RFC 9857
8 Loss RFC 9857
9-127 Unassigned RFC 9857
128-255 User Defined RFC 9857
Security Considerations Procedures and protocol extensions defined in this document do not affect the base BGP security model. See for details. The security considerations of the base BGP-LS specification as described in also apply. The BGP-LS SR Policy extensions specified in this document enable TE and service programming use cases within an SR domain as described in . SR operates within a trusted SR domain , and its security considerations also apply to BGP sessions when carrying SR Policy information. The SR Policies advertised to controllers and other applications via BGP-LS are expected to be used entirely within this trusted SR domain, i.e., within a single AS or between multiple ASes/domains within a single provider network. Therefore, precaution is necessary to ensure that the SR Policy information advertised via BGP sessions is limited to nodes and/or controllers/applications in a secure manner within this trusted SR domain. The general guidance for BGP-LS with respect to isolation of BGP-LS sessions from BGP sessions for other address-families (refer to the security considerations of ) may be used to ensure that the SR Policy information is not advertised to an External BGP (EBGP) peering session outside the SR domain by accident or error. Additionally, it may be considered that the export of SR Policy information, as described in this document, constitutes a risk to the confidentiality of mission-critical or commercially sensitive information about the network (more specifically, endpoint/node addresses, SR SIDs, and the SR Policies deployed). BGP peerings are not automatic and require configuration. Thus, it is the responsibility of the network operator to ensure that only trusted nodes (that include both routers and controller applications) within the SR domain are configured to receive such information.
References Normative References Key words for use in RFCs to Indicate Requirement Levels In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. OSPF Version 2 This memo documents version 2 of the OSPF protocol. OSPF is a link- state routing protocol. [STANDARDS-TRACK] Traffic Engineering (TE) Extensions to OSPF Version 2 This document describes extensions to the OSPF protocol version 2 to support intra-area Traffic Engineering (TE), using Opaque Link State Advertisements. IS-IS Extensions for Traffic Engineering This document describes extensions to the Intermediate System to Intermediate System (IS-IS) protocol to support Traffic Engineering (TE). This document extends the IS-IS protocol by specifying new information that an Intermediate System (router) can place in Link State Protocol Data Units (LSP). This information describes additional details regarding the state of the network that are useful for traffic engineering computations. [STANDARDS-TRACK] Traffic Engineering Extensions to OSPF Version 3 This document describes extensions to OSPFv3 to support intra-area Traffic Engineering (TE). This document extends OSPFv2 TE to handle IPv6 networks. A new TLV and several new sub-TLVs are defined to support IPv6 networks. [STANDARDS-TRACK] OSPF for IPv6 This document describes the modifications to OSPF to support version 6 of the Internet Protocol (IPv6). The fundamental mechanisms of OSPF (flooding, Designated Router (DR) election, area support, Short Path First (SPF) calculations, etc.) remain unchanged. However, some changes have been necessary, either due to changes in protocol semantics between IPv4 and IPv6, or simply to handle the increased address size of IPv6. These modifications will necessitate incrementing the protocol version from version 2 to version 3. OSPF for IPv6 is also referred to as OSPF version 3 (OSPFv3). Changes between OSPF for IPv4, OSPF Version 2, and OSPF for IPv6 as described herein include the following. Addressing semantics have been removed from OSPF packets and the basic Link State Advertisements (LSAs). New LSAs have been created to carry IPv6 addresses and prefixes. OSPF now runs on a per-link basis rather than on a per-IP-subnet basis. Flooding scope for LSAs has been generalized. Authentication has been removed from the OSPF protocol and instead relies on IPv6's Authentication Header and Encapsulating Security Payload (ESP). Even with larger IPv6 addresses, most packets in OSPF for IPv6 are almost as compact as those in OSPF for IPv4. Most fields and packet- size limitations present in OSPF for IPv4 have been relaxed. In addition, option handling has been made more flexible. All of OSPF for IPv4's optional capabilities, including demand circuit support and Not-So-Stubby Areas (NSSAs), are also supported in OSPF for IPv6. [STANDARDS-TRACK] Path Computation Element (PCE) Communication Protocol (PCEP) This document specifies the Path Computation Element (PCE) Communication Protocol (PCEP) for communications between a Path Computation Client (PCC) and a PCE, or between two PCEs. Such interactions include path computation requests and path computation replies as well as notifications of specific states related to the use of a PCE in the context of Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering. PCEP is designed to be flexible and extensible so as to easily allow for the addition of further messages and objects, should further requirements be expressed in the future. [STANDARDS-TRACK] OSPF Traffic Engineering (TE) Metric Extensions In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network performance information (e.g., link propagation delay) is becoming critical to data path selection. This document describes common extensions to RFC 3630 "Traffic Engineering (TE) Extensions to OSPF Version 2" and RFC 5329 "Traffic Engineering Extensions to OSPF Version 3" to enable network performance information to be distributed in a scalable fashion. The information distributed using OSPF TE Metric Extensions can then be used to make path selection decisions based on network performance. Note that this document only covers the mechanisms by which network performance information is distributed. The mechanisms for measuring network performance information or using that information, once distributed, are outside the scope of this document. Guidelines for Writing an IANA Considerations Section in RFCs Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA). To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry. This is the third edition of this document; it obsoletes RFC 5226. Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. Segment Routing Architecture Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through an ordered list of instructions, called "segments". A segment can represent any instruction, topological or service based. A segment can have a semantic local to an SR node or global within an SR domain. SR provides a mechanism that allows a flow to be restricted to a specific topological path, while maintaining per-flow state only at the ingress node(s) to the SR domain. SR can be directly applied to the MPLS architecture with no change to the forwarding plane. A segment is encoded as an MPLS label. An ordered list of segments is encoded as a stack of labels. The segment to process is on the top of the stack. Upon completion of a segment, the related label is popped from the stack. SR can be applied to the IPv6 architecture, with a new type of routing header. A segment is encoded as an IPv6 address. An ordered list of segments is encoded as an ordered list of IPv6 addresses in the routing header. The active segment is indicated by the Destination Address (DA) of the packet. The next active segment is indicated by a pointer in the new routing header. IS-IS Traffic Engineering (TE) Metric Extensions In certain networks, such as, but not limited to, financial information networks (e.g., stock market data providers), network-performance criteria (e.g., latency) are becoming as critical to data-path selection as other metrics. This document describes extensions to IS-IS Traffic Engineering Extensions (RFC 5305). These extensions provide a way to distribute and collect network-performance information in a scalable fashion. The information distributed using IS-IS TE Metric Extensions can then be used to make path-selection decisions based on network performance. Note that this document only covers the mechanisms with which network-performance information is distributed. The mechanisms for measuring network performance or acting on that information, once distributed, are outside the scope of this document. This document obsoletes RFC 7810. Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing Segment Routing (SR) enables any head-end node to select any path without relying on a hop-by-hop signaling technique (e.g., LDP or RSVP-TE). It depends only on "segments" that are advertised by link-state Interior Gateway Protocols (IGPs). An SR path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), an explicit configuration, or a Path Computation Element (PCE). This document specifies extensions to the Path Computation Element Communication Protocol (PCEP) that allow a stateful PCE to compute and initiate Traffic-Engineering (TE) paths, as well as a Path Computation Client (PCC) to request a path subject to certain constraints and optimization criteria in SR networks. This document updates RFC 8408. Path Computation Element Communication Protocol (PCEP) Extensions for Establishing Relationships between Sets of Label Switched Paths (LSPs) This document introduces a generic mechanism to create a grouping of Label Switched Paths (LSPs) in the context of a Path Computation Element (PCE). This grouping can then be used to define associations between sets of LSPs or between a set of LSPs and a set of attributes (such as configuration parameters or behaviors), and it is equally applicable to the stateful PCE (active and passive modes) and the stateless PCE. Segment Routing over IPv6 (SRv6) Network Programming The Segment Routing over IPv6 (SRv6) Network Programming framework enables a network operator or an application to specify a packet processing program by encoding a sequence of instructions in the IPv6 packet header. Each instruction is implemented on one or several nodes in the network and identified by an SRv6 Segment Identifier in the packet. This document defines the SRv6 Network Programming concept and specifies the base set of SRv6 behaviors that enables the creation of interoperable overlays with underlay optimization. Border Gateway Protocol - Link State (BGP-LS) Extensions for Segment Routing BGP Egress Peer Engineering A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with a list of segment identifiers (SIDs). A segment can represent any instruction, topological or service based. SR segments allow steering a flow through any topological path and service chain while maintaining per-flow state only at the ingress node of the SR domain. This document describes an extension to Border Gateway Protocol - Link State (BGP-LS) for advertisement of BGP Peering Segments along with their BGP peering node information so that efficient BGP Egress Peer Engineering (EPE) policies and strategies can be computed based on Segment Routing. Segment Routing Policy Architecture Segment Routing (SR) allows a node to steer a packet flow along any path. Intermediate per-path states are eliminated thanks to source routing. SR Policy is an ordered list of segments (i.e., instructions) that represent a source-routed policy. Packet flows are steered into an SR Policy on a node where it is instantiated called a headend node. The packets steered into an SR Policy carry an ordered list of segments associated with that SR Policy. This document updates RFC 8402 as it details the concepts of SR Policy and steering into an SR Policy. Border Gateway Protocol - Link State (BGP-LS) Extensions for Segment Routing over IPv6 (SRv6) Segment Routing over IPv6 (SRv6) allows for a flexible definition of end-to-end paths within various topologies by encoding paths as sequences of topological or functional sub-paths called "segments". These segments are advertised by various protocols such as BGP, IS-IS, and OSPFv3. This document defines extensions to BGP - Link State (BGP-LS) to advertise SRv6 segments along with their behaviors and other attributes via BGP. The BGP-LS address-family solution for SRv6 described in this document is similar to BGP-LS for SR for the MPLS data plane, which is defined in RFC 9085. Distribution of Link-State and Traffic Engineering Information Using BGP In many environments, a component external to a network is called upon to perform computations based on the network topology and the current state of the connections within the network, including Traffic Engineering (TE) information. This is information typically distributed by IGP routing protocols within the network. This document describes a mechanism by which link-state and TE information can be collected from networks and shared with external components using the BGP routing protocol. This is achieved using a BGP Network Layer Reachability Information (NLRI) encoding format. The mechanism applies to physical and virtual (e.g., tunnel) IGP links. The mechanism described is subject to policy control. Applications of this technique include Application-Layer Traffic Optimization (ALTO) servers and Path Computation Elements (PCEs). This document obsoletes RFC 7752 by completely replacing that document. It makes some small changes and clarifications to the previous specification. This document also obsoletes RFC 9029 by incorporating the updates that it made to RFC 7752. IGP Flexible Algorithms: Bandwidth, Delay, Metrics, and Constraints Many networks configure the IGP link metric relative to the link capacity, and high bandwidth traffic gets routed per the link capacity. Flexible Algorithms provide mechanisms to create constraint-based paths in an IGP. This specification documents a generic metric-type and a set of bandwidth-related constraints to be used in Flexible Algorithms. This document updates RFC 9350. Informative References Advertisement of Traffic Engineering Paths using BGP Link-State Individual Cisco Systems Huawei Technologies RtBrick Inc. Nvidia Work in Progress IEEE Standard for Floating-Point Arithmetic Institute of Electrical and Electronics Engineers Requirements for Traffic Engineering Over MPLS This document presents a set of requirements for Traffic Engineering over Multiprotocol Label Switching (MPLS). It identifies the functional capabilities required to implement policies that facilitate efficient and reliable network operations in an MPLS domain. This memo provides information for the Internet community. Routing Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS) This document specifies routing extensions in support of carrying link state information for Generalized Multi-Protocol Label Switching (GMPLS). This document enhances the routing extensions required to support MPLS Traffic Engineering (TE). [STANDARDS-TRACK] A Path Computation Element (PCE)-Based Architecture Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains. This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space. This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed. This memo provides information for the Internet community. Autonomous System Confederations for BGP The Border Gateway Protocol (BGP) is an inter-autonomous system routing protocol designed for Transmission Control Protocol/Internet Protocol (TCP/IP) networks. BGP requires that all BGP speakers within a single autonomous system (AS) must be fully meshed. This represents a serious scaling problem that has been well documented in a number of proposals. This document describes an extension to BGP that may be used to create a confederation of autonomous systems that is represented as a single autonomous system to BGP peers external to the confederation, thereby removing the "full mesh" requirement. The intention of this extension is to aid in policy administration and reduce the management complexity of maintaining a large autonomous system. This document obsoletes RFC 3065. [STANDARDS-TRACK] Analysis of BGP, LDP, PCEP, and MSDP Issues According to the Keying and Authentication for Routing Protocols (KARP) Design Guide This document analyzes TCP-based routing protocols, the Border Gateway Protocol (BGP), the Label Distribution Protocol (LDP), the Path Computation Element Communication Protocol (PCEP), and the Multicast Source Distribution Protocol (MSDP), according to guidelines set forth in Section 4.2 of "Keying and Authentication for Routing Protocols Design Guidelines", RFC 6518. Extended Administrative Groups in MPLS Traffic Engineering (MPLS-TE) MPLS Traffic Engineering (MPLS-TE) advertises 32 administrative groups (commonly referred to as "colors" or "link colors") using the Administrative Group sub-TLV. This is defined for OSPFv2 (RFC 3630), OSPFv3 (RFC 5329) and IS-IS (RFC 5305). This document adds a sub-TLV to the IGP TE extensions, "Extended Administrative Group". This sub-TLV provides for additional administrative groups (link colors) beyond the current limit of 32. Path Computation Element Communication Protocol (PCEP) Extensions for Stateful PCE The Path Computation Element Communication Protocol (PCEP) provides mechanisms for Path Computation Elements (PCEs) to perform path computations in response to Path Computation Client (PCC) requests. Although PCEP explicitly makes no assumptions regarding the information available to the PCE, it also makes no provisions for PCE control of timing and sequence of path computations within and across PCEP sessions. This document describes a set of extensions to PCEP to enable stateful control of MPLS-TE and GMPLS Label Switched Paths (LSPs) via PCEP. Path Computation Element Communication Protocol (PCEP) Extension for Label Switched Path (LSP) Diversity Constraint Signaling This document introduces a simple mechanism to associate a group of Label Switched Paths (LSPs) via an extension to the Path Computation Element Communication Protocol (PCEP) with the purpose of computing diverse (disjointed) paths for those LSPs. The proposed extension allows a Path Computation Client (PCC) to advertise to a Path Computation Element (PCE) that a particular LSP belongs to a particular Disjoint Association Group; thus, the PCE knows that the LSPs in the same group need to be disjoint from each other. Advertising Segment Routing Policies in BGP A Segment Routing (SR) Policy is an ordered list of segments (also referred to as "instructions") that define a source-routed policy. An SR Policy consists of one or more Candidate Paths (CPs), each comprising one or more segment lists. A headend can be provisioned with these CPs using various mechanisms such as Command-Line Interface (CLI), Network Configuration Protocol (NETCONF), Path Computation Element Communication Protocol (PCEP), or BGP. This document specifies how BGP can be used to distribute SR Policy CPs. It introduces a BGP SAFI for advertising a CP of an SR Policy and defines sub-TLVs for the Tunnel Encapsulation Attribute to signal information related to these CPs. Furthermore, this document updates RFC 9012 by extending the Color Extended Community to support additional steering modes over SR Policy. Segment Type Extensions for BGP Segment Routing (SR) Policy This document specifies the signaling of additional Segment Routing (SR) Segment Types for SR Policies in BGP using the SR Policy Subsequent Address Family Identifier (SAFI).
Acknowledgements The authors would like to thank , , , , , , , , , , , , , , , , , , , , and for their reviews and valuable comments. The authors would also like to thank for her shepherd review and helpful comments to improve this document. The authors would like to thank for his AD review and helpful suggestions to improve this document.
Contributors The following people have contributed substantially to the content of this document and should be considered coauthors: Cisco Systems
cfilsfil@cisco.com
Huawei Technologies
mach.chen@huawei.com
Authors' Addresses Individual
stefano@previdi.net
Cisco Systems
India ketant.ietf@gmail.com
Huawei Technologies
Huawei Campus, No. 156 Beiqing Rd. Beijing 100095 China jie.dong@huawei.com
RtBrick Inc.
hannes@rtbrick.com
Nvidia
jefftant.ietf@gmail.com