<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc version 1.7.43 (Ruby 3.2.3) -->
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-ietf-pce-pcep-nrp-03" category="std" consensus="true" submissionType="IETF" xml:lang="en" version="3">
  <!-- xml2rfc v2v3 conversion 3.35.0 -->
  <front>
    <title abbrev="PCEP Extensions for NRP">Path Computation Element Communication Protocol (PCEP) Extensions for Network Resource Partition (NRP)</title>
    <seriesInfo name="Internet-Draft" value="draft-ietf-pce-pcep-nrp-03"/>
    <author initials="J." surname="Dong" fullname="Jie Dong">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>Huawei Campus, No. 156 Beiqing Rd.</street>
          <city>Beijing</city>
          <code>100095</code>
          <country>China</country>
        </postal>
        <email>jie.dong@huawei.com</email>
      </address>
    </author>
    <author initials="L." surname="Zhang" fullname="Li Zhang">
      <organization>Huawei Technologies</organization>
      <address>
        <postal>
          <street>Huawei Campus, No. 156 Beiqing Rd.</street>
          <city>Beijing</city>
          <code>100095</code>
          <country>China</country>
        </postal>
        <email>zhangli344@huawei.com</email>
      </address>
    </author>
    <author initials="Q." surname="Xiong" fullname="Quan Xiong">
      <organization>ZTE Corporation</organization>
      <address>
        <postal>
          <street>No. 6 Huashi Park Rd</street>
          <city>Wuhan</city>
          <region>Hubei</region>
          <code>430223</code>
          <country>China</country>
        </postal>
        <email>xiong.quan@zte.com.cn</email>
      </address>
    </author>
    <author initials="S." surname="Peng" fullname="Shaofu Peng">
      <organization>ZTE Corporation</organization>
      <address>
        <postal>
          <street>No. 50 Software Avenue</street>
          <city>Nanjing</city>
          <region>Jiangsu</region>
          <code>210012</code>
          <country>China</country>
        </postal>
        <email>peng.shaofu@zte.com.cn</email>
      </address>
    </author>
    <author initials="L." surname="Han" fullname="Liuyan Han">
      <organization>China Mobile</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>hanliuyan@chinamobile.com</email>
      </address>
    </author>
    <author initials="M." surname="Wang" fullname="Minxue Wang">
      <organization>China Mobile</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>wangminxue@chinamobile.com</email>
      </address>
    </author>
    <author initials="V." surname="Beeram" fullname="Vishnu Pavan Beeram">
      <organization>Juniper Networks</organization>
      <address>
        <email>vbeeram@juniper.net</email>
      </address>
    </author>
    <author initials="T." surname="Saad" fullname="Tarek Saad">
      <organization>Cisco Systems</organization>
      <address>
        <email>tsaad.net@gmail.com</email>
      </address>
    </author>
    <author initials="S." surname="Fang" fullname="Sheng Fang">
      <organization>Individual</organization>
      <address>
        <postal>
          <city>Beijing</city>
          <country>China</country>
        </postal>
        <email>fang_sheng@163.com</email>
      </address>
    </author>
    <date year="2026" month="November" day="16"/>
    <area>Routing</area>
    <workgroup>PCE Working Group</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <?line 109?>

<t>This document specifies the extensions to Path Computation Element
Communication Protocol (PCEP) to carry Network Resource Partition (NRP)
related information in the PCEP messages. The extensions in this
document can be used to indicate the NRP-specific constraints and
information needed in path computation, path status report and path
initialization.</t>
    </abstract>
  </front>
  <middle>
    <?line 119?>

<section anchor="introduction">
      <name>Introduction</name>
      <t><xref target="RFC5440"/> describes the Path Computation Element (PCE)
Communication Protocol (PCEP). PCEP enables the communication between a
Path Computation Client (PCC) and a PCE, or between PCE and PCE, for the
purpose of computation of Multi-protocol Label Switching (MPLS) as well
as Generalized MPLS (GMPLS) Traffic Engineering Label Switched Path (TE
LSP) characteristics. As depicted in <xref target="RFC4655"/>, a PCE
<bcp14>MUST</bcp14> be able to compute the path of a TE LSP by operating on the TED and
considering bandwidth and other constraints applicable to the TE LSP
service request.</t>
      <t><xref target="RFC8231"/> specifies a set of extensions to PCEP to
enable stateful control of TE LSPs within and across PCEP sessions in
compliance with <xref target="RFC4657"/>. It includes mechanisms to
effect LSP State Synchronization between PCCs and PCEs, delegation of
control over LSPs to PCEs, and PCE control of timing and sequence of
path computations within and across PCEP sessions. The model of
operation where LSPs are initiated from the PCE is described in <xref target="RFC8281"/>.
<xref target="RFC8664"/> specifies PCEP extensions to allow a stateful PCE to compute
and initiate TE paths, as well as a PCC to request a path subject to
certain constraints and optimization criteria in SR networks.</t>
      <t>With the introduction and evolvement of 5G and other network
scenarios, existing or emerging applications or customers may require
connectivity services with additional characteristics.
As described in <xref target="RFC9543"/>, an RFC 9543 Network Slice enables
connectivity service between a set of Service Demarcation Points
(SDPs) with specific Service Level Objectives (SLOs) and Service Level
Expectations (SLEs) over a common underlay network.
For the realization of RFC 9543 network slice service, the concept
Network Resource Partition (NRP) is introduced in <xref target="RFC9543"/>.
A Network Resource Partition (NRP) is a subset of the buffer/queuing/
scheduling resources and associated policies on each of a connected
set of links in the underlay network.</t>
      <t><xref target="RFC9732"/> describes a framework and the candidate technologies for
providing enhanced VPN services based on NRPs.
An NRP could be used as the underlay to meet the requirement of one or
a group of enhanced VPN services.</t>
      <t>In MPLS or SR based network, the set of network resources allocated to
an NRP can be identified using resource-aware SR SIDs as defined in
<xref target="I-D.ietf-spring-resource-aware-segments"/>
        <xref target="I-D.ietf-spring-sr-for-enhanced-vpn"/>, or a data plane NRP Selector ID
as defined in <xref target="I-D.ietf-teas-nrp-scalability"/>
        <xref target="I-D.ietf-6man-enhanced-vpn-vtn-id"/>.
The logical topology associated with an NRP could be specified using
mechanisms such as Multi-Topology <xref target="RFC4915"/>, <xref target="RFC5120"/> or Flex-Algo
<xref target="RFC9350"/>, etc.</t>
      <t>To meet specific service requirement, traffic flows of an RFC 9543
network slice service need be steered to TE paths of the corresponding
NRP. A PCC may request the PCE for computing a TE path within an NRP, so
that the path computation would take the resource attributes and the
associated topology of the NRP into consideration. Correspondingly, a
PCE may reply or initiate a TE path with NRP-specific control plane and
data plane information to a PCC. <xref target="I-D.ietf-spring-sr-policy-nrp"/> describes the extensions to the SR Policy Architecture for the association of SR Policy <xref target="RFC9256"/> candidate paths with NRPs.</t>
      <t>This document specifies the extensions to PCEP to carry NRP related
information in the PCEP messages. The extensions can be used in the
basic PCE computation, the stateful PCE and the PCE-initiated LSP
mechanisms to indicate the NRP-specific constraints and information
needed in path computation, path status report and path
initialization. This mechanism is applicable to PCE-initiated LSPs in general, including but not limited to the instantiation of SR Policy candidate paths.</t>
      <section anchor="requirements-language">
        <name>Requirements Language</name>
        <t>The key words "<bcp14>MUST</bcp14>", "<bcp14>MUST NOT</bcp14>", "<bcp14>REQUIRED</bcp14>", "<bcp14>SHALL</bcp14>", "<bcp14>SHALL
NOT</bcp14>", "<bcp14>SHOULD</bcp14>", "<bcp14>SHOULD NOT</bcp14>", "<bcp14>RECOMMENDED</bcp14>", "<bcp14>NOT RECOMMENDED</bcp14>",
"<bcp14>MAY</bcp14>", and "<bcp14>OPTIONAL</bcp14>" in this document are to be interpreted as
described in BCP 14 <xref target="RFC2119"/> <xref target="RFC8174"/> when, and only when, they
appear in all capitals, as shown here.</t>
        <?line -18?>

</section>
    </section>
    <section anchor="SEC_EXT">
      <name>PCEP Extensions</name>
      <section anchor="nrp-tlv-in-lspa-object">
        <name>NRP TLV in LSPA Object</name>
        <t>A new NRP TLV for use in the LSPA Object is defined to indicate the
NRP ID and the related information which needs to be considered in
path computation or instantiation. The format of the NRP TLV is as
follows:</t>
        <figure anchor="SEC_FIG1">
          <name>NRP ID TLV Format</name>
          <artwork align="center"><![CDATA[
 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=TBD1          |        Length=Variable        |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                             NRP ID                            |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|             Flags             |           Reserved            |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                                                               |
//                    Optional sub-TLV(s)                       //
|                                                               |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>Where:</t>
        <ul spacing="normal">
          <li>
            <t>NRP ID: A 32-bit identifier in the control plane which uniquely
identifies an NRP in an NRP domain <xref target="I-D.ietf-teas-ns-ip-mpls"/>.
Value 0 is reserved, which <bcp14>MUST NOT</bcp14> be used by the sender.</t>
          </li>
          <li>
            <t>Flags: 16-bit flags.
Currently all the flags are reserved for future use.
They <bcp14>SHOULD</bcp14> be set to zero on transmission and <bcp14>MUST</bcp14> be
ignored on receipt.</t>
          </li>
          <li>
            <t>Reserved: 16-bit reserved field for future use.
All the bits <bcp14>SHOULD</bcp14> be set to zero on transmission and <bcp14>MUST</bcp14> be
ignored on receipt.</t>
          </li>
          <li>
            <t>Optional sub-TLVs: Additional information which can be used in
NRP-specific constraints.
Currently no sub-TLV is defined in this document.</t>
          </li>
        </ul>
        <t>If a PCEP speaker receives an NRP TLV with NRP ID = 0 in a message, it <bcp14>SHOULD</bcp14> ignore that TLV and its sub-TLVs, and proceed to process the remainder of the message normally.</t>
      </section>
      <section anchor="capability-advertisement">
        <name>Capability Advertisement</name>
        <t>A PCEP speaker indicates whether it supports NRP-specific path
computation using a new PCEP capability called "NRP-CAPABILITY". When
the PCEP session is created, it sends an Open message with an OPEN
Object containing the NRP-CAPABILITY TLV. The format of this TLV is as
follows:</t>
        <figure anchor="SEC_FIG2">
          <name>NRP CAPABILITY TLV</name>
          <artwork align="center"><![CDATA[
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=TBD2        |            Length=4           |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|                             Flags                           |D|
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
]]></artwork>
        </figure>
        <t>The type (16 bits) of the TLV is TBA. The length field is 16 bits
long and has a fixed value of 4.</t>
        <t>The value comprises a single field -- Flags (32 bits):</t>
        <ul spacing="normal">
          <li>
            <t>D (Data Plane NRP ID CAPABILITY - 1 bit): if set to 1 by a PCC,
the D flag indicates that the PCC supports the encapsulation of
data plane NRP ID in data packet; if set to 1 by a PCE, it
indicates that the PCE supports to provide path computation result
with the data plane NRP ID used for the path.</t>
          </li>
          <li>
            <t>Unassigned bits in the Flags field <bcp14>MUST</bcp14> be set to zero on
transmission and ignored on receipt.</t>
          </li>
        </ul>
        <t>The PCEP extensions for NRP <bcp14>MUST NOT</bcp14> be used and <bcp14>MUST</bcp14> be ignored upon receipt if either PCEP speaker has not included the NRP-CAPABILITY TLV in its OPEN message.</t>
      </section>
    </section>
    <section anchor="operations">
      <name>Operations</name>
      <t>The NRP TLV defined in this document can be used for NRP-aware TE
path computation, NRP-specific path status report and NRP-specific path
instantiation, thus it is applicable to both the basic PCE mechanisms
and the stateful PCE mechanisms.</t>
      <section anchor="nrp-aware-path-computation">
        <name>NRP-aware Path Computation</name>
        <t>NRP-aware TE path computation <bcp14>MUST</bcp14> be performed taking the
topology and network resources (e.g., bandwidth) of the associated NRP as constraints. 
Information about the NRP-specific network resource and topology
attributes may be obtained by the PCE either from the network planning
system, or using a distributed control plane such as IGP or BGP-LS
with necessary extensions. The detailed mechanism is out of the scope
of this document.</t>
        <t>In a PCReq message, the NRP TLV <bcp14>SHOULD</bcp14> be carried in the LSPA
Object to indicate that the path computation needs to be executed
using the network resource and topological attributes of the NRP. The
PCE <bcp14>SHOULD</bcp14> use the network resource and topology attributes associated
with the specified NRP as the parameters in path computation. More specifically, the computed TE path <bcp14>MUST</bcp14> only use network nodes and links which participate in the NRP, and the requested bandwidth in PCReq message <bcp14>MUST</bcp14> be checked with bandwidth reserved for the NRP on those network links. 
In a
PCRep message, the NRP TLV <bcp14>MAY</bcp14> be carried in the LSPA Object in case
of failure to indicate the path computation in the specified NRP was
not successful.</t>
      </section>
      <section anchor="nrp-specific-path-update-and-report">
        <name>NRP-specific Path Update and Report</name>
        <t>The NRP TLV defined in this document can be used for NRP-specific
path update and report in the stateful PCE mechanisms.</t>
        <t>A PCE <bcp14>MAY</bcp14> include the NRP TLV in a PCUpd message to indicate the NRP
in which the TE path needs to be updated. If the NRP ID carried in the PCUpd message differs from the NRP ID of the existing TE path, it indicates an intent to update the associated NRP of that TE path. Upon receiving such a PCUpd message, the PCC <bcp14>SHOULD</bcp14> update the LSP's NRP accordingly and proceed with the path update. On successful update of a TE path, the NRP TLV <bcp14>SHOULD</bcp14> be included in the PCRpt message to indicate the NRP in which the TE path is reported.</t>
        <t>If a PCE intends to remove the NRP associated with an LSP,
it <bcp14>SHOULD</bcp14> send a new PCUpd message that carries the same LSP but omits the NRP TLV,thereby indicating that the NRP for that LSP has been deleted.</t>
      </section>
      <section anchor="nrp-specific-path-initiation">
        <name>NRP-specific Path Initiation</name>
        <t>The NRP TLV defined in this document can be used for NRP-specific
path initiation in the PCE-Initiated LSP mechanisms.</t>
        <t>In a PCInitiate message, the NRP TLV <bcp14>MAY</bcp14> be included to indicate
the NRP in which the path needs to be initiated. Depending on the
setting of the D flag in the NRP Capability, the PCC will use either
the resources-aware SIDs <xref target="I-D.ietf-spring-resource-aware-segments"/> associated with the NRP or the data plane NRP
Selector ID <xref target="I-D.ietf-6man-enhanced-vpn-vtn-id"/> in constructing the NRP-specific TE path. If the PCC determines
that the LSP parameters proposed in the PCInitiate message are
unacceptable, it <bcp14>MUST</bcp14> send a PCErr message with Error-type=24 (PCE
instantiation error) and Error-value=1 (Unacceptable instantiation
parameters). On successful completion of the LSP instantiation, the
NRP TLV <bcp14>SHOULD</bcp14> be included in the PCRpt message to indicate the NRP in
which the TE path was instantiated.</t>
      </section>
    </section>
    <section anchor="scalability-considerations">
      <name>Scalability Considerations</name>
      <t>The mechanism described in this document adds NRP-specific
information to PCEP. NRP-specific constraints may be considered in path
computation of PCE, and in path instantiation, path update and report, a
TE path may be associated with an NRP ID. As the number of NRP
increases, the number of PCEP messages exchanged between PCC and PCE
would also increase. However, since the PCEP messages are exchanged only
between the PCCs and PCE, the impacts to the control plane of PCC and
PCE are considered acceptable.</t>
    </section>
    <section anchor="security-considerations">
      <name>Security Considerations</name>
      <t>This document defines a new NRP TLV that do not add any new security
concerns beyond those discussed in <xref target="RFC5440"/> in itself.
Some deployments may find the NRP information to be extra sensitive and
could be used to influence path computation and setup with adverse
effect. Additionally, snooping of PCEP messages with such data or using
PCEP messages for network reconnaissance may give an attacker sensitive
information about the operations of the network. Thus, such deployment
should employ suitable PCEP security mechanisms like TCP Authentication
Option (TCP-AO) <xref target="RFC5925"/> or Transport Layer Security
(TLS) <xref target="RFC8253"/>. The procedure based on TLS is considered
a security enhancement and thus is much better suited for the sensitive
information.</t>
    </section>
    <section anchor="iana-considerations">
      <name>IANA Considerations</name>
      <t>This document makes following requests to IANA for action.</t>
      <t>IANA is requested to make the following allocations in the "PCEP TLV
Type Indicators" subregistry of the "Path Computation Element Protocol
(PCEP) Numbers" registry:</t>
      <table>
        <thead>
          <tr>
            <th align="left">Value</th>
            <th align="left">Description</th>
            <th align="left">Reference</th>
          </tr>
        </thead>
        <tbody>
          <tr>
            <td align="left">TBD1</td>
            <td align="left">NRP</td>
            <td align="left">This document</td>
          </tr>
          <tr>
            <td align="left">TBD2</td>
            <td align="left">NRP CAPABILITY</td>
            <td align="left">This document</td>
          </tr>
        </tbody>
      </table>
    </section>
    <section anchor="acknowledgments">
      <name>Acknowledgments</name>
      <t>The authors would like to thank Zhenbin Li for his review and
valuable comments.</t>
    </section>
  </middle>
  <back>
    <references anchor="sec-combined-references">
      <name>References</name>
      <references anchor="sec-normative-references">
        <name>Normative References</name>
        <reference anchor="RFC5440" target="https://www.rfc-editor.org/info/rfc5440" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5440.xml">
          <front>
            <title>Path Computation Element (PCE) Communication Protocol (PCEP)</title>
            <author fullname="JP. Vasseur" initials="JP." role="editor" surname="Vasseur"/>
            <author fullname="JL. Le Roux" initials="JL." role="editor" surname="Le Roux"/>
            <date month="March" year="2009"/>
            <abstract>
              <t>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]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5440"/>
          <seriesInfo name="DOI" value="10.17487/RFC5440"/>
        </reference>
        <reference anchor="RFC8231" target="https://www.rfc-editor.org/info/rfc8231" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8231.xml">
          <front>
            <title>Path Computation Element Communication Protocol (PCEP) Extensions for Stateful PCE</title>
            <author fullname="E. Crabbe" initials="E." surname="Crabbe"/>
            <author fullname="I. Minei" initials="I." surname="Minei"/>
            <author fullname="J. Medved" initials="J." surname="Medved"/>
            <author fullname="R. Varga" initials="R." surname="Varga"/>
            <date month="September" year="2017"/>
            <abstract>
              <t>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.</t>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8231"/>
          <seriesInfo name="DOI" value="10.17487/RFC8231"/>
        </reference>
        <reference anchor="RFC8281" target="https://www.rfc-editor.org/info/rfc8281" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8281.xml">
          <front>
            <title>Path Computation Element Communication Protocol (PCEP) Extensions for PCE-Initiated LSP Setup in a Stateful PCE Model</title>
            <author fullname="E. Crabbe" initials="E." surname="Crabbe"/>
            <author fullname="I. Minei" initials="I." surname="Minei"/>
            <author fullname="S. Sivabalan" initials="S." surname="Sivabalan"/>
            <author fullname="R. Varga" initials="R." surname="Varga"/>
            <date month="December" year="2017"/>
            <abstract>
              <t>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.</t>
              <t>The extensions for stateful PCE provide active control of Multiprotocol Label Switching (MPLS) Traffic Engineering Label Switched Paths (TE LSPs) via PCEP, for a model where the PCC delegates control over one or more locally configured LSPs to the PCE. This document describes the creation and deletion of PCE-initiated LSPs under the stateful PCE model.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8281"/>
          <seriesInfo name="DOI" value="10.17487/RFC8281"/>
        </reference>
        <reference anchor="RFC8664" target="https://www.rfc-editor.org/info/rfc8664" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8664.xml">
          <front>
            <title>Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing</title>
            <author fullname="S. Sivabalan" initials="S." surname="Sivabalan"/>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <author fullname="J. Tantsura" initials="J." surname="Tantsura"/>
            <author fullname="W. Henderickx" initials="W." surname="Henderickx"/>
            <author fullname="J. Hardwick" initials="J." surname="Hardwick"/>
            <date month="December" year="2019"/>
            <abstract>
              <t>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.</t>
              <t>This document updates RFC 8408.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8664"/>
          <seriesInfo name="DOI" value="10.17487/RFC8664"/>
        </reference>
        <reference anchor="RFC9350" target="https://www.rfc-editor.org/info/rfc9350" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9350.xml">
          <front>
            <title>IGP Flexible Algorithm</title>
            <author fullname="P. Psenak" initials="P." role="editor" surname="Psenak"/>
            <author fullname="S. Hegde" initials="S." surname="Hegde"/>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <author fullname="K. Talaulikar" initials="K." surname="Talaulikar"/>
            <author fullname="A. Gulko" initials="A." surname="Gulko"/>
            <date month="February" year="2023"/>
            <abstract>
              <t>IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9350"/>
          <seriesInfo name="DOI" value="10.17487/RFC9350"/>
        </reference>
        <reference anchor="RFC9543" target="https://www.rfc-editor.org/info/rfc9543" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9543.xml">
          <front>
            <title>A Framework for Network Slices in Networks Built from IETF Technologies</title>
            <author fullname="A. Farrel" initials="A." role="editor" surname="Farrel"/>
            <author fullname="J. Drake" initials="J." role="editor" surname="Drake"/>
            <author fullname="R. Rokui" initials="R." surname="Rokui"/>
            <author fullname="S. Homma" initials="S." surname="Homma"/>
            <author fullname="K. Makhijani" initials="K." surname="Makhijani"/>
            <author fullname="L. Contreras" initials="L." surname="Contreras"/>
            <author fullname="J. Tantsura" initials="J." surname="Tantsura"/>
            <date month="March" year="2024"/>
            <abstract>
              <t>This document describes network slicing in the context of networks built from IETF technologies. It defines the term "IETF Network Slice" to describe this type of network slice and establishes the general principles of network slicing in the IETF context.</t>
              <t>The document discusses the general framework for requesting and operating IETF Network Slices, the characteristics of an IETF Network Slice, the necessary system components and interfaces, and the mapping of abstract requests to more specific technologies. The document also discusses related considerations with monitoring and security.</t>
              <t>This document also provides definitions of related terms to enable consistent usage in other IETF documents that describe or use aspects of IETF Network Slices.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9543"/>
          <seriesInfo name="DOI" value="10.17487/RFC9543"/>
        </reference>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S." surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B." surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references anchor="sec-informative-references">
        <name>Informative References</name>
        <reference anchor="RFC4655" target="https://www.rfc-editor.org/info/rfc4655" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4655.xml">
          <front>
            <title>A Path Computation Element (PCE)-Based Architecture</title>
            <author fullname="A. Farrel" initials="A." surname="Farrel"/>
            <author fullname="J.-P. Vasseur" initials="J.-P." surname="Vasseur"/>
            <author fullname="J. Ash" initials="J." surname="Ash"/>
            <date month="August" year="2006"/>
            <abstract>
              <t>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.</t>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4655"/>
          <seriesInfo name="DOI" value="10.17487/RFC4655"/>
        </reference>
        <reference anchor="RFC4657" target="https://www.rfc-editor.org/info/rfc4657" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4657.xml">
          <front>
            <title>Path Computation Element (PCE) Communication Protocol Generic Requirements</title>
            <author fullname="J. Ash" initials="J." role="editor" surname="Ash"/>
            <author fullname="J.L. Le Roux" initials="J.L." role="editor" surname="Le Roux"/>
            <date month="September" year="2006"/>
            <abstract>
              <t>The PCE model is described in the "PCE Architecture" document and facilitates path computation requests from Path Computation Clients (PCCs) to Path Computation Elements (PCEs). This document specifies generic requirements for a communication protocol between PCCs and PCEs, and also between PCEs where cooperation between PCEs is desirable. Subsequent documents will specify application-specific requirements for the PCE communication protocol. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4657"/>
          <seriesInfo name="DOI" value="10.17487/RFC4657"/>
        </reference>
        <reference anchor="RFC4915" target="https://www.rfc-editor.org/info/rfc4915" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4915.xml">
          <front>
            <title>Multi-Topology (MT) Routing in OSPF</title>
            <author fullname="P. Psenak" initials="P." surname="Psenak"/>
            <author fullname="S. Mirtorabi" initials="S." surname="Mirtorabi"/>
            <author fullname="A. Roy" initials="A." surname="Roy"/>
            <author fullname="L. Nguyen" initials="L." surname="Nguyen"/>
            <author fullname="P. Pillay-Esnault" initials="P." surname="Pillay-Esnault"/>
            <date month="June" year="2007"/>
            <abstract>
              <t>This document describes an extension to Open Shortest Path First (OSPF) in order to define independent IP topologies called Multi- Topologies (MTs). The Multi-Topologies extension can be used for computing different paths for unicast traffic, multicast traffic, different classes of service based on flexible criteria, or an in- band network management topology.</t>
              <t>An optional extension to exclude selected links from the default topology is also described. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4915"/>
          <seriesInfo name="DOI" value="10.17487/RFC4915"/>
        </reference>
        <reference anchor="RFC5120" target="https://www.rfc-editor.org/info/rfc5120" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5120.xml">
          <front>
            <title>M-ISIS: Multi Topology (MT) Routing in Intermediate System to Intermediate Systems (IS-ISs)</title>
            <author fullname="T. Przygienda" initials="T." surname="Przygienda"/>
            <author fullname="N. Shen" initials="N." surname="Shen"/>
            <author fullname="N. Sheth" initials="N." surname="Sheth"/>
            <date month="February" year="2008"/>
            <abstract>
              <t>This document describes an optional mechanism within Intermediate System to Intermediate Systems (IS-ISs) used today by many ISPs for IGP routing within their clouds. This document describes how to run, within a single IS-IS domain, a set of independent IP topologies that we call Multi-Topologies (MTs). This MT extension can be used for a variety of purposes, such as an in-band management network "on top" of the original IGP topology, maintaining separate IGP routing domains for isolated multicast or IPv6 islands within the backbone, or forcing a subset of an address space to follow a different topology. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5120"/>
          <seriesInfo name="DOI" value="10.17487/RFC5120"/>
        </reference>
        <reference anchor="RFC5925" target="https://www.rfc-editor.org/info/rfc5925" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.5925.xml">
          <front>
            <title>The TCP Authentication Option</title>
            <author fullname="J. Touch" initials="J." surname="Touch"/>
            <author fullname="A. Mankin" initials="A." surname="Mankin"/>
            <author fullname="R. Bonica" initials="R." surname="Bonica"/>
            <date month="June" year="2010"/>
            <abstract>
              <t>This document specifies the TCP Authentication Option (TCP-AO), which obsoletes the TCP MD5 Signature option of RFC 2385 (TCP MD5). TCP-AO specifies the use of stronger Message Authentication Codes (MACs), protects against replays even for long-lived TCP connections, and provides more details on the association of security with TCP connections than TCP MD5. TCP-AO is compatible with either a static Master Key Tuple (MKT) configuration or an external, out-of-band MKT management mechanism; in either case, TCP-AO also protects connections when using the same MKT across repeated instances of a connection, using traffic keys derived from the MKT, and coordinates MKT changes between endpoints. The result is intended to support current infrastructure uses of TCP MD5, such as to protect long-lived connections (as used, e.g., in BGP and LDP), and to support a larger set of MACs with minimal other system and operational changes. TCP-AO uses a different option identifier than TCP MD5, even though TCP-AO and TCP MD5 are never permitted to be used simultaneously. TCP-AO supports IPv6, and is fully compatible with the proposed requirements for the replacement of TCP MD5. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5925"/>
          <seriesInfo name="DOI" value="10.17487/RFC5925"/>
        </reference>
        <reference anchor="RFC8253" target="https://www.rfc-editor.org/info/rfc8253" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8253.xml">
          <front>
            <title>PCEPS: Usage of TLS to Provide a Secure Transport for the Path Computation Element Communication Protocol (PCEP)</title>
            <author fullname="D. Lopez" initials="D." surname="Lopez"/>
            <author fullname="O. Gonzalez de Dios" initials="O." surname="Gonzalez de Dios"/>
            <author fullname="Q. Wu" initials="Q." surname="Wu"/>
            <author fullname="D. Dhody" initials="D." surname="Dhody"/>
            <date month="October" year="2017"/>
            <abstract>
              <t>The Path Computation Element Communication Protocol (PCEP) defines the mechanisms for the communication between a Path Computation Client (PCC) and a Path Computation Element (PCE), or among PCEs. This document describes PCEPS -- the usage of Transport Layer Security (TLS) to provide a secure transport for PCEP. The additional security mechanisms are provided by the transport protocol supporting PCEP; therefore, they do not affect the flexibility and extensibility of PCEP.</t>
              <t>This document updates RFC 5440 in regards to the PCEP initialization phase procedures.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8253"/>
          <seriesInfo name="DOI" value="10.17487/RFC8253"/>
        </reference>
        <reference anchor="RFC9256" target="https://www.rfc-editor.org/info/rfc9256" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9256.xml">
          <front>
            <title>Segment Routing Policy Architecture</title>
            <author fullname="C. Filsfils" initials="C." surname="Filsfils"/>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <author fullname="D. Voyer" initials="D." surname="Voyer"/>
            <author fullname="A. Bogdanov" initials="A." surname="Bogdanov"/>
            <author fullname="P. Mattes" initials="P." surname="Mattes"/>
            <date month="July" year="2022"/>
            <abstract>
              <t>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.</t>
              <t>This document updates RFC 8402 as it details the concepts of SR Policy and steering into an SR Policy.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9256"/>
          <seriesInfo name="DOI" value="10.17487/RFC9256"/>
        </reference>
        <reference anchor="RFC9732" target="https://www.rfc-editor.org/info/rfc9732" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.9732.xml">
          <front>
            <title>A Framework for NRP-Based Enhanced Virtual Private Networks</title>
            <author fullname="J. Dong" initials="J." surname="Dong"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <author fullname="Z. Li" initials="Z." surname="Li"/>
            <author fullname="T. Miyasaka" initials="T." surname="Miyasaka"/>
            <author fullname="Y. Lee" initials="Y." surname="Lee"/>
            <date month="March" year="2025"/>
            <abstract>
              <t>This document describes a framework for Enhanced Virtual Private Networks (VPNs) based on Network Resource Partitions (NRPs) in order to support the needs of applications with specific traffic performance requirements (e.g., low latency, bounded jitter). NRP-based enhanced VPNs leverage the VPN and Traffic Engineering (TE) technologies and add characteristics that specific services require beyond those provided by conventional VPNs. Typically, an NRP-based enhanced VPN will be used to underpin network slicing, but it could also be of use in its own right providing enhanced connectivity services between customer sites. This document also provides an overview of relevant technologies in different network layers and identifies some areas for potential new work.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9732"/>
          <seriesInfo name="DOI" value="10.17487/RFC9732"/>
        </reference>
        <reference anchor="I-D.ietf-spring-resource-aware-segments" target="https://datatracker.ietf.org/doc/html/draft-ietf-spring-resource-aware-segments-21" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-spring-resource-aware-segments.xml">
          <front>
            <title>Introducing Resource Awareness to SR Segments</title>
            <author fullname="Jie Dong" initials="J." surname="Dong">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Takuya Miyasaka" initials="T." surname="Miyasaka">
              <organization>KDDI Corporation</organization>
            </author>
            <author fullname="Yongqing Zhu" initials="Y." surname="Zhu">
              <organization>China Telecom</organization>
            </author>
            <author fullname="Fengwei Qin" initials="F." surname="Qin">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Zhenqiang Li" initials="Z." surname="Li">
              <organization>China Mobile</organization>
            </author>
            <date day="13" month="October" year="2026"/>
            <abstract>
              <t>This document describes a mechanism to allocate network resources to one or a set of Segment Routing Identifiers (SIDs). Such SIDs are referred to as resource-aware SIDs. The resource-aware SIDs retain their original forwarding semantics, with the additional semantics to identify the set of network resources available for the packet processing and forwarding action. This mechanism is applicable to both segment routing with MPLS data plane (SR-MPLS) and segment routing with IPv6 data plane (SRv6).</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-spring-resource-aware-segments-21"/>
        </reference>
        <reference anchor="I-D.ietf-spring-sr-for-enhanced-vpn" target="https://datatracker.ietf.org/doc/html/draft-ietf-spring-sr-for-enhanced-vpn-12" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-spring-sr-for-enhanced-vpn.xml">
          <front>
            <title>Segment Routing based Network Resource Partition (NRP) for Enhanced VPN</title>
            <author fullname="Jie Dong" initials="J." surname="Dong">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Takuya Miyasaka" initials="T." surname="Miyasaka">
              <organization>KDDI Corporation</organization>
            </author>
            <author fullname="Yongqing Zhu" initials="Y." surname="Zhu">
              <organization>China Telecom</organization>
            </author>
            <author fullname="Fengwei Qin" initials="F." surname="Qin">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Zhenqiang Li" initials="Z." surname="Li">
              <organization>China Mobile</organization>
            </author>
            <date day="15" month="October" year="2026"/>
            <abstract>
              <t>Enhanced VPNs aim to deliver VPN services with enhanced characteristics, such as guaranteed resources, latency, jitter, etc., so as to support customers requirements on connectivity services with these enhanced characteristics. Enhanced VPN requires integration between the overlay VPN connectivity and the characteristics provided by the underlay network. A Network Resource Partition (NRP) is a subset of the network resources and associated policies on each of a connected set of links in the underlay network. An NRP could be used as the underlay to support one or a group of enhanced VPN services. Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through an ordered list of instructions, called "segments". A segment is referred to by its Segment Identifier (SID). SIDs can represent topological or service based instructions. SIDs can further be associated with a set of network resources used for executing the instruction. Such SIDs are called resource-aware SIDs. A group of resource-aware SIDs may be used to build SR based NRPs, which provide the network topology and resource attributes required by one or a group of enhanced VPN services. This document describes an approach to build SR based NRPs using resource-aware SIDs. The SR based NRP can be used to deliver enhanced VPN services in SR networks.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-spring-sr-for-enhanced-vpn-12"/>
        </reference>
        <reference anchor="I-D.ietf-spring-sr-policy-nrp" target="https://datatracker.ietf.org/doc/html/draft-ietf-spring-sr-policy-nrp-02" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-spring-sr-policy-nrp.xml">
          <front>
            <title>Segment Routing Policy Extension for Network Resource Partition</title>
            <author fullname="Shengnan Yue" initials="" surname="Yue">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Ran Chen" initials="R." surname="Chen">
              <organization>ZTE Corporation</organization>
            </author>
            <author fullname="Jie Dong" initials="J." surname="Dong">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Changwang Lin" initials="C." surname="Lin">
              <organization>New H3C Technologies</organization>
            </author>
            <author fullname="Jiang Wenying" initials="J." surname="Wenying">
              <organization>China Mobile</organization>
            </author>
            <date day="6" month="July" year="2026"/>
            <abstract>
              <t>Segment Routing (SR) Policy is a set of candidate paths, each consisting of one or more segment lists and the associated information. A Network Resource Partition (NRP), is a subset of the resources and associated policies in the underlay network. In SR networks with multiple NRPs, an SR Policy can be associated with a particular NRP. In that case, SR Policy can be used for steering and forwarding traffic which is mapped to the NRP, so that the packets can be processed with the subset of network resources and policy of the NRP for guaranteed performance. Thus the association between SR Policy and NRP needs to be specified. This document defines extensions to the SR Policy Architecture to allow the association of the SR Policy candidate paths with NRPs.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-spring-sr-policy-nrp-02"/>
        </reference>
        <reference anchor="I-D.ietf-6man-enhanced-vpn-vtn-id" target="https://datatracker.ietf.org/doc/html/draft-ietf-6man-enhanced-vpn-vtn-id-16" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-6man-enhanced-vpn-vtn-id.xml">
          <front>
            <title>Carrying Network Resource (NR) related Information in IPv6 Extension Headers</title>
            <author fullname="Jie Dong" initials="J." surname="Dong">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Zhenbin Li" initials="Z." surname="Li">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Chongfeng Xie" initials="C." surname="Xie">
              <organization>China Telecom</organization>
            </author>
            <author fullname="Chenhao Ma" initials="C." surname="Ma">
              <organization>China Telecom</organization>
            </author>
            <author fullname="Gyan Mishra" initials="G. S." surname="Mishra">
              <organization>Verizon Inc.</organization>
            </author>
            <date day="10" month="June" year="2026"/>
            <abstract>
              <t>Virtual Private Networks (VPNs) provide different customers with logically separated connectivity over a common network infrastructure. With the introduction of 5G and also in some existing network scenarios, some customers may require network connectivity services with features that are more advanced compared to conventional VPN services. Such kind of network service is called enhanced VPNs. Enhanced VPNs can be used, for example, to deliver network slice services. A Network Resource Partition (NRP) is a subset of the network resources and associated policies on each of a connected set of links in the underlay network. An NRP may be used as the underlay to support one or a group of enhanced VPN services. For packet forwarding within a specific NRP, some fields in the data packet (these fields are called the NRP Selector) are used to identify the NRP to which the packet belongs. By identifying a packet with an NRP, NRP-specific processing can be performed on each node along the forwarding path in the NRP. This document specifies a new IPv6 Hop-by-Hop option to carry Network Resource related information in data packets. The new option is called the Network Resource (NR) Option. It can be used to carry an identifier of the NRP Selector, but it is designed to also be able to carry general information about network resource semantics and functions.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-6man-enhanced-vpn-vtn-id-16"/>
        </reference>
        <reference anchor="I-D.ietf-teas-nrp-scalability" target="https://datatracker.ietf.org/doc/html/draft-ietf-teas-nrp-scalability-10" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-teas-nrp-scalability.xml">
          <front>
            <title>Scalability Considerations for Network Resource Partition</title>
            <author fullname="Jie Dong" initials="J." surname="Dong">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Zhenbin Li" initials="Z." surname="Li">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Liyan Gong" initials="L." surname="Gong">
              <organization>China Mobile</organization>
            </author>
            <author fullname="Gyan Mishra" initials="G. S." surname="Mishra">
              <organization>Verizon Inc.</organization>
            </author>
            <date day="23" month="August" year="2026"/>
            <abstract>
              <t>A network slice offers connectivity services to a network slice customer with specific Service Level Objectives (SLOs) and Service Level Expectations (SLEs) over a common underlay network. RFC 9543 describes a framework for network slices in networks built using IETF technologies. As part of that framework, the Network Resource Partition (NRP) is introduced as a subset of buffer/queuing/ scheduling resources that are allocated from the underlay network to carry a specific set of network slice service traffic and meet the requested SLOs and SLEs. As the demand for network slices increases, scalability becomes an important factor. Although the scalability of network slices can be improved by mapping a group of network slices to a single NRP, that design may not be suitable or possible for all deployments, thus there are concerns about the scalability of NRPs themselves. This document discusses some considerations for NRP scalability in the control and data planes. It also investigates a set of optimization mechanisms.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-teas-nrp-scalability-10"/>
        </reference>
        <reference anchor="I-D.ietf-teas-ns-ip-mpls" target="https://datatracker.ietf.org/doc/html/draft-ietf-teas-ns-ip-mpls-10" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-teas-ns-ip-mpls.xml">
          <front>
            <title>Realizing Network Slices in IP/MPLS Networks</title>
            <author fullname="Tarek Saad" initials="T." surname="Saad">
              <organization>Cisco Systems Inc.</organization>
            </author>
            <author fullname="Vishnu Pavan Beeram" initials="V. P." surname="Beeram">
              <organization>HPE</organization>
            </author>
            <author fullname="Jie Dong" initials="J." surname="Dong">
              <organization>Huawei Technologies</organization>
            </author>
            <author fullname="Joel M. Halpern" initials="J. M." surname="Halpern">
              <organization>HPE</organization>
            </author>
            <author fullname="Shaofu Peng" initials="S." surname="Peng">
              <organization>ZTE Corporation</organization>
            </author>
            <date day="28" month="September" year="2026"/>
            <abstract>
              <t>Realizing network slices may require the Service Provider to have the ability to partition a physical network into multiple logical networks of varying sizes, structures, and functions so that each slice can be dedicated to specific services or customers. Multiple network slices can be realized on the same network while ensuring slice elasticity in terms of network resource allocation. This document describes a scalable solution to realize network slicing in IP/MPLS networks by supporting multiple services on top of a single physical network by requiring compliant domains and nodes to provide forwarding treatment (scheduling, drop policy, resource usage) based on slice identifiers.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-teas-ns-ip-mpls-10"/>
        </reference>
      </references>
    </references>
    <?line 401?>


    <section anchor="contributors" numbered="false" toc="include" removeInRFC="false">
      <name>Contributors</name>
      <contact initials="D." surname="Dhody" fullname="Dhruv Dhody">
        <organization/>
        <address>
          <email>dhruv.ietf@gmail.com</email>
        </address>
      </contact>
      <contact initials="Z." surname="Hu" fullname="Zhibo Hu">
        <organization/>
        <address>
          <email>huzhibo@huawei.com</email>
        </address>
      </contact>
    </section>
  </back>
  <!-- ##markdown-source:
H4sIAAAAAAAAA81b63LbRpb+zyq+Q6/yI3JWpK2rbe14xrQk20rJkkaknUm2
tqZAoEl2BAIIGqDMON5n2WfZJ9vvnNONC0nZzsapGqZigUCj+9zPd043e71e
t1OYItbH6jooZuoknWdlERQmTdRZrOc6KejevExMKHev87RIwzRW29cnZ9cP
1Nn7QicWT6yapLm61MVdmt+qG23TMg81ps2xAL25fXlz/aDbCcbjXC+wHl5f
e/vmutuJ0jAJ5qAoyoNJ0TO6mPSyUNP/WS/Js96j/W4nHds01oW2x91OmUWB
XNFf/AGpx8oWUbdjy/HcWFqgWGaY8vxs9LLb6XZMlh+rIi9tsffo0dNHe91O
HCTTY6UTEJjr4FjdpGVhkmm3czdlWtUPYAs31Ks8LbNu51YvwWiEKZNC54ku
eqdELk2OKcpiluagpKeEle+NVqcpTadUmmPG12Vwp40a6XCWpHE6NdrSM1vk
WhfV45MA6rA76jLtq93DI/VCm1+IhpuoT6NDUyyP6ebPRqYO0wiLfbv7CEwd
fit3yqTIMepkZpKA7uh5YOJj9bPR/QgUPZ/xUv0wnRPlnuALo36aBf9KBP9K
5MRm/+DgHpL/XgaJ+odpSvmn0RnMN8/SnI23STBReERk25khI4XJRjWJP5RY
jb7meooXib+xNg2KD/Yf7e3tf5ri90RL/xeQ9fzXQhO5/TBpUjycBemkVNf6
y0k+fKSG6aS4g5GqwUInpa6JvgwSL1dP9vcGQrNlg/A9yHp379OEZyCob5m4
eyi/MOUS0n4tQmLCeRL1Jh2bWN+j63uWg6hjnu95SE/mPMWqdt+Y5H2p1Q9N
m/z/L3mHaeY84+Y1TWKP1bs+5tJ5MKcXhYp3xs4SaCxYgPv6IVPzPYJkpqsQ
aBvLLcY89PnPMqSPcNHkbQRt3qphEEQ1a8aGqRoubaHnzZkKi1H0/vMp3ViV
0nAG1amXTSGdJ5FZmKgM4t8nogkm+ael+Z7vHu37hUJE0tyMy6IV3k5nebnA
v2m0bMwQ0d0+xe8msf6dn2ZmnMKvmoZQ/ko3V/w7SfM5fGFBkV2pm5cnhwcH
j/z1k7393fr6SX19dHTgr5/uH1bjnx4e7OPaJJPVWQ+ODg8b14+r66e71f3D
3b1qpsOne4f1yof71Qp7h0fV9eP9Pb4+752yIHo2yyH4Xu7SYy8gT+5ZPaVU
azeOtXkPxPZ0Aj8JddRbZMl947I0NuGSkmR7xNE8SFoT9BZF0jNRe1ShA8sJ
1oZBHMAhyFY2jLA9k/XmWUzkQp+9ngrGiFFB6LLfaGasQhYvGT7YTIdmgnSh
iplWuk74RXov5uh2Pg068GoY5PnyC+BGrmOAgkhVGscjkzAtjEDm2tpgqm1f
jdrk8SBjGY8IJyF8fqxVaTEdKDBwLNCneS4s1nOchvCphORhoFEVJFHD3LB4
onXE9KiMuA9r7nfkjsW30iKEIwcU9D7fpknAWBCbX3lw38t+bqKIwl+38w1h
kTyNylAyR7fz4YNzl48fVaRtCM91ergX7ZGEH3xG/n0RnU6CcezmC1vjx1CL
1olCPFlb6CQ2bp2TB8xdQLPtIFhVrxHcoid8n3AhVuh2shJZ0WqVTppCo69v
yrgwvcwTeRGMdayGd6ag2D5V22+uL4ZYy6o7HSMK4uKVThCQIUtogp6q7Vcy
aAQQRyo8S6YGmiLHas2H8czR9uis27kYwhbDWUCmj6G2MCHsaADj15kJxeoU
64CCy8ePO8Jrt/Pm7XBEpkTyY2NmfsSS2AbAVKCABLCCGi9ViqQREBxVqZju
6OxULItMzURC5xh37kyE10l4KcblbVPMMoQHv6ZMQysAJut8YeA9uf6l1Lbo
V7ZD4RW2U/twoKwuiLwVRyZ7KNJuR2yCbVhPylhxvoBO8IYsBiUY+FUiqg/z
1Fp522rrHY/YQnwxFK54eCXExx8/9tV5gTFhXMKi4b6Qf2Ls3Mryk4kOCxbb
kEhABk3CWZ4mzmsaJnZivY0Br0Y61lNvTy7LEdULiJCJFh4x0r3TZKwwcxI/
PbEkQKKaZln178+yLjFoDqAW8wRO7SDqDrrUQgkhPwkFZGCTPJ37YKYo7Dov
r02PsiKk5hWKvNhSqHhyS5lBHKd3pGmvRJq7tlI4UBJVJJBaiVESjTgY/SU7
P6F3nEXhhsS2cvwzKYh0Feq8gGGuRksYOwnU6QvMkGsFxM7wBsFTsBVb6A9k
GcS7aYQ9nkIv0ngh8Qz6OXzVcAg3A2w+hK3mJgXh+j35LnlXDiii8ymrU7xF
FIcHIYrFFA9hc8GS+TK5ZlNJwBEgVrFUzo9E0SqIIk5FQbwWJLqdwSZdETrh
MJEQelD0tUpxw5g81MXczevWcdd76dA9OAXCyn0wT0nU3c728PTaPhBSq9Tl
X7jQCxjhFWsLIMmq7eHFlZWA3RrT7Zy9x8vewjHsDMPYcQLOClixTBChYkjN
CR/sv5SoDjlWGY3orbh2I5Vlrh1/Oy7VwMEyYITPJX/yB28aa0ImFXwWPtAM
ARmtEyctPy4RY/KHMOsSZvKQDAlZoYzJZjysE0MOrE1DcVMGZuRumFkHoQvw
ToeaGhWyAGa5tR6fbBCb82LCla2UHiAQAFUzM7Q0ywkXJmKA0ijaKZ8iNOUp
agIi2aNC9e76srbfcUAgB8RCCmytfEXFQhxVGCiwbTLh7nMUqk6v7B/eBdME
IRHrBmpK7RNOIJsWZhbPE8nJMBG4vJDiRCAW4ITlbaQhdUSukAVOASZwRAts
Q5ZMCop5EahvKkswOC01PD+1xFWkJ0j+EWeiDx++ELt//Lhp8AbwTg6ekndA
NwiLcZAwfIRbxTAGPDk/ZYxSU6Ea824C6StL34f22egpw5Al4G0IKSOrWDYt
VSLXirp9unCi63YaadeWMGeQKyBs5KeUjI3aidgVHIriCUYLBl/G+n1vEE9T
b84o0GiYLkI2gJEzpCoqNfGJsypYgoNqE2Qryw5VR01UjZsCCINvZqgAthMY
7/OX9+8wzaHhLE0i5hRyAKTjdObjPuUzn3IJnUpe5JzhZ6szPQlyR1mwWsyC
okZ4TQh7x3IuglvtfMdFo6CQWtvFE0bBDVVV6nOUk8oQ71LlQaEUCtROqjmK
lzsMy0G78JPFS9JJlc/bPKwVNgx6xGgZgDaMuFnlEIwgofXVRp+oC9W1yqSN
RegOPPOax6tBDkSPaFaUcFhXGFTG61JIPVpsC+U41qiDoSjb8wbMpX5nzSpQ
1xegkLkrMdtl3hfVmM2KUl7odhDvIGmBmI3SkONeE5D5MI/rXo0HGc63QPGX
16lNBZIDfZ06VbFoK5I4pbYKkTUGOAFOpULbcVCf65uyUElaIEnOjdi/Q3+g
JCk2WcCK1vus6m++Qb6v4ohFeZdMS6hHzECrW71U1Nq3aovqtK0d+asur/j6
5uzvb89vzk7pevh6cHFRXXTciOHrq7cXp/VV/ebJ1Zs3Z5en8jLuqtatztab
wY9bUmJsXV2Pzq8uBxdbvhFRWydlK/A+ZuCr8yzXBWfjTgtQvji5/t//2T2A
F/wb3GBvd/cp3EC+PNl9TEUAiopEVksTBAH5CokuO1CQDigmUEaFFDNTBLEg
fDtL7xJF5Ui/0/nuP0ky/3Ws/jIOs92Dv7obxHDrppdZ6ybLbP3O2ssixA23
NixTSbN1f0XSbXoHP7a+e7k3bv7lb4BlWvV2n/ztrx1ptKxuXn34Znh28s+z
f4w+OgujuDC6eEcihEUPHJKmhwMkobvqOQUxuL8PF42xUs0JBFjxYs5KgAlV
DNjU5LqbGSRm8mLrrMWnBYds1tIQZ4GGL0m4khmbOYb5IqDU7UxSqhWlEfjf
+HQ76pFa/+xuuLe34d4+v7+LZ/vqQB2qI/VYPVFPf8+9buffe3/wv27ntyZR
o2Wmn41enDaYqJ5f6GRazJ69QyHJ4cw///pUrH2cCXzi82dQ8TIOpra9SuMa
dRSAFuzrT6bi939AxcOHmx5cZa5ER5XXg2Vvo3rd/Hn48KuQ8RWEIZ724Vhx
1Hl5/mpX8Sb+s2+dUZCHvmS//RbZgoFwDxl5mjzbCjXljC2OUz9QGGff/c6Z
0zGg7v5eb2yKul7KfXBqoz+JL2ViAIhj3vap3rC+gKgQMJLXPNhUyFR7CVyc
KPUuiEsNPzYELMSYdtxSPrNUiGm8dNUgFaD8NjHCFnqsdo+Yiwl942cnJVBw
UiDRUU6jF/kZZ1O/FIfjScnwEkvwe4iBS+USzlhqT4TTX3WecjM2DxLrjhhw
OHatXZbHNElzKaNzHWqTSWP1u8pNKirr9Y2ON1IxcDRjtP2K1IjIVn0A4hvU
vav1pNKGrTTLfbByRfJJ6pdoZrdVgCNNgIk0y68JjKMyyoXqRW1cNIuH8WT0
z8hsqPfl4DagY+FFJcwrLsHoPUa7ha0YFhiU5WmoJd3ypbUuu5LtwsZ8EnQL
KN6ZjONl3yX9kyBzFTnkt9B5YazbzqK032LGp3NLsIsbkyDWlhlhadsWp6Dq
ZqKW/kXAQIJnDeuFUdfHYGGLpjgZXA9enF+cj37c6is4e0JFqG71nEkPYa4J
PbC8yJlYwleZTipGfVPg6vrssttx+ITCAeRCpPjKol6QpLyOH7DYJ8HDH8QO
/3LQoQYPFcWt5w4+HHz1DPHpPLWexNuf307/pDy118xTbWP5ZKKSwoyOcKnt
3SMOgg+8MzqDGr0YiL3FLFMXSfHAje924tRt0sx4g2Ji3sNPFpxvMNVB3y8j
t8jfcvgvN4Cpb6LdlL2ek9/2/p5Q4jLoqdo+pWbIddXRQ1BqMNmD1WH8g2Nl
Jj5w71IS40bJDkVK4ueU81IjQFR9I+pBVSGCGxMJHN+Wcb1xpVabiiABMVFu
BuGtLv5j0+pn5PucJDatetZYlSPjApl+vYuFJFbGPMud35hZJ4Zzhu/c0BQu
Jb5NAsSjKaUDTnEOcoikRfB+07Sd81hsq2nvnsw78sFPrx07XEcXjfRZzVdm
9YwkR204dLciO1kXdSncFmV0T3AkDolRCqk+zkoeodArrTvrifbp7r6M2crI
jiPX1qZ96vUGzlqC2dDN2ZCEWuUh9QrwhinWWzrj1BlA3cyqe1Kyf7jWz6oH
9MXlpYp2bKweI6ABTSbXzdHrDsKkFKS5weqSFfJg1fpOog0bCdu6P+3v1Dvq
VbRptF9JKdB1E+0o2ryo0VIwTstive22upyU8Y4gSKfu+lKHFiykY0q0NeIl
cTnTq/Z//aTkbQl3ri0fHuO9Bg8YImPd3NEKmvdd/PNX1/TCi1fXvYtht8Oe
nGiCQkG+bPiNxNpIgzCCG632HjHtxGXDNIO0ffJvI7yEY8+N/qVGbM0WQ41y
qdVqqhYpN0kqFNJujdzXYW+2QfR7HZbcrxWxNKW3SSW8VdJQSt0JYSFIL90R
S62cz823bPX1K3tywmapVdstzsaEJ9rhK2gDekNPtq/eEMD1Nkao1O+W8qZ9
VPkI+wU3/IhYT2iSRm6XQbYgBehntB0amoyE64TP2xl134l3Q8gyq7MnJmkr
tXLEcKaRgNwOUz2+VXt5/fMxl7RBH1Ml/iXbFzc622w2bwY/3mMzVWMtwVMr
ZjmB/ZbST231ydcsyM3TVs0dwVgK9nAf8hHEsnbwqnye49dbPqjO0rvhOPuH
4ruf28X3sp7cBXFP8ieiLFclLDKXrtpNPvFQkF0pc8N+AqUFZy/uTBHT03Q5
oS3qq/O6iwgwsKKj9kqRoX12W0c495Jzv+rMhluPq5cavgQJN8cTDhBONBvi
N09GNaFM0oeKfIZf0OQSFtuU7VRgzDt9PT3M7FsrXhuGaS4bbq3asnLyhtL6
6ippmJCf0B8CE/Y2h8YKZVQyvAE0+YS21EZlGZ/5ddSqvkWIokeUweminmfD
njG4B4ytq24qJqsytWVFJHPRvgQ3i9Amh90od8yNA7iO3x1KdRrJzzEjUTuo
UqsLHYEc/CIANqZTMHSoyzN0j0eey76TAxRfyxVNNWtjG7B33tzjWnVElwz9
mE+GthpZ1uqVyn5Nv2ueWG209dWpRokf1YcK+RCKHIOatCuRioi6wVE7wZ2J
Y04lgkiEkApJ+cMVdLLidxylWLOuKjHkGwqLbqdxdkJ90UkIVR08o2NjjRZG
ZR9VSHAxi3iNKP/OYRe2sZ1P2mwkZzg6HVNteOSqUqnlCPCRIETorCDMzMGL
86RzGdhLnrfbL7iR5j2qgZ/tHfBB3BU8rjSNkCNaMpgr2We7avttY632Hg9Z
rCf9wWoc4lOY2m+rel7XigC3H/XHAxMg0FpkQoptrFh7sxrW519QGDQOPFRV
Uw1KWxujK5upUWRXfHjlHANVd/37N84dRm9trm3o2UGAXGfLPruLum1Jbk7j
fFzDS8Mtds95nfNTPn3MALScj6Vh6TI0NfmstjsrT1vnE5BUSWJTPiNTnZP1
R16hHT6nEsSWtCcT9tXr9E4vdL5DXZJQrx964AZ7PTEhz27HT+8cqzqKK+SZ
eRaERXX+o12pMNEncviEz0HkLeHXhl5bCvB+fp+ZNG1BYr51KcvbNDt6lHJR
D2vBykt+bt20fBYz1HlCaWeZMjQm6IpiKyytbZw8dCfxpfLX8QQUDtM5lVFZ
nC7lNAJpGFREDbdoWSMXMLA9ihTW0NlMfxC8eTSP/WsSy1nkNSwrJ5WLMvPn
VKE/wsNyerrfaP5TFWGTNM1cWmhrVo6OEkTieOwLTdZLYxhlybogokOPgcEj
Io24nQoPVBVRhyqvOWu7Yl1NV+eiq2LMn5BEQUY/PxSaKqkis81YPHpOt/DY
SCh0nXBnHo1jM7G5RQg6uVaDEtPDRUMXLWWrRG3jWW9w9cDp9eneoZxsG1En
isH3RbAEK8PKRrZH9PMCdyL7kA6gcgXNsDCiCqQ6comB3JWvbJqOTVZEumwm
sYvNhHowsBtiGW5VkABLPh/jC6rN8qzc43xwOfisa8yDW9Ykdezl8CRXfuyj
PAEtFoTVxHyPUaWvEOl0qD/hVs/jTmzWv7jRaou1As8DDdTxPZdEkeZ2i/Zr
6KeNCL7Vqbete3/K4n+1AuHLz4YuOexhGj/HsciA+uWy8fgbUBGlCtGya9jf
aBQi7EmuQf+b6tFHub+Nz+otGS2HB35jd2432lVbyn70nh/d6BluHC0aHIS3
SXoX60jgk89/8itk644XsklzRA2SW/UTrHpMh1MMa27GqloYhDWOJoQc2EPo
BLeWjTz/g6MxvLTb+T/HQ1e0Oz4AAA==

-->

</rfc>
