]> Cisco Systems, Inc.

cschmutz@cisco.com

Cisco Systems, Inc.

zali@cisco.com

Airtel India

Praveen.Maheshwari@airtel.com

Ciena

rrokui@ciena.com

Nokia

andrew.stone@nokia.com

This document describes how Segment Routing (SR) policies can be used to satisfy the requirements for bandwidth, end-to-end recovery and persistent paths within a segment routing network. SR policies satisfying these requirements are called "circuit-style" SR policies (CS-SR policies).

Introduction Segment routing does allow for a single network to carry both typical IP (connection-less) services and connection-oriented transport services commonly referred to as "private lines". IP services typically require ECMP and TI-LFA, while transport services delivered via pseudowires (defined by the PWE3 and PALS workgroups) do require:

• Persistent end-to-end traffic engineered paths that provide predictable and identical latency in both directions
• A requested amount of bandwidth per path to ensure no impact on the Service Level Agreement (SLA) due to changing network load from other services
• Fast end-to-end protection and restoration mechanisms
• Monitoring and maintenance of path integrity
• Data plane remaining up while control plane is down

Such a "transport centric" behavior is referred to as "circuit-style" in this document. This document describes how SR policies and the use of adjacency-SIDs defined in the SR architecture together with a stateful Path Computation Element (PCE) can be used to satisfy those requirements. It includes how end-to-end recovery and path integrity monitoring can be implemented. SR policies that satisfy those requirements are called "circuit-style" SR policies (CS-SR policies).

Terminology

• BSID : Binding Segment Identifier
• CS-SR : Circuit-Style Segment Routing
• ID : Identifier
• LSP : Label Switched Path
• LSPA : LSP attributes
• OAM : Operations, Administration and Maintenance
• OF : Objective Function
• PCE : Path Computation Element
• PCEP : Path Computation Element Communication Protocol
• PT : Protection Type
• SID : Segment Identifier
• SLA : Service Level Agreement
• SR : Segment Routing
• STAMP : Simple Two-Way Active Measurement Protocol
• TI-LFA : Topology Independent Loop Free Alternate
• TLV : Type Length Value

Reference Model The reference model for CS-SR policies is following the Segment Routing Architecture and SR Policy Architecture and is depicted in .

Circuit-style SR Policy Reference Model | PCE/controller |<------------+ | +----------------+ | PCEP/BGP PCEP/BGP | | v <<<<<<<<<<<<<< CS-SR Policy >>>>>>>>>>>>> v +-------+ +-------+ | |=========================================>| | | A | SR-policy from A to Z | Z | | |<=========================================| | +-------+ SR-policy from Z to A +-------+ ]]>

By nature of CS-SR policies, paths will be computed and maintained by a centralized entity providing a consistent simple mechanism for initializing the co-routed bidirectional end to end paths, performing bandwidth allocation control, as well as monitoring facilities to ensure SLA compliance for the live of the CS-SR Policy. When using PCEP as the communication protocol on the endpoints, the centralized entity is a stateful PCE defined in . When using a MPLS data plane , PCEP extensions defined in will be used. When using a SRv6 data plane , PCEP extensions defined in will be used. When using BGP as the communication protocol on the endpoints, the centralized entity does perform the same role. BGP extensions defined in will be used. In order to satisfy the requirements of CS-SR policies, each link in the topology MUST have:

• An adjacency-SID which is:
  • Manually allocated or persistent : to ensure that its value does not change after a node reload
  • Non-protected : to avoid any local TI-LFA protection to happen upon interface/link failures
• The bandwidth available for CS-SR policies specified
• A per-hop behavior ( or ) that ensures that the specified bandwidth is available to CS-SR policies at all times independent of any other traffic

When using a MPLS data plane existing IGP extensions defined in and and BGP-LS defined in can be used to distribute the topology information including those persistent and unprotected adjacency-SIDs. When using a SRv6 data plane the IGP extensions defined in and and BGP-LS extensions in apply.

Managing Bandwidth In a network, resources are represented by links of certain bandwidth. In a circuit switched network such as SONET/SDH, OTN or DWDM resources (timeslots or a wavelength) are allocated for a provisioned connection at the time of reservation even if no communication is present. In a packet switched network resources are only allocated when communication is present, i.e. packets are to be sent. This allows for the total reservations to exceed the link bandwidth as well in general for link congestion. To satisfy the bandwidth requirement for CS-SR policies it must be ensured that packets carried by CS-SR policies can be at all times sent up to the reserved bandwidth on each hop along the path. This is done by:

• Firstly, CS-SR policy bandwidth reservations per link must be limited to euqal or less than the physical link bandwidth.
• Secondly, ensuring traffic for each CS-SR policy is limited to the bandwidth reserved for that CS-SR policy by traffic policing or shaping
• Thirdly, ensuring that during times of link congestion only non-CS-SR policy traffic is being buffered or dropped.

For the later several approaches can be considered:

• Allocate a dedicated physical link of bandwidth P to CS-SR policies and allow CS-SR reservations up to bandwidth C. Consider bandwidth N allocated for network control, ensure that P - N >= C
• Allocate a dedicate logical link (i.e. 801.q VLAN on ethernet) to CS-SR policies on a physical link of bandwidth P. Limit the total utilization across all other logical links to bandwidth O by traffic policing or shaping and ensure that P - N - O >= C
• Allocate a dedicated Diffserv codepoint and queue to CS-SR policies and limit the total utilization across all other queues to bandwidth O by traffic policing or shaping and ensure that P -N - O >= C
• Allocate a dedicate Diffserv codepoint and strict priority queue to CS-SR policies and limit the total utilization across all priority queues of higher or equal priority to bandwidth O by traffic policing or shaping and ensure that P - N - O >= C
• Allocate a dedicate Diffserv codepoint and a strict priority queue with a priority higher than all other queues to CS-SR policies and limit the utilization of that priority queue by traffic policing to C <= P - N

In addition CS-SR policy telemetry collection can be used to raise alarms when bandwidth utilization thresholds are passed or to request the reserved bandwidth to be adjusted.

CS-SR Policy Characteristics A CS-SR policy has the following characteristics:

• Requested bandwidth : bandwidth to be reserved for the CS-SR policy
• Bidirectional co-routed : a CS-SR policy between A and Z is an association of an SR-Policy from A to Z and an SR-Policy from Z to A following the same path(s)
• Deterministic and persistent paths : segment lists with strict hops using unprotected adjacency-SIDs
• Not automatically recomputed or reoptimized : the SID list of a candidate path must not change automatically to a SID list representing a different path (for example upon topology change)
• Multiple candidate paths in case of protection/restoration:
  • Following the SR policy architecture, the highest preference valid path is carrying traffic
  • Depending on the protection/restoration scheme (), lower priority candidate paths
    • may be pre-computed
    • may be pre-programmed
    • may have to be disjoint
• Connectivity verification and performance measurement is activated on each candidate path ()

CS-SR Policy Creation

Policy Creation when using PCEP Considering the scenario illustrated in a CS-SR policy between A and Z is configured both on A (with Z as endpoint) and Z (with A as endpoint). Both nodes A and Z act as PCC and delegate path computation to the PCE using PCEP with the extensions defined in and the procedure described in . The PCRpt message sent from the headends to the PCE contains the following parameters:

• BANDWIDTH object (Section 7.7 of ) : to indicate the requested bandwidth
• LSPA object (section 7.11 of ) : to indicate that no local protection requirements
  • L flag set to 0 : no local protection
  • E flag set to 1 : protection enforcement (section 5 of )
• ASSOCIATION object () :
  • Type : Double-sided Bidirectional with Reverse LSP Association ()
  • Bidirectional Association Group TLV () :
    • R flag is always set to 0 (forward path)
    • C flag is always set to 1 (co-routed)

If the SR-policies are configured with more than one candidate path, a PCEP request is sent per candidate path. Each PCEP request does include the "SR Policy Association" object (type 6) as defined in to make the PCE aware of the candidate path belonging to the same policy. The signaling extensions described in are used to ensure that

• Path determinism is achieved by the PCE only using segment lists representing a strict hop by hop path using unprotected adjacency-SIDs.
• Path persistency across node reloads in the network is achieved by the PCE only including manually configured adjacency-SIDs in its path computation response.
• Persistency across network changes is achieved by the PCE not performing periodic nor network event triggered re-optimization.

Bandwidth adjustment can be requested after initial creation by signaling both requested and operational bandwidth in the BANDWIDTH object but the PCE is not allowed to respond with a changed path. As discussed in section 3.2 of it may be necessary to use load-balancing across multiple paths to satisfy the bandwidth requirement of a candidate path. In such a case the PCE will notify the PCC to install multiple segment lists using the signaling procedures described in section 5.3 of .

Policy Creation when using BGP Again considering the scenario illustrated in , there is no CS-SR policy configuration required on A nor Z in order to create the CS-SR policy between A and Z. The centralized controller is instructed (i.e. by an application via a API call) to create the CS-SR policy, for which the controller does perform path computation and is requesting A via BGP to instante a SR-policy (with Z as endpoint) and requesting Z via BGP to instantiate a SR-policy (with Z as endpoint). To instantiate the SR-policies in A and Z the BGP extensions defined in are used. No signaling extensions are required for the following:

• Path determinism is achieved by the controller only using segment lists representing a strict hop by hop path using unprotected adjacency-SIDs.
• Path persistency across node reloads in the network is achieved by the controller only including manually configured adjacency-SIDs in its path computation response.
• Persistency across network changes is achieved by the controller not performing periodic nor network event triggered re-optimization.

If there are more than one candidate paths per SR-policy required, multiple NLRIs with different distinguisher values (see section 2.1 of ) have to be included in the BGP UPDATE message. To achieve load-balancing across multiple paths to satisfy the bandwidth requirement of a candidate path, multiple Segment List Sub-TLVs have to be included in the SR Policy Sub-TLV. See section 2.1 of The endpoints A and Z report the SR-policy states back to the centralized controller via BGP-LS using the extension defined in .

Maximum Segment Depth A Segment Routed path defined by a segment list is constrained by maximum segment depth (MSD), which is the maximum number of segments a router can impose onto a packet. , , and provide the necessary capabilities for a PCE to determine the MSD capability of a router. The MSD constraint is typically resolved by leveraging a label stack reduction technique, such as using Node SIDs and/or BSIDs (SR architecture ) in a segment list, which represents one or many hops in a given path. As described in , adjacency-SIDs without local protection are to be used for CS-SR policies to ensure no ECMP, no rerouting due to topological changes nor localized protection is being invoked on the traffic, as the alternate path may not be providing the desired SLA. If a CS-SR Policy path requires SID List reduction, a Node SID cannot be utilized as it is eligible for traffic rerouting following IGP re-convergence. However, a BSID can be programmed to a transit node, if the following requirements are met:

• The BSID is unprotected, hence only has one candidate path
• The BSID follows the rerouting and optimization characteristics defined in which implies the SID list of the candidate path MUST only use unprotected adjacency-SIDs.

This ensures that any CS-SR policies in which the BSID provides transit for do not get rerouted due to topological changes or protected due to failures. A BSID may be pre-programmed in the network or automatically injected in the network by a PCE.

Recovery Schemes Various protection and restoration schemes can be implemented. The terms "protection" and "restoration" are used with the same subtle distinctions outlined in section 1 of , and respectively.

• Protection : another candidate path is computed and fully established in the data plane and ready to carry traffic
• Restoration : a candidate path may be computed and may be partially established but is not ready to carry traffic

The term "failure" is used to represent both "hard failures" such complete loss of connectivity detected by or degradation, a packet loss ratio, beyond a configured acceptable threshold.

Unprotected In the most basic scenario no protection nor restoration is required. The CS-SR policy has only one candidate path configured. This candidate path is established, activated and is carrying traffic. When using PCEP, a PCRpt message is sent from the PCC to the PCE with the O field in the LSP object set to 2. When using BGP, a BGP-LS update with a SP Policy Candidate Path NLRI is sent from the endpoint to the centralized controller having

• C flag set to 1 to indicate the candidate path was provisioned by the controller
• A flag set to 1 to indicate the candidate path is active and carrying traffic

In case of a failure along the path the CS-SR policy will go down and traffic will not be recovered. Typically two CS-SR policies are deployed either within the same network with disjoint paths or in two completely separate networks and the overlay service is responsible for traffic recovery.

1:1 Protection For fast recovery against failures the CS-SR policy has two candidate paths. Both paths are established but only the candidate with higher preference is activated and is carrying traffic. When using PCEP, the PCRpt message for the candidate path with higher preference will have the O field in the LSP object set to 2. For the candidate path with the lower preference the O field in the LSP object is set to 1. Appropriate routing of the protect path diverse from the working path can be requested from the PCE by using the "Disjointness Association" object (type 2) defined in in the PCRpt messages. The disjoint requirements are communicated in the "DISJOINTNESS-CONFIGURATION TLV"

• L bit set to 1 for link diversity
• N bit set to 1 for node diversity
• S bit set to 1 for SRLG diversity
• T bit set to enforce strict diversity

The P bit may be set for first candidate path to allow for finding the best working path that does satisfy all constraints without considering diversity to the protect path. The "Objective Function (OF) TLV" as defined in section 5.3 of may also be added to minimize the common shared resources. When using BGP, the controller is already aware of the disjoint requirements and does consider them while computing both paths. Two NLRIs with different distinguisher values and different preference values are included in the BGP UPDATE sent to the headend routers. A BGP-LS update is sent to the controller with a SP Policy Candidate Path NLRI for the candidate path with higher preference with

• C flag set to 1 to indicate that candidate path was provisioned by the controller
• A flag set to 1 to indicate the candidate path is active and carrying traffic

and another SP Policy Candidate Path NLRI for the candidate path with lower preference with

• C flag set to 1 to indicate the candidate path was provisioned by the controller
• B flag set to 1 to indicate the role of backup path

Upon a failure impacting the candidate path with higher preference carrying traffic, the candidate path with lower preference is activated immediately and traffic is now sent across it. Protection switching is bidirectional. As described in , both headends will generate and receive their own loopback mode test packets, hence even a unidirectional failure will always be detected by both headends without protection switch coordination required. Two cases are to be considered when the failure impacting the candidate path with higher preference is cleared:

• Revertive switching : re-activate the candidate path, change O field from 0 to 2 and start sending traffic over it
• Non-revertive switching : do not activate the candidate path, change O field from 0 to 1, keep the second candidate path active with O field set to 2 and continue sending traffic over it

Restoration

1+R Restoration Compared to 1:1 protection described in , this restoration scheme avoids pre-allocating protection bandwidth in steady state, while still being able to recover traffic flow in case of a network failure in a deterministic way (maintain required bandwidth commitment) When using PCEP, the CS-SR policy is configured with two candidate paths. The candidate path with higher preference is established, activated (O field in LSP object is set to 2) and is carrying traffic. The second candidate path with lower preference is only established and activated (O field in LSP object is set to 2) upon a failure impacting the first candidate path in order to send traffic over an alternate path through the network around the failure with potentially relaxed constraints but still satisfying the bandwidth commitment. The second candidate path is generally only requested from the PCE and activated after a failure, but may also be requested and pre-established during CS-SR policy creation with the downside of bandwidth being set aside ahead of time. As soon as failure(s) that brought the first candidate path down are cleared, the second candidate path is getting deactivated (O field in LSP object is set to 1) or torn down. The first candidate path is activated (O field in LSP object is set to 2) and traffic sent across it. When using BGP, the controller does compute one path and does include one NLRI in the BGP UPDATE message sent to the headend routers to instantiate the CS-SR policy with one candidate path active and carrying traffic. A BGP-LS update with a SP Policy Candidate Path NLRI is sent to the controller with

• C flag set to 1 to indicate the candidate path was provisioned by the controller
• A flag set to 1 to indicate the candidate path is active and carrying traffic

Upon the controller detecting the failure of the CS-SR policy's candidate path, another path is computed and added as second candidate path to the CS-SR policy by sending a BGP UPDATE message to the headend routers with a NLRI distinguisher value being different and preference being lower compared to the first candidate path. A BGP-LS update with a SP Policy Candidate Path NLRI for the candidate path with higher preference is sent to the controller with

• A flag is cleared to indicate the candidate path is no longer active and not carrying traffic anymore

and another SP Policy Candidate Path NLRI for the candidate path with lower preference with

• C flag set to 1 to indicate the candidate path was provisioned by the controller
• A flag set to 1 to indicate the candidate path is active and carrying traffic

The second candidate path is generally only instantiated by the controller and activated after a failure, but may also be instantiated and pre-established during CS-SR policy creation with the downside of bandwidth being set aside ahead of time. If so, a BGP-LS update with a SP Policy Candidate Path NLRI is sent to the controller with

• C flag set to 1 to indicate the candidate path was provisioned by the controller
• B flag set to 1 to indicate the role of backup path

Once the controller has detected the failure(s) that brought the first candidate path down are cleared, the second candidate path is getting removed by a BGP UPDATE message withdrawing the NLRI of the second candidate path. A BGP-LS update with a SP Policy Candidate Path NLRI for the remaining candidate path is sent to the controller with

• A flag set to 1 to indicate the candidate path became active and is carrying traffic again

Restoration and reversion behavior is bidirectional. As described in , both headends use connectivity verification in loopback mode and therefore even in case of unidirectional failures both headends will detect the failure or clearance of the failure and switch traffic away from the failed or to the recovered candidate path.

1:1+R Restoration For further resiliency in case of multiple concurrent failures that could affect both candidate paths of 1:1 protection described in , a third candidate path with a preference lower than the other two candidate paths is added to the CS-SR policy to enable restoration. When using PCEP, the third candidate path will generally only be established, activated (O field in LSP object is set to 2) and carry traffic after failure(s) have impacted both the candidate path with highest and second highest preference. The third candidate path may also be requested and pre-computed already whenever either the first or second candidate path went down due to a failure with the downside of bandwidth being set aside ahead of time. As soon as failure(s) that brought either the first or second candidate path down are cleared the third candidate path is getting deactivated (O field in LSP object is set to 1), the candidate path that recovered is activated (O field in LSP object is set to 2) and traffic sent across it. When using BGP, the third candidate path will generally only be instantiated by the controller and activated after failure(s) have impacted both the candidate path with highest and second highest preference, but may also be instantiated and pre-established during CS-SR policy creation with the downside of bandwidth being set aside ahead of time. Assuming the case where both candidate paths are down, a BGP-LS update is sent with SP Policy Candidate Path NLRIs for the first and second candidate path with

• A flag cleared

and a SP Policy Candidate Path NLRI for the third candidate path with

• C flag set to 1 to indicate the candidate path was provisioned by the controller
• A flag set to 1 to indicate the candidate path is active and carrying traffic

Assuming the case where only one candidate path is down, a BGP-LS update is sent with a SP Policy Candidate Path NLRI for the failed candidate path with

• A flag cleared

a SP Policy Candidate Path NLRI for the second candidate path with

• A flag set to 1 to indicate it is active and carrying traffic network

and another SP Policy Candidate Path NLRI for the newly installed third candidate path with

• C flag set to 1 to indicate the candidate path was provisioned by the controller
• B flag set to 1 to indicate the role of backup path

Again restoration and reversion behavior is bidirectional. As described in , both headends use connectivity verification in loopback mode and therefore even in case of unidirectional failures both headends will detect the failure or clearance of the failure and switch traffic away from the failed or to the recovered candidate path.

Operations, Administration, and Maintenance (OAM)

Connectivity Verification The proper operation of each segment list is validated by both headends using STAMP in loopback measurement mode as described in section 4.2.3 of . As the STAMP test packets are including both the segment list of the forward and reverse path, standard segment routing data plane operations will make those packets get switched along the forward path to the tailend and along the reverse path back to the headend. When using PCEP, the headend forms the bidirectional SR Policy association using the procedure described in and receives the information about the reverse segment list from the PCE as described in section 4.5 of When using BGP, the controller does inform the headend routers about the reverse segment list using the Reverse Segment List Sub-TLV defined in section 4.1 of .

Performance Measurement The same STAMP session is used to estimate round-trip loss as described in section 5 of . The same STAMP session used for connectivity verification can be used to measure delay. As loopback mode is used only round-trip delay is measured and one-way has to be derived by dividing the round-trip delay by two.

Candidate Path Validity Verification A stateful PCE/controller is in sync with the network topology and the CS-SR Policies provisioned on the headend routers. As described in a path must not be automatically recomputed after or optimized for topology changes. However there may be a requirement for the stateful PCE/controller to tear down a path if the path no longer satisfies the original requirements, detected by stateful PCE/controller, such as insufficient bandwidth, diversity constraint no longer met or latency constraint exceeded. The headend may measure the actual bandwidth utilization of a CS-SR policy to take local action and/or report it as requested bandwidth via PCEP or BGP-LS to the stateful PCE/controller. Typical actions are raising alarms or adjusting the reserved bandwidth. For a CS-SR policy configured with multiple candidate paths, a headend may switch to another candidate path if the stateful PCE/controller decided to tear down the active candidate path.

External Commands

Candidate Path Switchover It is very common to allow operators to trigger a switch between candidate paths even if no failure is present. I.e. to proactively drain a resource for maintenance purposes. Operator triggered switching between candidate paths is unidirectional and has to be requested on both headends.

Candidate Path Re-computation While no automatic re-optimization or pre-computation of CS-SR policy candidate paths is allowed as specified in , network operators trying to optimize network utilization may explicitly request a candidate path to be re-computed at a certain point in time.

Security Considerations TO BE ADDED

IANA Considerations This document has no IANA actions.

Acknowledgements The author's want to thank Samuel Sidor, Mike Koldychev, Rakesh Gandhi and Tarek Saad for providing their review comments and all contributors for their inputs and support.

References Normative References 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. Informative References 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. Cisco Systems Cisco Systems Bell Canada British Telecom Microsoft 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. 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. Segment Routing (SR) leverages the source-routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS data plane, the SR header is instantiated through a label stack. This document specifies the forwarding behavior to allow instantiating SR over the MPLS data plane (SR-MPLS). 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. Segment Routing can be applied to the IPv6 data plane using a new type of Routing Extension Header called the Segment Routing Header (SRH). This document describes the SRH and how it is used by nodes that are Segment Routing (SR) capable. Huawei Technologies RtBrick Inc Ciena Corporation Cisco Systems, Inc. China Telecom Segment Routing (SR) can be used to steer packets through an IPv6 or MPLS network using the source routing paradigm. 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). A Segment Routed Path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), explicit configuration, or a PCE. Since SR can be applied to both MPLS and IPv6 forwarding planes, a PCE should be able to compute SR-Path for both MPLS and IPv6 forwarding planes. The PCEP extension and mechanisms to support SR- MPLS have been defined. This document describes the extensions required for SR support for IPv6 data plane in the Path Computation Element communication Protocol (PCEP). Huawei Technologies Cisco Systems Cisco Systems Microsoft Google This document introduces a BGP SAFI with two NLRIs to advertise a candidate path of a Segment Routing (SR) Policy. An SR Policy is an ordered list of segments (i.e., instructions) that represent a source-routed policy. An SR Policy consists of one or more candidate paths, each consisting of one or more segment lists. A headend may be provisioned with candidate paths for an SR Policy via several different mechanisms, e.g., CLI, NETCONF, PCEP, or BGP. This document specifies how BGP may be used to distribute SR Policy candidate paths. It defines sub-TLVs for the Tunnel Encapsulation Attribute for signaling information about these candidate paths. This documents updates RFC9012 with extensions to the Color Extended Community to support additional steering modes over SR Policy. This document defines a PHB (per-hop behavior) called Expedited Forwarding (EF). The PHB is a basic building block in the Differentiated Services architecture. EF is intended to provide a building block for low delay, low jitter and low loss services by ensuring that the EF aggregate is served at a certain configured rate. This document obsoletes RFC 2598. [STANDARDS-TRACK] This document defines a general use Differentiated Services (DS) Per-Hop-Behavior (PHB) Group called Assured Forwarding (AF). [STANDARDS-TRACK] Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This document describes the IS-IS extensions that need to be introduced for Segment Routing operating on an MPLS data plane. Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological subpaths called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This document describes the OSPFv2 extensions required for Segment Routing. Segment Routing (SR) allows for a flexible definition of end-to-end paths by encoding paths as sequences of topological subpaths, called "segments". These segments are advertised by routing protocols, e.g., by the link-state routing protocols (IS-IS, OSPFv2, and OSPFv3) within IGP topologies. This document defines extensions to the Border Gateway Protocol - Link State (BGP-LS) address family in order to carry SR information via BGP. Cisco Systems Cisco Systems Cisco Systems Orange Huawei Technologies The Segment Routing (SR) architecture allows a flexible definition of the end-to-end path by encoding it as a sequence of topological elements called "segments". It can be implemented over the MPLS or the IPv6 data plane. This document describes the IS-IS extensions required to support SR over the IPv6 data plane. This document updates RFC 7370 by modifying an existing registry. Huawei Technologies Huawei Technologies Cisco Systems Cisco Systems The Segment Routing (SR) architecture allows a flexible definition of the end-to-end path by encoding it as a sequence of topological elements called segments. It can be implemented over an MPLS or IPv6 data plane. This document describes the OSPFv3 extensions required to support Segment Routing over the IPv6 data plane (SRv6). LinkedIn Cisco Systems Cisco Systems Huawei Bell Canada Orange 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 defined in a separate document. 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] Nokia Nokia Cisco Systems, Inc. Ciena Coroporation This document updates RFC 5440 to clarify usage of the Local Protection Desired bit signaled in the Path Computation Element Communication Protocol (PCEP). This document also introduces a new flag for signaling protection enforcement in PCEP. 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. Huawei Technologies Huawei Technologies China Mobile Cisco Systems, Inc. ZTE Corporation The Path Computation Element Communication Protocol (PCEP) provides mechanisms for Path Computation Elements (PCEs) to perform path computations in response to Path Computation Clients (PCCs) requests. Segment routing (SR) leverages the source routing and tunneling paradigms. The Stateful PCEP extensions allow stateful control of Segment Routing Traffic Engineering (TE) Paths. Furthermore, PCEP can be used for computing SR TE paths in the network. This document defines PCEP extensions for grouping two unidirectional SR Paths (one in each direction in the network) into a single associated bidirectional SR Path. The mechanisms defined in this document can also be applied using a stateful PCE for both PCE- initiated and PCC-initiated LSPs or when using a stateless PCE. This document defines Path Computation Element Communication Protocol (PCEP) extensions for grouping two unidirectional MPLS-TE Label Switched Paths (LSPs), one in each direction in the network, into an associated bidirectional LSP. These PCEP extensions can be applied either using a stateful PCE for both PCE-initiated and PCC-initiated LSPs or using a stateless PCE. The PCEP procedures defined are applicable to the LSPs using RSVP-TE for signaling. Cisco Systems, Inc. Ciena Corporation Juniper Networks, Inc. Huawei Technologies Nokia A Segment Routing (SR) Policy [RFC9256] is a non-empty set of SR Candidate Paths, that share the same <headend, color, endpoint> tuple. This document extends [RFC8664] to fully support the SR Policy construct. SR Policy is modeled in PCEP as an Association of one or more SR Candidate Paths. PCEP extensions are defined to signal additional attributes of an SR Policy, which are not covered by [RFC8664]. The mechanism is applicable to all data planes of SR (MPLS, SRv6, etc.). Cisco Systems, Inc. Cisco Systems, Inc. Airtel India Ciena Nokia Verizon Huawei Technologies Juniper Networks Bell Canada This document proposes a set of extensions for Path Computation Element Communication Protocol (PCEP) for Circuit Style Policies - Segment-Routing Policy designed to satisfy requirements for connection-oriented transport services. New TLV is introduced to control path recomputation and new flag to add ability to request path with strict hops only. Cisco Systems, Inc. Ciena Corporation Juniper Networks, Inc. Juniper Networks, Inc. Nokia Ciena Huawei Technologies Verizon Inc. Certain traffic engineering path computation problems require solutions that consist of multiple traffic paths, that together form a solution. Returning just one single traffic path does not provide a valid solution. This document defines a mechanism to encode multiple paths for a single set of objectives and constraints. This is a generic PCEP mechanism, not specific to any path setup type or dataplane. The mechanism is applicable to both stateless and stateful PCEP. Huawei Technologies Cisco Systems Huawei Technologies RtBrick Inc. Microsoft This document describes a mechanism to collect the Segment Routing 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, re-optimization, service placement, network visualization, etc. This document defines a way for an Intermediate System to Intermediate System (IS-IS) router to advertise multiple types of supported Maximum SID Depths (MSDs) at node and/or link granularity. Such advertisements allow entities (e.g., centralized controllers) to determine whether a particular Segment ID (SID) stack can be supported in a given network. This document only defines one type of MSD: Base MPLS Imposition. However, it defines an encoding that can support other MSD types. This document focuses on MSD use in a network that is Segment Routing (SR) enabled, but MSD may also be useful when SR is not enabled. This document defines a way for an Open Shortest Path First (OSPF) router to advertise multiple types of supported Maximum SID Depths (MSDs) at node and/or link granularity. Such advertisements allow entities (e.g., centralized controllers) to determine whether a particular Segment Identifier (SID) stack can be supported in a given network. This document only refers to the Signaling MSD as defined in RFC 8491, but it defines an encoding that can support other MSD types. Here, the term "OSPF" means both OSPFv2 and OSPFv3. This document defines a way for a Border Gateway Protocol - Link State (BGP-LS) speaker to advertise multiple types of supported Maximum SID Depths (MSDs) at node and/or link granularity. Such advertisements allow entities (e.g., centralized controllers) to determine whether a particular Segment Identifier (SID) stack can be supported in a given network. This document describes protocol-specific procedures and extensions for Generalized Multi-Protocol Label Switching (GMPLS) Resource ReSerVation Protocol - Traffic Engineering (RSVP-TE) signaling to support end-to-end Label Switched Path (LSP) recovery that denotes protection and restoration. A generic functional description of GMPLS recovery can be found in a companion document, RFC 4426. [STANDARDS-TRACK] This document defines a common terminology for Generalized Multi-Protocol Label Switching (GMPLS)-based recovery mechanisms (i.e., protection and restoration). The terminology is independent of the underlying transport technologies covered by GMPLS. This memo provides information for the Internet community. 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. Cisco Systems, Inc. Cisco Systems, Inc. Bell Canada Huawei Nokia Segment Routing (SR) leverages the source routing paradigm. SR is applicable to both Multiprotocol Label Switching (SR-MPLS) and IPv6 (SRv6) data planes. This document describes procedures for Performance Measurement in SR networks using the mechanisms defined in RFC 8762 (Simple Two-Way Active Measurement Protocol (STAMP)) and its optional extensions defined in RFC 8972 and further augmented in draft-ietf-ippm-stamp-srpm. The procedure described is used for links, end-to-end SR paths (including SR Policies and SR Flexible Algorithm IGP paths) as well as Layer-3 and Layer-2 services in SR networks, and is applicable to both SR-MPLS and SRv6 data planes. Huawei Technologies Huawei Technologies China Telecom China Mobile Cisco Systems A Segment Routing (SR) policy is a set of candidate SR paths consisting of one or more segment lists with necessary path attributes. For each SR path, it may also have its own path attributes, and Path Segment is one of them. A Path Segment is defined to identify an SR path, which can be used for performance measurement, path correlation, and end-2-end path protection. Path Segment can be also used to correlate two unidirectional SR paths into a bidirectional SR path which is required in some scenarios, for example, mobile backhaul transport network. This document defines extensions to BGP to distribute SR policies carrying Path Segment and bidirectional path information. This memo documents the fundamental truths of networking for the Internet community. This memo does not specify a standard, except in the sense that all standards must implicitly follow the fundamental truths. This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind.

Contributors Bell Canada

daniel.voyer@bell.ca

Verizon

luay.jalil@verizon.com

Huawei Technologies

pengshuping@huawei.com

Cisco Systems, Inc.

cfilsfil@cisco.com

Cisco Systems, Inc.

fclad@cisco.com

Cisco Systems, Inc.

tsaad.net@gmail.com

Cisco Systems, Inc.

brfoster@cisco.com

Cisco Systems, Inc.

bduvivie@cisco.com

Cisco Systems, Inc.

slitkows@cisco.com

Huawei Technologies

jie.dong@huawei.com