<?xml version='1.0' encoding='utf-8'?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" version="3" category="info" docName="draft-ietf-detnet-controller-plane-framework-15" number="9938" ipr="trust200902" obsoletes="" updates="" consensus="true" submissionType="IETF" xml:lang="en" tocInclude="true" sortRefs="true" symRefs="true" prepTime="2026-03-14T21:56:15" indexInclude="true" scripts="Common,Latin" tocDepth="3">
  <link href="https://datatracker.ietf.org/doc/draft-ietf-detnet-controller-plane-framework-15" rel="prev"/>
  <link href="https://dx.doi.org/10.17487/rfc9938" rel="alternate"/>
  <link href="urn:issn:2070-1721" rel="alternate"/>
  <front>
    <title abbrev="DetNet Controller Plane">A Framework for the Deterministic Networking (DetNet) Controller Plane</title>
    <seriesInfo name="RFC" value="9938" stream="IETF"/>
    <author fullname="Andrew G. Malis" initials="A." surname="Malis">
      <organization showOnFrontPage="true">Independent</organization>
      <address>
        <email>agmalis@gmail.com</email>
      </address>
    </author>
    <author fullname="Xuesong Geng" initials="X." surname="Geng" role="editor">
      <organization showOnFrontPage="true">Huawei</organization>
      <address>
        <email>gengxuesong@huawei.com</email>
      </address>
    </author>
    <author fullname="Mach (Guoyi)Chen" initials="M." surname="(Guoyi)Chen">
      <organization showOnFrontPage="true">Huawei</organization>
      <address>
        <email>mach.chen@huawei.com</email>
      </address>
    </author>
    <author fullname="Balazs Varga" initials="B." surname="Varga">
      <organization showOnFrontPage="true">Ericsson</organization>
      <address>
        <email>balazs.a.varga@ericsson.com</email>
      </address>
    </author>
    <author fullname="Carlos J. Bernardos" initials="CJ." surname="Bernardos">
      <organization abbrev="UC3M" showOnFrontPage="true">Universidad Carlos III de Madrid</organization>
      <address>
        <postal>
          <street>Av. Universidad, 30</street>
          <city>Leganes, Madrid</city>
          <code>28911</code>
          <country>Spain</country>
        </postal>
        <phone>+34 91624 6236</phone>
        <email>cjbc@it.uc3m.es</email>
        <uri>http://www.it.uc3m.es/cjbc/</uri>
      </address>
    </author>
    <date month="03" year="2026"/>
    <area>RTG</area>
    <workgroup>detnet</workgroup>
    <keyword>DetNet</keyword>
    <keyword>Controller plane</keyword>
    <keyword>SDN</keyword>
    <abstract pn="section-abstract">
      <t indent="0" pn="section-abstract-1">This document provides a framework overview for the Deterministic
      Networking (DetNet) Controller Plane. It discusses concepts and
      requirements for the DetNet Controller Plane, which could be the basis for a future
      solution specification.</t>
    </abstract>
    <boilerplate>
      <section anchor="status-of-memo" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.1">
        <name slugifiedName="name-status-of-this-memo">Status of This Memo</name>
        <t indent="0" pn="section-boilerplate.1-1">
            This document is not an Internet Standards Track specification; it is
            published for informational purposes.  
        </t>
        <t indent="0" pn="section-boilerplate.1-2">
            This document is a product of the Internet Engineering Task Force
            (IETF).  It represents the consensus of the IETF community.  It has
            received public review and has been approved for publication by the
            Internet Engineering Steering Group (IESG).  Not all documents
            approved by the IESG are candidates for any level of Internet
            Standard; see Section 2 of RFC 7841. 
        </t>
        <t indent="0" pn="section-boilerplate.1-3">
            Information about the current status of this document, any
            errata, and how to provide feedback on it may be obtained at
            <eref target="https://www.rfc-editor.org/info/rfc9938" brackets="none"/>.
        </t>
      </section>
      <section anchor="copyright" numbered="false" removeInRFC="false" toc="exclude" pn="section-boilerplate.2">
        <name slugifiedName="name-copyright-notice">Copyright Notice</name>
        <t indent="0" pn="section-boilerplate.2-1">
            Copyright (c) 2026 IETF Trust and the persons identified as the
            document authors. All rights reserved.
        </t>
        <t indent="0" pn="section-boilerplate.2-2">
            This document is subject to BCP 78 and the IETF Trust's Legal
            Provisions Relating to IETF Documents
            (<eref target="https://trustee.ietf.org/license-info" brackets="none"/>) in effect on the date of
            publication of this document. Please review these documents
            carefully, as they describe your rights and restrictions with
            respect to this document. Code Components extracted from this
            document must include Revised BSD License text as described in
            Section 4.e of the Trust Legal Provisions and are provided without
            warranty as described in the Revised BSD License.
        </t>
      </section>
    </boilerplate>
    <toc>
      <section anchor="toc" numbered="false" removeInRFC="false" toc="exclude" pn="section-toc.1">
        <name slugifiedName="name-table-of-contents">Table of Contents</name>
        <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1">
          <li pn="section-toc.1-1.1">
            <t indent="0" keepWithNext="true" pn="section-toc.1-1.1.1"><xref derivedContent="1" format="counter" sectionFormat="of" target="section-1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-introduction">Introduction</xref></t>
          </li>
          <li pn="section-toc.1-1.2">
            <t indent="0" pn="section-toc.1-1.2.1"><xref derivedContent="2" format="counter" sectionFormat="of" target="section-2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-controller-plane-req">DetNet Controller Plane Requirements</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.2.2">
              <li pn="section-toc.1-1.2.2.1">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.2.2.1.1"><xref derivedContent="2.1" format="counter" sectionFormat="of" target="section-2.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-control-plane-requir">DetNet Control Plane Requirements</xref></t>
              </li>
              <li pn="section-toc.1-1.2.2.2">
                <t indent="0" keepWithNext="true" pn="section-toc.1-1.2.2.2.1"><xref derivedContent="2.2" format="counter" sectionFormat="of" target="section-2.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-management-plane-req">DetNet Management Plane Requirements</xref></t>
              </li>
              <li pn="section-toc.1-1.2.2.3">
                <t indent="0" pn="section-toc.1-1.2.2.3.1"><xref derivedContent="2.3" format="counter" sectionFormat="of" target="section-2.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-requirements-for-both-plane">Requirements for Both Planes</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.3">
            <t indent="0" pn="section-toc.1-1.3.1"><xref derivedContent="3" format="counter" sectionFormat="of" target="section-3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-control-plane-archit">DetNet Control Plane Architecture</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.3.2">
              <li pn="section-toc.1-1.3.2.1">
                <t indent="0" pn="section-toc.1-1.3.2.1.1"><xref derivedContent="3.1" format="counter" sectionFormat="of" target="section-3.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-distributed-control-plane-a">Distributed Control Plane and Signaling Protocols</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.2">
                <t indent="0" pn="section-toc.1-1.3.2.2.1"><xref derivedContent="3.2" format="counter" sectionFormat="of" target="section-3.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-fully-centralized-control-p">Fully Centralized Control Plane</xref></t>
              </li>
              <li pn="section-toc.1-1.3.2.3">
                <t indent="0" pn="section-toc.1-1.3.2.3.1"><xref derivedContent="3.3" format="counter" sectionFormat="of" target="section-3.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-hybrid-control-plane-partly">Hybrid Control Plane (Partly Centralized and Partly Distributed)</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.4">
            <t indent="0" pn="section-toc.1-1.4.1"><xref derivedContent="4" format="counter" sectionFormat="of" target="section-4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-control-plane-for-de">DetNet Control Plane for DetNet Mechanisms</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.4.2">
              <li pn="section-toc.1-1.4.2.1">
                <t indent="0" pn="section-toc.1-1.4.2.1.1"><xref derivedContent="4.1" format="counter" sectionFormat="of" target="section-4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-explicit-paths">Explicit Paths</xref></t>
              </li>
              <li pn="section-toc.1-1.4.2.2">
                <t indent="0" pn="section-toc.1-1.4.2.2.1"><xref derivedContent="4.2" format="counter" sectionFormat="of" target="section-4.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-resource-reservation">Resource Reservation</xref></t>
              </li>
              <li pn="section-toc.1-1.4.2.3">
                <t indent="0" pn="section-toc.1-1.4.2.3.1"><xref derivedContent="4.3" format="counter" sectionFormat="of" target="section-4.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-preof-support">PREOF Support</xref></t>
              </li>
              <li pn="section-toc.1-1.4.2.4">
                <t indent="0" pn="section-toc.1-1.4.2.4.1"><xref derivedContent="4.4" format="counter" sectionFormat="of" target="section-4.4"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-data-plane-specific-conside">Data-Plane-Specific Considerations</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.4.2.4.2">
                  <li pn="section-toc.1-1.4.2.4.2.1">
                    <t indent="0" pn="section-toc.1-1.4.2.4.2.1.1"><xref derivedContent="4.4.1" format="counter" sectionFormat="of" target="section-4.4.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-in-an-mpls-domain">DetNet in an MPLS Domain</xref></t>
                  </li>
                  <li pn="section-toc.1-1.4.2.4.2.2">
                    <t indent="0" pn="section-toc.1-1.4.2.4.2.2.1"><xref derivedContent="4.4.2" format="counter" sectionFormat="of" target="section-4.4.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-in-an-ip-domain">DetNet in an IP Domain</xref></t>
                  </li>
                  <li pn="section-toc.1-1.4.2.4.2.3">
                    <t indent="0" pn="section-toc.1-1.4.2.4.2.3.1"><xref derivedContent="4.4.3" format="counter" sectionFormat="of" target="section-4.4.3"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-in-a-segment-routing">DetNet in a Segment Routing Domain</xref></t>
                  </li>
                </ul>
              </li>
              <li pn="section-toc.1-1.4.2.5">
                <t indent="0" pn="section-toc.1-1.4.2.5.1"><xref derivedContent="4.5" format="counter" sectionFormat="of" target="section-4.5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-encapsulation-and-metadata-">Encapsulation and Metadata Support</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.5">
            <t indent="0" pn="section-toc.1-1.5.1"><xref derivedContent="5" format="counter" sectionFormat="of" target="section-5"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-management-plane-overview">Management Plane Overview</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2">
              <li pn="section-toc.1-1.5.2.1">
                <t indent="0" pn="section-toc.1-1.5.2.1.1"><xref derivedContent="5.1" format="counter" sectionFormat="of" target="section-5.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-detnet-operations-administr">DetNet Operations, Administration, and Maintenance (OAM)</xref></t>
                <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.5.2.1.2">
                  <li pn="section-toc.1-1.5.2.1.2.1">
                    <t indent="0" pn="section-toc.1-1.5.2.1.2.1.1"><xref derivedContent="5.1.1" format="counter" sectionFormat="of" target="section-5.1.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-oam-for-performance-monitor">OAM for Performance Monitoring (PM)</xref></t>
                  </li>
                  <li pn="section-toc.1-1.5.2.1.2.2">
                    <t indent="0" pn="section-toc.1-1.5.2.1.2.2.1"><xref derivedContent="5.1.2" format="counter" sectionFormat="of" target="section-5.1.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-oam-for-connectivity-and-fa">OAM for Connectivity and Fault Management (CFM)</xref></t>
                  </li>
                </ul>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.6">
            <t indent="0" pn="section-toc.1-1.6.1"><xref derivedContent="6" format="counter" sectionFormat="of" target="section-6"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-multi-domain-aspects">Multi-Domain Aspects</xref></t>
          </li>
          <li pn="section-toc.1-1.7">
            <t indent="0" pn="section-toc.1-1.7.1"><xref derivedContent="7" format="counter" sectionFormat="of" target="section-7"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-iana-considerations">IANA Considerations</xref></t>
          </li>
          <li pn="section-toc.1-1.8">
            <t indent="0" pn="section-toc.1-1.8.1"><xref derivedContent="8" format="counter" sectionFormat="of" target="section-8"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-security-considerations">Security Considerations</xref></t>
          </li>
          <li pn="section-toc.1-1.9">
            <t indent="0" pn="section-toc.1-1.9.1"><xref derivedContent="9" format="counter" sectionFormat="of" target="section-9"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-references">References</xref></t>
            <ul bare="true" empty="true" indent="2" spacing="compact" pn="section-toc.1-1.9.2">
              <li pn="section-toc.1-1.9.2.1">
                <t indent="0" pn="section-toc.1-1.9.2.1.1"><xref derivedContent="9.1" format="counter" sectionFormat="of" target="section-9.1"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-normative-references">Normative References</xref></t>
              </li>
              <li pn="section-toc.1-1.9.2.2">
                <t indent="0" pn="section-toc.1-1.9.2.2.1"><xref derivedContent="9.2" format="counter" sectionFormat="of" target="section-9.2"/>.  <xref derivedContent="" format="title" sectionFormat="of" target="name-informative-references">Informative References</xref></t>
              </li>
            </ul>
          </li>
          <li pn="section-toc.1-1.10">
            <t indent="0" pn="section-toc.1-1.10.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.a"/><xref derivedContent="" format="title" sectionFormat="of" target="name-acknowledgments">Acknowledgments</xref></t>
          </li>
          <li pn="section-toc.1-1.11">
            <t indent="0" pn="section-toc.1-1.11.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.b"/><xref derivedContent="" format="title" sectionFormat="of" target="name-contributors">Contributors</xref></t>
          </li>
          <li pn="section-toc.1-1.12">
            <t indent="0" pn="section-toc.1-1.12.1"><xref derivedContent="" format="none" sectionFormat="of" target="section-appendix.c"/><xref derivedContent="" format="title" sectionFormat="of" target="name-authors-addresses">Authors' Addresses</xref></t>
          </li>
        </ul>
      </section>
    </toc>
  </front>
  <middle>
    <section anchor="introduction" numbered="true" toc="include" removeInRFC="false" pn="section-1">
      <name slugifiedName="name-introduction">Introduction</name>
      <t indent="0" pn="section-1-1">Deterministic Networking (DetNet) provides the ability to carry
      specified unicast or multicast data flows for real-time applications
      with extremely low packet loss rates and assured maximum end-to-end
      delivery latency. A description of the general background and concepts
      of DetNet can be found in <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/>.</t>
      <t indent="0" pn="section-1-2">The DetNet data plane is defined in the DetNet data plane framework
      <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/> (and is further explained in the associated DetNet MPLS
      <xref target="RFC8964" format="default" sectionFormat="of" derivedContent="RFC8964"/>, the DetNet IP <xref target="RFC8939" format="default" sectionFormat="of" derivedContent="RFC8939"/>, and other data plane
      specifications <xref target="RFC9023" format="default" sectionFormat="of" derivedContent="RFC9023"/> <xref target="RFC9024" format="default" sectionFormat="of" derivedContent="RFC9024"/> <xref target="RFC9025" format="default" sectionFormat="of" derivedContent="RFC9025"/> <xref target="RFC9037" format="default" sectionFormat="of" derivedContent="RFC9037"/> <xref target="RFC9056" format="default" sectionFormat="of" derivedContent="RFC9056"/>).</t>
      <t indent="0" pn="section-1-3">Note that in the DetNet overall architecture, the controller plane
      includes what are more usually considered separate control and
      management planes (see <xref target="RFC8655" section="4.4.2" format="default" sectionFormat="of" derivedLink="https://rfc-editor.org/rfc/rfc8655#section-4.4.2" derivedContent="RFC8655"/>). The management plane is primarily
      involved with fault management, configuration management, and performance
      management (sometimes accounting management and security management are
      also considered in the management plane (<xref target="RFC6632" section="4.2" format="default" sectionFormat="of" derivedLink="https://rfc-editor.org/rfc/rfc6632#section-4.2" derivedContent="RFC6632"/>) but they are out of the scope of this
      document). At the same time, the control plane is primarily responsible for the
      instantiation and maintenance of flows, MPLS label allocation and
      distribution, and active in-band or out-of-band signaling to support
      DetNet functions. In the DetNet architecture, all of this functionality
      is combined into a single controller plane. See <xref target="RFC8655" section="4.4.2" format="default" sectionFormat="of" derivedLink="https://rfc-editor.org/rfc/rfc8655#section-4.4.2" derivedContent="RFC8655"/> and the aggregation of control and management planes
      in <xref target="RFC7426" format="default" sectionFormat="of" derivedContent="RFC7426"/> for further details.</t>
      <t indent="0" pn="section-1-4">While the DetNet architecture and data plane documents are primarily
      concerned with data plane operations, they do contain some requirements and considerations
      for functions that would be required in order to automate DetNet service
      provisioning and monitoring via a DetNet Controller Plane (e.g., see <xref target="RFC8938" section="4" format="default" sectionFormat="of" derivedLink="https://rfc-editor.org/rfc/rfc8938#section-4" derivedContent="RFC8938"/>). The purpose
      of this document is to take these requirements and considerations into a single document
      and extend and discuss how various possible DetNet Controller Plane architectures
      could be used to satisfy these requirements, while not providing the
      protocol details for a DetNet Controller Plane solution. Such controller
      plane protocol solutions will be the subject of subsequent
      documents. Therefore, this document should be considered as the authoritative reference to be considered if/when protocol work on the DetNet Controller Plane starts.</t>
    </section>
    <section anchor="requirements" numbered="true" toc="include" removeInRFC="false" pn="section-2">
      <name slugifiedName="name-detnet-controller-plane-req">DetNet Controller Plane Requirements</name>
      <t indent="0" pn="section-2-1">Other DetNet documents, including <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/>, <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>, <xref target="RFC9551" format="default" sectionFormat="of" derivedContent="RFC9551"/>, and <xref target="RFC9055" format="default" sectionFormat="of" derivedContent="RFC9055"/>, among others, contain requirements for the
      controller plane. For convenience, these requirements have been compiled
      here. These requirements have been organized into three groups: 1)
      requirements primarily applicable to the control plane, 2) requirements
      primarily applicable to the management plane, and 3) requirements
      applicable to both planes. In addition, security requirements for the
      DetNet Controller Plane have been discussed in <xref target="RFC9055" format="default" sectionFormat="of" derivedContent="RFC9055"/>, and a summary of those requirements is provided in
      <xref target="requirements-for-both-planes" format="default" sectionFormat="of" derivedContent="Section 2.3"/>. For the sake of clarity, when applicable, the document in which the requirements originally appear is referenced.</t>
      <section anchor="detnet-control-plane-requirements" numbered="true" toc="include" removeInRFC="false" pn="section-2.1">
        <name slugifiedName="name-detnet-control-plane-requir">DetNet Control Plane Requirements</name>
        <t indent="0" pn="section-2.1-1">The primary requirements for the DetNet Control Plane are as follows:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-2.1-2">
          <li pn="section-2.1-2.1">
            <t indent="0" pn="section-2.1-2.1.1">Support the dynamic instantiation, modification, and deletion of
            DetNet flows. This may include some or all of explicit path
            determination, link bandwidth reservations, restriction of flows to
            specific links (e.g., IEEE 802.1 Time-Sensitive Networking (TSN)
            links), node buffer and other resource reservations, specification
            of required queuing disciplines along the path, the ability to manage
            bidirectional flows, etc., as needed for a flow <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>.</t>
          </li>
          <li pn="section-2.1-2.2">
            <t indent="0" pn="section-2.1-2.2.1">Support DetNet flow aggregation and de-aggregation via the
            ability to dynamically create and delete flow aggregates (FAs)
            and modify existing FAs by adding or deleting
            participating flows <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>.</t>
          </li>
          <li pn="section-2.1-2.3">
            <t indent="0" pn="section-2.1-2.3.1">Allow flow instantiation requests to originate in an end
            application (via an Application Programming Interface (API) via
            static provisioning or via a dynamic control plane, such as a
            Software-Defined Networking (SDN) controller or distributed signaling protocols). See
            <xref target="control-plane-architecture" format="default" sectionFormat="of" derivedContent="Section 3"/> for further discussion
            of these options.</t>
          </li>
          <li pn="section-2.1-2.4">
            <t indent="0" pn="section-2.1-2.4.1">Manage, in the case of the DetNet MPLS data plane, DetNet
            Service Label (S-Label), Forwarding Label (F-Label), and
            Aggregation Label (A-Label) <xref target="RFC8964" format="default" sectionFormat="of" derivedContent="RFC8964"/> allocation
            and distribution <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>.</t>
          </li>
          <li pn="section-2.1-2.5">
            <t indent="0" pn="section-2.1-2.5.1">Support, also in the case of the DetNet MPLS data plane, the
            DetNet service sub-layer, which provides DetNet service functions,
            such as protection and reordering through the use of Packet
            Replication, Elimination, and Ordering Functions
            (PREOF) <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/>.</t>
          </li>
          <li pn="section-2.1-2.6">
            <t indent="0" pn="section-2.1-2.6.1">Support the queue control techniques defined in 
            <xref target="RFC8655" section="4.5" sectionFormat="comma" format="default" derivedLink="https://rfc-editor.org/rfc/rfc8655#section-4.5" derivedContent="RFC8655"/> and <xref target="RFC9320" format="default" sectionFormat="of" derivedContent="RFC9320"/> that require
            time synchronization among the network data plane nodes.</t>
          </li>
          <li pn="section-2.1-2.7">
            <t indent="0" pn="section-2.1-2.7.1">Advertise static and dynamic node and link characteristics, such
            as capabilities and adjacencies to other network nodes (for
            dynamic signaling approaches) or to network controllers (for
            centralized approaches) <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>.</t>
          </li>
          <li pn="section-2.1-2.8">
            <t indent="0" pn="section-2.1-2.8.1">Scale to handle the number of DetNet flows expected in a domain
            (which may require per-flow signaling or provisioning) <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>.</t>
          </li>
          <li pn="section-2.1-2.9">
            <t indent="0" pn="section-2.1-2.9.1">Provision flow identification information at each of the nodes
            along the path. Flow identification may differ depending on the
            location in the network and the DetNet functionality (e.g., transit
            node vs. relay node) <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>.</t>
          </li>
        </ul>
      </section>
      <section anchor="detnet-management-plane-requirements" numbered="true" toc="include" removeInRFC="false" pn="section-2.2">
        <name slugifiedName="name-detnet-management-plane-req">DetNet Management Plane Requirements</name>
        <t indent="0" pn="section-2.2-1">The primary requirements for the DetNet management plane are as follows:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-2.2-2">
          <li pn="section-2.2-2.1">
            <t indent="0" pn="section-2.2-2.1.1">Monitor the performance of DetNet flows and nodes to ensure
            that they are meeting required objectives, both proactively and
            on demand <xref target="RFC9551" format="default" sectionFormat="of" derivedContent="RFC9551"/>.</t>
          </li>
          <li pn="section-2.2-2.2">
            <t indent="0" pn="section-2.2-2.2.1">Support DetNet flow continuity check and connectivity
            verification functions <xref target="RFC9551" format="default" sectionFormat="of" derivedContent="RFC9551"/>.</t>
          </li>
          <li pn="section-2.2-2.3">
            <t indent="0" pn="section-2.2-2.3.1">Support testing and monitoring of packet replication, duplicate
            elimination, and packet ordering functionality in the DetNet
            domain <xref target="RFC9551" format="default" sectionFormat="of" derivedContent="RFC9551"/>.</t>
          </li>
        </ul>
      </section>
      <section anchor="requirements-for-both-planes" numbered="true" toc="include" removeInRFC="false" pn="section-2.3">
        <name slugifiedName="name-requirements-for-both-plane">Requirements for Both Planes</name>
        <t indent="0" pn="section-2.3-1">The following requirements apply to both the DetNet control and
        management planes:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-2.3-2">
          <li pn="section-2.3-2.1">
            <t indent="0" pn="section-2.3-2.1.1">Operate in a converged network domain that contains both DetNet
            and non-DetNet flows <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/>.</t>
          </li>
          <li pn="section-2.3-2.2">
            <t indent="0" pn="section-2.3-2.2.1">Adapt to DetNet domain topology changes such as link or node
            failures (fault recovery/restoration), additions, and removals <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/>.</t>
          </li>
        </ul>
        <t indent="0" pn="section-2.3-3">In addition to the above, the DetNet Controller Plane should also satisfy security requirements derived from <xref target="RFC9055" format="default" sectionFormat="of" derivedContent="RFC9055"/>,
   which defines the security framework for DetNet. The following
   requirements are especially relevant:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-2.3-4">
          <li pn="section-2.3-4.1">
            <t indent="0" pn="section-2.3-4.1.1">Integrity and authenticity of control/signaling packets: The controller plane should ensure that signaling and control messages cannot be modified or injected by unauthorized entities and should prevent spoofing and segmentation attacks.</t>
          </li>
          <li pn="section-2.3-4.2">
            <t indent="0" pn="section-2.3-4.2.1">Protection against controller compromise: Mechanisms should exist to verify the legitimacy of controllers and to prevent unauthorized components from impersonating them.</t>
          </li>
          <li pn="section-2.3-4.3">
            <t indent="0" pn="section-2.3-4.3.1">System-wide security design: The architecture must account for the possibility of compromised nodes or controllers, ensuring resilience so that the failure or subversion of a single component does not cause catastrophic impact.</t>
          </li>
          <li pn="section-2.3-4.4">
            <t indent="0" pn="section-2.3-4.4.1">Timely delivery of control plane messages: The controller plane should ensure that control and signaling messages are delivered without undue delay to prevent disruption of DetNet services without resource leakage.</t>
          </li>
        </ul>
      </section>
    </section>
    <section anchor="control-plane-architecture" numbered="true" toc="include" removeInRFC="false" pn="section-3">
      <name slugifiedName="name-detnet-control-plane-archit">DetNet Control Plane Architecture</name>
      <t indent="0" pn="section-3-1">As noted in the <xref target="introduction" format="title" sectionFormat="of" derivedContent="Introduction"/>, the DetNet Control Plane is responsible
      for the instantiation and maintenance of flows, the allocation and
      distribution of flow-related information (e.g., MPLS label), and active
      in-band or out-of-band information distribution to support these
      functions.</t>
      <t indent="0" pn="section-3-2">The following sections define three types of DetNet Control Plane
      architectures: 1) a fully distributed control plane utilizing dynamic
      signaling protocols, 2) a fully centralized SDN-like control plane, and 3) a
      hybrid control plane containing both distributed protocols and
      centralized controlling. This document describes the various
      information exchanges between entities in the network for each type of
      these architectures and the corresponding advantages and
      disadvantages.</t>
      <t indent="0" pn="section-3-3">The examples in the following sections illustrate
      possible mechanisms that could be used in each type of the
      architectures. They are not meant to be exhaustive or to preclude any
      other possible mechanism that could be used in place of those used in
      the examples.</t>
      <section anchor="distributed-control-plane" numbered="true" toc="include" removeInRFC="false" pn="section-3.1">
        <name slugifiedName="name-distributed-control-plane-a">Distributed Control Plane and Signaling Protocols</name>
        <t indent="0" pn="section-3.1-1">In a fully distributed configuration model, the User-Network
        Interface (UNI) information is transmitted over a DetNet UNI protocol
        from the user side to the network side. Then, the UNI and network
        configuration information propagates in the network via distributed
        control plane signaling protocols. Such a DetNet UNI protocol is not
        necessary when the end systems are DetNet capable.</t>
        <t indent="0" pn="section-3.1-2">Taking an RSVP-TE <xref target="RFC3209" format="default" sectionFormat="of" derivedContent="RFC3209"/> MPLS network as an example, where end systems are
        not part of the DetNet domain:</t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-3.1-3">
	  <li pn="section-3.1-3.1" derivedCounter="1.">
            <t indent="0" pn="section-3.1-3.1.1">Network nodes collect topology information and DetNet
            capabilities of the network nodes through IGP.</t>
          </li>
          <li pn="section-3.1-3.2" derivedCounter="2.">
            <t indent="0" pn="section-3.1-3.2.1">The ingress edge node receives a flow establishment request from
            the UNI and calculates one or more valid paths.</t>
          </li>
          <li pn="section-3.1-3.3" derivedCounter="3.">
            <t indent="0" pn="section-3.1-3.3.1">The ingress node sends a PATH message with an explicit route
            through RSVP-TE. After receiving the PATH
            message, the egress edge node sends a RESV message with the
            distributed label and resource reservation request.</t>
          </li>
        </ol>
        <t indent="0" pn="section-3.1-4"> In this example, both the IGP and RSVP-TE may require extensions
        for DetNet.</t>
      </section>
      <section anchor="sdnfully-centralized-control-plane" numbered="true" toc="include" removeInRFC="false" pn="section-3.2">
        <name slugifiedName="name-fully-centralized-control-p">Fully Centralized Control Plane</name>
        <t indent="0" pn="section-3.2-1">In the fully centralized configuration model (e.g., using an SDN controller), both flow and UNI
        information can be transmitted from a centralized user controller or from other
        applications, via an API or northbound interface, to a centralized
        controller. Network node configurations for DetNet flows are
        performed by the controller using a protocol such as NETCONF
        <xref target="RFC6241" format="default" sectionFormat="of" derivedContent="RFC6241"/>, YANG <xref target="RFC6020" format="default" sectionFormat="of" derivedContent="RFC6020"/> <xref target="RFC7950" format="default" sectionFormat="of" derivedContent="RFC7950"/>, DetNet YANG <xref target="RFC9633" format="default" sectionFormat="of" derivedContent="RFC9633"/>, or a PCE-based central controller (PCE-CC) <xref target="RFC8283" format="default" sectionFormat="of" derivedContent="RFC8283"/>.</t>
        <t indent="0" pn="section-3.2-2">Take the following case as an example:</t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-3.2-3">
	  <li pn="section-3.2-3.1" derivedCounter="1.">
            <t indent="0" pn="section-3.2-3.1.1">A centralized controller collects topology information and
            DetNet capabilities of the network nodes via NETCONF/YANG.</t>
          </li>
          <li pn="section-3.2-3.2" derivedCounter="2.">
            <t indent="0" pn="section-3.2-3.2.1">The controller receives a flow establishment request from a UNI
            and calculates one or more valid paths through the network.</t>
          </li>
          <li pn="section-3.2-3.3" derivedCounter="3.">
            <t indent="0" pn="section-3.2-3.3.1">The controller chooses the optimal path and configures the
            devices along that path for DetNet flow transmission via
            PCE-CC.</t>
          </li>
        </ol>
        <t indent="0" pn="section-3.2-4">The protocols in the above example may require extensions for
        DetNet.</t>
      </section>
      <section anchor="combined-control-plane-partly-centralized-partly-distributed" numbered="true" toc="include" removeInRFC="false" pn="section-3.3">
        <name slugifiedName="name-hybrid-control-plane-partly">Hybrid Control Plane (Partly Centralized and Partly Distributed)</name>
        <t indent="0" pn="section-3.3-1">In the hybrid model, the controller and control plane protocols work
        together to provide DetNet services, and there are a number of
        possible combinations.</t>
        <t indent="0" pn="section-3.3-2">In the following case, the RSVP-TE and controller are used
        together:</t>
        <ol spacing="normal" type="1" indent="adaptive" start="1" pn="section-3.3-3">
	  <li pn="section-3.3-3.1" derivedCounter="1.">
            <t indent="0" pn="section-3.3-3.1.1">A controller collects topology information and DetNet
            capabilities of the network nodes via an IGP and/or the Border Gateway Protocol - Link State (BGP-LS) <xref target="RFC9552" format="default" sectionFormat="of" derivedContent="RFC9552"/>.</t>
          </li>
          <li pn="section-3.3-3.2" derivedCounter="2.">
            <t indent="0" pn="section-3.3-3.2.1">A controller receives a flow establishment request through API
            and calculates one or more valid paths through the network.</t>
          </li>
          <li pn="section-3.3-3.3" derivedCounter="3.">
            <t indent="0" pn="section-3.3-3.3.1">Based on the calculation result, the controller distributes
            flow path information to the ingress edge node and configures
            network nodes along the path with necessary DetNet information
            (e.g., for replication/duplicate elimination).</t>
          </li>
          <li pn="section-3.3-3.4" derivedCounter="4.">
            <t indent="0" pn="section-3.3-3.4.1">Using RSVP-TE, the ingress edge node sends a PATH message with
            an explicit route. After receiving the PATH message, the egress
            edge node sends a RESV message with the distributed label and
            resource reservation request.</t>
          </li>
        </ol>
        <t indent="0" pn="section-3.3-4">There are many other variations that could be included in a hybrid
        control plane. The requested DetNet extensions for a protocol in each
        possible case is for future work.</t>
      </section>
    </section>
    <section anchor="detnet-control-plane-additional-details-and-issues" numbered="true" toc="include" removeInRFC="false" pn="section-4">
      <name slugifiedName="name-detnet-control-plane-for-de">DetNet Control Plane for DetNet Mechanisms</name>
      <t indent="0" pn="section-4-1">This section discusses the requested control plane features for DetNet
      mechanisms as defined in <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/>, including PREOF. Different DetNet
      services may implement any or all of these based on the requirements.</t>
      <section anchor="explicit-paths" numbered="true" toc="include" removeInRFC="false" pn="section-4.1">
        <name slugifiedName="name-explicit-paths">Explicit Paths</name>
        <t indent="0" pn="section-4.1-1">Explicit paths are required in DetNet to provide a stable
        forwarding service and guarantee that the DetNet service is not impacted
        when the network topology changes. The following features are
        necessary in the control plane to implement explicit paths in DetNet:</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-4.1-2">
          <li pn="section-4.1-2.1">
            <t indent="0" pn="section-4.1-2.1.1">Path computation: DetNet explicit paths need to meet the 
            Service Level Agreement (SLA) requirements of the application, which
            include bandwidth, maximum end-to-end delay, maximum end-to-end
            delay variation, maximum loss ratio, etc. In a distributed network
            system, an IGP with Constrained Shortest Path First (CSPF) may be
            used to compute a set of feasible paths for a DetNet service. In a
            centralized network system, the controller can compute paths
            satisfying the requirements of DetNet based on the network
            information collected from the DetNet domain.</t>
          </li>
          <li pn="section-4.1-2.2">
            <t indent="0" pn="section-4.1-2.2.1">Path establishment: The computed path for the DetNet service
            has to be sent/configured/signaled to the network device so that the
            corresponding DetNet flow can pass through the network domain
            following the specified path.</t>
          </li>
        </ul>
      </section>
      <section anchor="resource-reservation" numbered="true" toc="include" removeInRFC="false" pn="section-4.2">
        <name slugifiedName="name-resource-reservation">Resource Reservation</name>
        <t indent="0" pn="section-4.2-1">DetNet flows are supposed to be protected from congestion, so
        sufficient resource reservation for a DetNet service could protect
        a service from congestion. There are multiple types of resources in the
        network that could be allocated to DetNet flows, e.g., packet
        processing resources, buffer resources, and the bandwidth of the output
        port. The network resource requested by a specified DetNet service is
        determined by the SLA requirements and network capability.</t>
        <ul spacing="normal" bare="false" empty="false" indent="3" pn="section-4.2-2">
          <li pn="section-4.2-2.1">
            <t indent="0" pn="section-4.2-2.1.1">Resource Allocation: Port bandwidth is one of the basic
            attributes of a network device that is easy to obtain or
            calculate. In current traffic engineering implementations, network
            resource allocation is synonymous with bandwidth allocation. A
            DetNet flow is characterized by a traffic specification, as
            defined in <xref target="RFC9016" format="default" sectionFormat="of" derivedContent="RFC9016"/>, including attributes such as
            Interval, MaxPacketsPerInterval, and MaxPayloadSize.
            The traffic specification describes the worst case, rather than
            the average case, for the traffic to ensure that sufficient
            bandwidth and buffering resources are reserved to satisfy the
            traffic specification. However, in the case of DetNet, resource
            allocation is more than simple bandwidth reservation. For example,
            allocation of buffers and required queuing disciplines during
            forwarding may be required as well. Furthermore, resources must be
            ensured to execute DetNet service sub-layer functions on the node,
            such as protection and reordering through the use of PREOF.</t>
          </li>
          <li pn="section-4.2-2.2">
            <t indent="0" pn="section-4.2-2.2.1">Device configuration with or without flow discrimination: The
            resource allocation can be guaranteed by device configuration. For
            example, an output port bandwidth reservation can be configured as
            a parameter of queue management and the port scheduling algorithm.
            When DetNet flows are aggregated, a group of DetNet flows share
            the allocated resource in the network device. When the DetNet
            flows are treated independently, the device should maintain a
            mapping relationship between a DetNet flow and its corresponding
            resources.</t>
          </li>
        </ul>
      </section>
      <section anchor="preof-support" numbered="true" toc="include" removeInRFC="false" pn="section-4.3">
        <name slugifiedName="name-preof-support">PREOF Support</name>
        <t indent="0" pn="section-4.3-1">DetNet path redundancy is supported via Packet Replication,
        Elimination, and Ordering Functions (PREOF). A DetNet
        flow is replicated and forwarded by multiple networks paths to avoid
        packet loss caused by device or link failures. In general, current
        control plane mechanisms that can be used to establish an explicit
        path, whether distributed or centralized, support point-to-point (P2P)
        and point-to-multipoint (P2MP) path establishment. PREOF requires the
        ability to compute and establish a set of multiple paths (e.g.,
        multiple Label Switched Path (LSP) segments in an MPLS network) from the point(s) of packet
        replication to the point(s) of packet merging and ordering. Mapping of
        DetNet flows or DetNet member flows to explicit path segments has to be ensured as
        well. Protocol extensions will be required to support these new
        features. Terminology will also be required to refer to this
        coordinated set of path segments (such as an "LSP graph"
        in the case of the DetNet MPLS data plane).</t>
      </section>
      <section anchor="dp-specific" numbered="true" toc="include" removeInRFC="false" pn="section-4.4">
        <name slugifiedName="name-data-plane-specific-conside">Data-Plane-Specific Considerations</name>
        <section anchor="legacy-mpls" numbered="true" toc="include" removeInRFC="false" pn="section-4.4.1">
          <name slugifiedName="name-detnet-in-an-mpls-domain">DetNet in an MPLS Domain</name>
          <t indent="0" pn="section-4.4.1-1">For the purposes of this document, "legacy MPLS"
          is defined as MPLS without the use of Segment Routing (see <xref target="SR" format="default" sectionFormat="of" derivedContent="Section 4.4.3"/> for a discussion of MPLS with Segment Routing) or
          MPLS Transport Profile (MPLS-TP) <xref target="RFC5960" format="default" sectionFormat="of" derivedContent="RFC5960"/>.</t>
          <t indent="0" pn="section-4.4.1-2">In legacy MPLS domains, a dynamic control plane using
          distributed signaling protocols is typically used for the
          distribution of MPLS labels used for forwarding MPLS packets.
  The dynamic signaling protocols most commonly used for label
  distribution are LDP <xref target="RFC5036" format="default" sectionFormat="of" derivedContent="RFC5036"/>, RSVP-TE <xref target="RFC4875" format="default" sectionFormat="of" derivedContent="RFC4875"/>, and BGP <xref target="RFC8277" format="default" sectionFormat="of" derivedContent="RFC8277"/>
  (which enables BGP-based MPLS Layer 3 VPNs <xref target="RFC4384" format="default" sectionFormat="of" derivedContent="RFC4384"/>, Layer 2 VPNs
  <xref target="RFC4664" format="default" sectionFormat="of" derivedContent="RFC4664"/>, and EVPNs <xref target="RFC7432" format="default" sectionFormat="of" derivedContent="RFC7432"/>).</t>
          <t indent="0" pn="section-4.4.1-3">Any of these protocols could be used to distribute DetNet Service
          Labels (S-Labels) and Aggregation Labels (A-Labels) <xref target="RFC8964" format="default" sectionFormat="of" derivedContent="RFC8964"/>. As discussed in <xref target="RFC8938" format="default" sectionFormat="of" derivedContent="RFC8938"/>,
          S-Labels are similar to other MPLS service labels, such as
          pseudowire and L3 VPN and L2 VPN labels, and could be distributed in a
          similar manner, such as through the use of targeted LDP or BGP. If
          these were to be used for DetNet, they would require extensions to
          support DetNet-specific features, such as PREOF, aggregation
          (A-Labels), node resource allocation, and queue placement.</t>
        </section>
        <section anchor="detnet-in-an-ip-domain" numbered="true" toc="include" removeInRFC="false" pn="section-4.4.2">
          <name slugifiedName="name-detnet-in-an-ip-domain">DetNet in an IP Domain</name>
          <t indent="0" pn="section-4.4.2-1">For the purposes of this document, "legacy IP" is defined as
	  IP without the use of Segment Routing (see <xref target="SR" format="default" sectionFormat="of" derivedContent="Section 4.4.3"/> for a discussion of IP with Segment Routing).  It
	  should be noted that a DetNet IP data plane <xref target="RFC8939" format="default" sectionFormat="of" derivedContent="RFC8939"/>
	  is simpler than a DetNet MPLS data plane <xref target="RFC8964" format="default" sectionFormat="of" derivedContent="RFC8964"/>
	  and doesn't support PREOF, so only one path per flow or flow
	  aggregate is required. Therefore, possible protocol extensions are
	  expected to be limited, e.g., to existing IP routing protocols.</t>
        </section>
        <section anchor="SR" numbered="true" toc="include" removeInRFC="false" pn="section-4.4.3">
          <name slugifiedName="name-detnet-in-a-segment-routing">DetNet in a Segment Routing Domain</name>
          <t indent="0" pn="section-4.4.3-1">Segment Routing <xref target="RFC8402" format="default" sectionFormat="of" derivedContent="RFC8402"/> is a scalable approach
          to building network domains that provides explicit routing via
          source routing encoded in packet headers, and it is combined with
          centralized network control to compute paths through the network.
          Forwarding paths are distributed with associated policies to network
          edge nodes for use in packet headers. Segment Routing reduces
          the amount of network signaling associated with distributed
          signaling protocols, such as RSVP-TE, and also reduces the amount of
          state in core nodes compared with that required for legacy MPLS
          and IP routing, as the state is now in the packets rather than in
          the routers. This could be useful for DetNet, where a very large
          number of flows through a network domain are expected, which would
          otherwise require the instantiation of state for each flow
          traversing each node in the network.</t>
          <t indent="0" pn="section-4.4.3-2">Note that the DetNet MPLS and IP data planes described in <xref target="RFC8964" format="default" sectionFormat="of" derivedContent="RFC8964"/> and <xref target="RFC8939" format="default" sectionFormat="of" derivedContent="RFC8939"/> were constructed to
          be compatible with both types of Segment Routing: Segment Routing over MPLS (SR-MPLS) <xref target="RFC8660" format="default" sectionFormat="of" derivedContent="RFC8660"/> and Segment Routing over IPv6 (SRv6) <xref target="RFC8754" format="default" sectionFormat="of" derivedContent="RFC8754"/> <xref target="RFC8986" format="default" sectionFormat="of" derivedContent="RFC8986"/>.</t>
        </section>
      </section>
      <section anchor="encapsulation-support" numbered="true" toc="include" removeInRFC="false" pn="section-4.5">
        <name slugifiedName="name-encapsulation-and-metadata-">Encapsulation and Metadata Support</name>
        <t indent="0" pn="section-4.5-1">To effectively manage DetNet flows, the controller plane will need to have a clear understanding of the encapsulation and metadata capabilities of the underlying network nodes. This will require a control mechanism that can discover, configure, and manage these parameters for each flow.</t>
        <t indent="0" pn="section-4.5-2">The controller plane needs to understand and manage the encapsulation and metadata capabilities of the network nodes to provision DetNet flows effectively. This process might need a discovery phase in which the controller discovers which encapsulation types (e.g., MPLS, IP) and metadata schemes (e.g., sequencing, timestamping) that each node supports. After discovery, the controller might instruct nodes on the specific encapsulation and companion metadata to apply for a given flow. This ensures that DetNet packets are handled consistently across the network. For example, the controller might instruct a node to use an MPLS header and add a sequence number for a particular flow.
        </t>
      </section>
    </section>
    <section anchor="management-plane-overview" numbered="true" toc="include" removeInRFC="false" pn="section-5">
      <name slugifiedName="name-management-plane-overview">Management Plane Overview</name>
      <t indent="0" pn="section-5-1">The management plane includes the ability to statically provision
      network nodes and to use Operations, Administration, and Maintenance (OAM) to monitor DetNet performance and to detect
      outages or other issues at the DetNet layer.</t>
      <section anchor="detnet-operations-administration-and-maintenance-oam" numbered="true" toc="include" removeInRFC="false" pn="section-5.1">
        <name slugifiedName="name-detnet-operations-administr">DetNet Operations, Administration, and Maintenance (OAM)</name>
        <t indent="0" pn="section-5.1-1">This document covers the general considerations for OAM.</t>
        <section anchor="oam-for-performance-monitoring-pm" numbered="true" toc="include" removeInRFC="false" pn="section-5.1.1">
          <name slugifiedName="name-oam-for-performance-monitor">OAM for Performance Monitoring (PM)</name>
          <section anchor="active-pm" numbered="true" toc="exclude" removeInRFC="false" pn="section-5.1.1.1">
            <name slugifiedName="name-active-pm">Active PM</name>
            <t indent="0" pn="section-5.1.1.1-1">Active PM is performed by injecting OAM packets into the
            network to estimate the performance of the network and by then measuring
            the performance of those OAM packets. Adding extra traffic can
            affect the delay and throughput performance of the network, and
            for this reason, Active PM is not recommended for use in
            operational DetNet domains. However, it is a useful test tool when
            commissioning a new network or during troubleshooting.</t>
          </section>
          <section anchor="passive-pm" numbered="true" toc="exclude" removeInRFC="false" pn="section-5.1.1.2">
            <name slugifiedName="name-passive-pm">Passive PM</name>
            <t indent="0" pn="section-5.1.1.2-1">Passive PM, such as In Situ Operations, Administration, and Maintenance (IOAM) <xref target="RFC9197" format="default" sectionFormat="of" derivedContent="RFC9197"/>, monitors the actual service traffic in a network
            domain in order to measure its performance without having a
            detrimental effect on the network. As compared to Active PM,
            Passive PM is much preferred for use in DetNet domains.</t>
          </section>
        </section>
        <section anchor="oam-for-connectivity-and-faultdefect-management-cfm" numbered="true" toc="include" removeInRFC="false" pn="section-5.1.2">
          <name slugifiedName="name-oam-for-connectivity-and-fa">OAM for Connectivity and Fault Management (CFM)</name>
          <t indent="0" pn="section-5.1.2-1">The detailed requirements for CFM
          in a DetNet IP domain and a DetNet MPLS domain
          are defined in <xref target="RFC9551" format="default" sectionFormat="of" derivedContent="RFC9551"/>, <xref target="RFC9634" format="default" sectionFormat="of" derivedContent="RFC9634"/>, and <xref target="RFC9546" format="default" sectionFormat="of" derivedContent="RFC9546"/>, respectively.</t>
        </section>
      </section>
    </section>
    <section numbered="true" toc="include" removeInRFC="false" pn="section-6">
      <name slugifiedName="name-multi-domain-aspects">Multi-Domain Aspects</name>
      <t indent="0" pn="section-6-1">When there are multiple domains involved, multiple Controller Plane
      Functions (CPFs) would have to collaborate to implement the requests
      received from the Flow Management Entity (FME) <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/>
      as per-flow, per-hop behaviors installed in the DetNet nodes for each
      individual flow.  Adding multi-domain support might require some support
      at the CPF. For example, CPFs of different domains, e.g., PCEs, need to
      discover each other and then authenticate and negotiate per-hop
      behaviors. Furthermore, in the case of wireless domains,
      per-domain functions specific to Reliable and Available Wireless (RAW) <xref target="I-D.ietf-raw-architecture" format="default" sectionFormat="of" derivedContent="RAW-ARCH"/>, such as Point of Local Repairs (PLRs), have to also be
      considered, e.g., in addition to the PCEs. Depending on the multi-domain
      support provided by the application plane, the controller plane might be
      relieved from some responsibilities (e.g., if the application plane
      takes care of splitting what needs to be provided by each domain).</t>
    </section>
    <section anchor="iana-considerations" numbered="true" toc="include" removeInRFC="false" pn="section-7">
      <name slugifiedName="name-iana-considerations">IANA Considerations</name>
      <t indent="0" pn="section-7-1">This document has no IANA actions.</t>
    </section>
    <section anchor="security-considerations" numbered="true" toc="include" removeInRFC="false" pn="section-8">
      <name slugifiedName="name-security-considerations">Security Considerations</name>
      <t indent="0" pn="section-8-1">This document provides a framework for the DetNet Controller Plane
      and does not include any protocol specifications. Any future
      specification that is defined to support the DetNet Controller Plane is
      expected to include the appropriate security considerations. For overall
      security considerations of DetNet, see <xref target="RFC8655" format="default" sectionFormat="of" derivedContent="RFC8655"/> and <xref target="RFC9055" format="default" sectionFormat="of" derivedContent="RFC9055"/>.</t>
    </section>
  </middle>
  <back>
    <displayreference target="I-D.ietf-raw-architecture" to="RAW-ARCH"/>
    <references pn="section-9">
      <name slugifiedName="name-references">References</name>
      <references pn="section-9.1">
        <name slugifiedName="name-normative-references">Normative References</name>
        <reference anchor="RFC8655" target="https://www.rfc-editor.org/info/rfc8655" quoteTitle="true" derivedAnchor="RFC8655">
          <front>
            <title>Deterministic Networking Architecture</title>
            <author fullname="N. Finn" initials="N." surname="Finn"/>
            <author fullname="P. Thubert" initials="P." surname="Thubert"/>
            <author fullname="B. Varga" initials="B." surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <date month="October" year="2019"/>
            <abstract>
              <t indent="0">This document provides the overall architecture for Deterministic Networking (DetNet), which provides a capability to carry specified unicast or multicast data flows for real-time applications with extremely low data loss rates and bounded latency within a network domain. Techniques used include 1) reserving data-plane resources for individual (or aggregated) DetNet flows in some or all of the intermediate nodes along the path of the flow, 2) providing explicit routes for DetNet flows that do not immediately change with the network topology, and 3) distributing data from DetNet flow packets over time and/or space to ensure delivery of each packet's data in spite of the loss of a path. DetNet operates at the IP layer and delivers service over lower-layer technologies such as MPLS and Time- Sensitive Networking (TSN) as defined by IEEE 802.1.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8655"/>
          <seriesInfo name="DOI" value="10.17487/RFC8655"/>
        </reference>
        <reference anchor="RFC8938" target="https://www.rfc-editor.org/info/rfc8938" quoteTitle="true" derivedAnchor="RFC8938">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane Framework</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="L. Berger" initials="L." surname="Berger"/>
            <author fullname="A. Malis" initials="A." surname="Malis"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <date month="November" year="2020"/>
            <abstract>
              <t indent="0">This document provides an overall framework for the Deterministic Networking (DetNet) data plane. It covers concepts and considerations that are generally common to any DetNet data plane specification. It describes related Controller Plane considerations as well.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8938"/>
          <seriesInfo name="DOI" value="10.17487/RFC8938"/>
        </reference>
        <reference anchor="RFC9016" target="https://www.rfc-editor.org/info/rfc9016" quoteTitle="true" derivedAnchor="RFC9016">
          <front>
            <title>Flow and Service Information Model for Deterministic Networking (DetNet)</title>
            <author fullname="B. Varga" initials="B." surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="R. Cummings" initials="R." surname="Cummings"/>
            <author fullname="Y. Jiang" initials="Y." surname="Jiang"/>
            <author fullname="D. Fedyk" initials="D." surname="Fedyk"/>
            <date month="March" year="2021"/>
            <abstract>
              <t indent="0">This document describes the flow and service information model for Deterministic Networking (DetNet). These models are defined for IP and MPLS DetNet data planes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9016"/>
          <seriesInfo name="DOI" value="10.17487/RFC9016"/>
        </reference>
        <reference anchor="RFC9055" target="https://www.rfc-editor.org/info/rfc9055" quoteTitle="true" derivedAnchor="RFC9055">
          <front>
            <title>Deterministic Networking (DetNet) Security Considerations</title>
            <author fullname="E. Grossman" initials="E." role="editor" surname="Grossman"/>
            <author fullname="T. Mizrahi" initials="T." surname="Mizrahi"/>
            <author fullname="A. Hacker" initials="A." surname="Hacker"/>
            <date month="June" year="2021"/>
            <abstract>
              <t indent="0">A DetNet (deterministic network) provides specific performance guarantees to its data flows, such as extremely low data loss rates and bounded latency (including bounded latency variation, i.e., "jitter"). As a result, securing a DetNet requires that in addition to the best practice security measures taken for any mission-critical network, additional security measures may be needed to secure the intended operation of these novel service properties.</t>
              <t indent="0">This document addresses DetNet-specific security considerations from the perspectives of both the DetNet system-level designer and component designer. System considerations include a taxonomy of relevant threats and attacks, and associations of threats versus use cases and service properties. Component-level considerations include ingress filtering and packet arrival-time violation detection.</t>
              <t indent="0">This document also addresses security considerations specific to the IP and MPLS data plane technologies, thereby complementing the Security Considerations sections of those documents.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9055"/>
          <seriesInfo name="DOI" value="10.17487/RFC9055"/>
        </reference>
        <reference anchor="RFC9551" target="https://www.rfc-editor.org/info/rfc9551" quoteTitle="true" derivedAnchor="RFC9551">
          <front>
            <title>Framework of Operations, Administration, and Maintenance (OAM) for Deterministic Networking (DetNet)</title>
            <author fullname="G. Mirsky" initials="G." surname="Mirsky"/>
            <author fullname="F. Theoleyre" initials="F." surname="Theoleyre"/>
            <author fullname="G. Papadopoulos" initials="G." surname="Papadopoulos"/>
            <author fullname="CJ. Bernardos" initials="CJ." surname="Bernardos"/>
            <author fullname="B. Varga" initials="B." surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <date month="March" year="2024"/>
            <abstract>
              <t indent="0">Deterministic Networking (DetNet), as defined in RFC 8655, aims to provide bounded end-to-end latency on top of the network infrastructure, comprising both Layer 2 bridged and Layer 3 routed segments. This document's primary purpose is to detail the specific requirements of the Operations, Administration, and Maintenance (OAM) recommended to maintain a deterministic network. The document will be used in future work that defines the applicability of and extension of OAM protocols for a deterministic network. With the implementation of the OAM framework in DetNet, an operator will have a real-time view of the network infrastructure regarding the network's ability to respect the Service Level Objective (SLO), such as packet delay, delay variation, and packet-loss ratio, assigned to each DetNet flow.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9551"/>
          <seriesInfo name="DOI" value="10.17487/RFC9551"/>
        </reference>
      </references>
      <references pn="section-9.2">
        <name slugifiedName="name-informative-references">Informative References</name>
        <reference anchor="I-D.ietf-raw-architecture" target="https://datatracker.ietf.org/doc/html/draft-ietf-raw-architecture-30" quoteTitle="true" derivedAnchor="RAW-ARCH">
          <front>
            <title>Reliable and Available Wireless Architecture</title>
            <author initials="P." surname="Thubert" fullname="Pascal Thubert" role="editor">
              <organization showOnFrontPage="true">Without Affiliation</organization>
            </author>
            <date month="July" day="25" year="2025"/>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-raw-architecture-30"/>
          <refcontent>Work in Progress</refcontent>
        </reference>
        <reference anchor="RFC3209" target="https://www.rfc-editor.org/info/rfc3209" quoteTitle="true" derivedAnchor="RFC3209">
          <front>
            <title>RSVP-TE: Extensions to RSVP for LSP Tunnels</title>
            <author fullname="D. Awduche" initials="D." surname="Awduche"/>
            <author fullname="L. Berger" initials="L." surname="Berger"/>
            <author fullname="D. Gan" initials="D." surname="Gan"/>
            <author fullname="T. Li" initials="T." surname="Li"/>
            <author fullname="V. Srinivasan" initials="V." surname="Srinivasan"/>
            <author fullname="G. Swallow" initials="G." surname="Swallow"/>
            <date month="December" year="2001"/>
            <abstract>
              <t indent="0">This document describes the use of RSVP (Resource Reservation Protocol), including all the necessary extensions, to establish label-switched paths (LSPs) in MPLS (Multi-Protocol Label Switching). Since the flow along an LSP is completely identified by the label applied at the ingress node of the path, these paths may be treated as tunnels. A key application of LSP tunnels is traffic engineering with MPLS as specified in RFC 2702. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="3209"/>
          <seriesInfo name="DOI" value="10.17487/RFC3209"/>
        </reference>
        <reference anchor="RFC4384" target="https://www.rfc-editor.org/info/rfc4384" quoteTitle="true" derivedAnchor="RFC4384">
          <front>
            <title>BGP Communities for Data Collection</title>
            <author fullname="D. Meyer" initials="D." surname="Meyer"/>
            <date month="February" year="2006"/>
            <abstract>
              <t indent="0">BGP communities (RFC 1997) are used by service providers for many purposes, including tagging of customer, peer, and geographically originated routes. Such tagging is typically used to control the scope of redistribution of routes within a provider's network and to its peers and customers. With the advent of large-scale BGP data collection (and associated research), it has become clear that the information carried in such communities is essential for a deeper understanding of the global routing system. This memo defines standard (outbound) communities and their encodings for export to BGP route collectors. 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="114"/>
          <seriesInfo name="RFC" value="4384"/>
          <seriesInfo name="DOI" value="10.17487/RFC4384"/>
        </reference>
        <reference anchor="RFC4664" target="https://www.rfc-editor.org/info/rfc4664" quoteTitle="true" derivedAnchor="RFC4664">
          <front>
            <title>Framework for Layer 2 Virtual Private Networks (L2VPNs)</title>
            <author fullname="L. Andersson" initials="L." role="editor" surname="Andersson"/>
            <author fullname="E. Rosen" initials="E." role="editor" surname="Rosen"/>
            <date month="September" year="2006"/>
            <abstract>
              <t indent="0">This document provides a framework for Layer 2 Provider Provisioned Virtual Private Networks (L2VPNs). This framework is intended to aid in standardizing protocols and mechanisms to support interoperable L2VPNs. This memo provides information for the Internet community.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4664"/>
          <seriesInfo name="DOI" value="10.17487/RFC4664"/>
        </reference>
        <reference anchor="RFC4875" target="https://www.rfc-editor.org/info/rfc4875" quoteTitle="true" derivedAnchor="RFC4875">
          <front>
            <title>Extensions to Resource Reservation Protocol - Traffic Engineering (RSVP-TE) for Point-to-Multipoint TE Label Switched Paths (LSPs)</title>
            <author fullname="R. Aggarwal" initials="R." role="editor" surname="Aggarwal"/>
            <author fullname="D. Papadimitriou" initials="D." role="editor" surname="Papadimitriou"/>
            <author fullname="S. Yasukawa" initials="S." role="editor" surname="Yasukawa"/>
            <date month="May" year="2007"/>
            <abstract>
              <t indent="0">This document describes extensions to Resource Reservation Protocol - Traffic Engineering (RSVP-TE) for the set up of Traffic Engineered (TE) point-to-multipoint (P2MP) Label Switched Paths (LSPs) in Multi- Protocol Label Switching (MPLS) and Generalized MPLS (GMPLS) networks. The solution relies on RSVP-TE without requiring a multicast routing protocol in the Service Provider core. Protocol elements and procedures for this solution are described.</t>
              <t indent="0">There can be various applications for P2MP TE LSPs such as IP multicast. Specification of how such applications will use a P2MP TE LSP is outside the scope of this document. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4875"/>
          <seriesInfo name="DOI" value="10.17487/RFC4875"/>
        </reference>
        <reference anchor="RFC5036" target="https://www.rfc-editor.org/info/rfc5036" quoteTitle="true" derivedAnchor="RFC5036">
          <front>
            <title>LDP Specification</title>
            <author fullname="L. Andersson" initials="L." role="editor" surname="Andersson"/>
            <author fullname="I. Minei" initials="I." role="editor" surname="Minei"/>
            <author fullname="B. Thomas" initials="B." role="editor" surname="Thomas"/>
            <date month="October" year="2007"/>
            <abstract>
              <t indent="0">The architecture for Multiprotocol Label Switching (MPLS) is described in RFC 3031. A fundamental concept in MPLS is that two Label Switching Routers (LSRs) must agree on the meaning of the labels used to forward traffic between and through them. This common understanding is achieved by using a set of procedures, called a label distribution protocol, by which one LSR informs another of label bindings it has made. This document defines a set of such procedures called LDP (for Label Distribution Protocol) by which LSRs distribute labels to support MPLS forwarding along normally routed paths. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5036"/>
          <seriesInfo name="DOI" value="10.17487/RFC5036"/>
        </reference>
        <reference anchor="RFC5960" target="https://www.rfc-editor.org/info/rfc5960" quoteTitle="true" derivedAnchor="RFC5960">
          <front>
            <title>MPLS Transport Profile Data Plane Architecture</title>
            <author fullname="D. Frost" initials="D." role="editor" surname="Frost"/>
            <author fullname="S. Bryant" initials="S." role="editor" surname="Bryant"/>
            <author fullname="M. Bocci" initials="M." role="editor" surname="Bocci"/>
            <date month="August" year="2010"/>
            <abstract>
              <t indent="0">The Multiprotocol Label Switching Transport Profile (MPLS-TP) is the set of MPLS protocol functions applicable to the construction and operation of packet-switched transport networks. This document specifies the subset of these functions that comprises the MPLS-TP data plane: the architectural layer concerned with the encapsulation and forwarding of packets within an MPLS-TP network.</t>
              <t indent="0">This document is a product of a joint Internet Engineering Task Force (IETF) / International Telecommunication Union Telecommunication Standardization Sector (ITU-T) effort to include an MPLS Transport Profile within the IETF MPLS and Pseudowire Emulation Edge-to-Edge (PWE3) architectures to support the capabilities and functionalities of a packet transport network. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="5960"/>
          <seriesInfo name="DOI" value="10.17487/RFC5960"/>
        </reference>
        <reference anchor="RFC6020" target="https://www.rfc-editor.org/info/rfc6020" quoteTitle="true" derivedAnchor="RFC6020">
          <front>
            <title>YANG - A Data Modeling Language for the Network Configuration Protocol (NETCONF)</title>
            <author fullname="M. Bjorklund" initials="M." role="editor" surname="Bjorklund"/>
            <date month="October" year="2010"/>
            <abstract>
              <t indent="0">YANG is a data modeling language used to model configuration and state data manipulated by the Network Configuration Protocol (NETCONF), NETCONF remote procedure calls, and NETCONF notifications. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6020"/>
          <seriesInfo name="DOI" value="10.17487/RFC6020"/>
        </reference>
        <reference anchor="RFC6241" target="https://www.rfc-editor.org/info/rfc6241" quoteTitle="true" derivedAnchor="RFC6241">
          <front>
            <title>Network Configuration Protocol (NETCONF)</title>
            <author fullname="R. Enns" initials="R." role="editor" surname="Enns"/>
            <author fullname="M. Bjorklund" initials="M." role="editor" surname="Bjorklund"/>
            <author fullname="J. Schoenwaelder" initials="J." role="editor" surname="Schoenwaelder"/>
            <author fullname="A. Bierman" initials="A." role="editor" surname="Bierman"/>
            <date month="June" year="2011"/>
            <abstract>
              <t indent="0">The Network Configuration Protocol (NETCONF) defined in this document provides mechanisms to install, manipulate, and delete the configuration of network devices. It uses an Extensible Markup Language (XML)-based data encoding for the configuration data as well as the protocol messages. The NETCONF protocol operations are realized as remote procedure calls (RPCs). This document obsoletes RFC 4741. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6241"/>
          <seriesInfo name="DOI" value="10.17487/RFC6241"/>
        </reference>
        <reference anchor="RFC6632" target="https://www.rfc-editor.org/info/rfc6632" quoteTitle="true" derivedAnchor="RFC6632">
          <front>
            <title>An Overview of the IETF Network Management Standards</title>
            <author fullname="M. Ersue" initials="M." role="editor" surname="Ersue"/>
            <author fullname="B. Claise" initials="B." surname="Claise"/>
            <date month="June" year="2012"/>
            <abstract>
              <t indent="0">This document gives an overview of the IETF network management standards and summarizes existing and ongoing development of IETF Standards Track network management protocols and data models. The document refers to other overview documents, where they exist and classifies the standards for easy orientation. The purpose of this document is, on the one hand, to help system developers and users to select appropriate standard management protocols and data models to address relevant management needs. On the other hand, the document can be used as an overview and guideline by other Standard Development Organizations or bodies planning to use IETF management technologies and data models. This document does not cover Operations, Administration, and Maintenance (OAM) technologies on the data-path, e.g., OAM of tunnels, MPLS Transport Profile (MPLS-TP) OAM, and pseudowire as well as the corresponding management models. This document is not an Internet Standards Track specification; it is published for informational purposes.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6632"/>
          <seriesInfo name="DOI" value="10.17487/RFC6632"/>
        </reference>
        <reference anchor="RFC7426" target="https://www.rfc-editor.org/info/rfc7426" quoteTitle="true" derivedAnchor="RFC7426">
          <front>
            <title>Software-Defined Networking (SDN): Layers and Architecture Terminology</title>
            <author fullname="E. Haleplidis" initials="E." role="editor" surname="Haleplidis"/>
            <author fullname="K. Pentikousis" initials="K." role="editor" surname="Pentikousis"/>
            <author fullname="S. Denazis" initials="S." surname="Denazis"/>
            <author fullname="J. Hadi Salim" initials="J." surname="Hadi Salim"/>
            <author fullname="D. Meyer" initials="D." surname="Meyer"/>
            <author fullname="O. Koufopavlou" initials="O." surname="Koufopavlou"/>
            <date month="January" year="2015"/>
            <abstract>
              <t indent="0">Software-Defined Networking (SDN) refers to a new approach for network programmability, that is, the capacity to initialize, control, change, and manage network behavior dynamically via open interfaces. SDN emphasizes the role of software in running networks through the introduction of an abstraction for the data forwarding plane and, by doing so, separates it from the control plane. This separation allows faster innovation cycles at both planes as experience has already shown. However, there is increasing confusion as to what exactly SDN is, what the layer structure is in an SDN architecture, and how layers interface with each other. This document, a product of the IRTF Software-Defined Networking Research Group (SDNRG), addresses these questions and provides a concise reference for the SDN research community based on relevant peer-reviewed literature, the RFC series, and relevant documents by other standards organizations.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7426"/>
          <seriesInfo name="DOI" value="10.17487/RFC7426"/>
        </reference>
        <reference anchor="RFC7432" target="https://www.rfc-editor.org/info/rfc7432" quoteTitle="true" derivedAnchor="RFC7432">
          <front>
            <title>BGP MPLS-Based Ethernet VPN</title>
            <author fullname="A. Sajassi" initials="A." role="editor" surname="Sajassi"/>
            <author fullname="R. Aggarwal" initials="R." surname="Aggarwal"/>
            <author fullname="N. Bitar" initials="N." surname="Bitar"/>
            <author fullname="A. Isaac" initials="A." surname="Isaac"/>
            <author fullname="J. Uttaro" initials="J." surname="Uttaro"/>
            <author fullname="J. Drake" initials="J." surname="Drake"/>
            <author fullname="W. Henderickx" initials="W." surname="Henderickx"/>
            <date month="February" year="2015"/>
            <abstract>
              <t indent="0">This document describes procedures for BGP MPLS-based Ethernet VPNs (EVPN). The procedures described here meet the requirements specified in RFC 7209 -- "Requirements for Ethernet VPN (EVPN)".</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7432"/>
          <seriesInfo name="DOI" value="10.17487/RFC7432"/>
        </reference>
        <reference anchor="RFC7950" target="https://www.rfc-editor.org/info/rfc7950" quoteTitle="true" derivedAnchor="RFC7950">
          <front>
            <title>The YANG 1.1 Data Modeling Language</title>
            <author fullname="M. Bjorklund" initials="M." role="editor" surname="Bjorklund"/>
            <date month="August" year="2016"/>
            <abstract>
              <t indent="0">YANG is a data modeling language used to model configuration data, state data, Remote Procedure Calls, and notifications for network management protocols. This document describes the syntax and semantics of version 1.1 of the YANG language. YANG version 1.1 is a maintenance release of the YANG language, addressing ambiguities and defects in the original specification. There are a small number of backward incompatibilities from YANG version 1. This document also specifies the YANG mappings to the Network Configuration Protocol (NETCONF).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7950"/>
          <seriesInfo name="DOI" value="10.17487/RFC7950"/>
        </reference>
        <reference anchor="RFC8277" target="https://www.rfc-editor.org/info/rfc8277" quoteTitle="true" derivedAnchor="RFC8277">
          <front>
            <title>Using BGP to Bind MPLS Labels to Address Prefixes</title>
            <author fullname="E. Rosen" initials="E." surname="Rosen"/>
            <date month="October" year="2017"/>
            <abstract>
              <t indent="0">This document specifies a set of procedures for using BGP to advertise that a specified router has bound a specified MPLS label (or a specified sequence of MPLS labels organized as a contiguous part of a label stack) to a specified address prefix. This can be done by sending a BGP UPDATE message whose Network Layer Reachability Information field contains both the prefix and the MPLS label(s) and whose Next Hop field identifies the node at which said prefix is bound to said label(s). This document obsoletes RFC 3107.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8277"/>
          <seriesInfo name="DOI" value="10.17487/RFC8277"/>
        </reference>
        <reference anchor="RFC8283" target="https://www.rfc-editor.org/info/rfc8283" quoteTitle="true" derivedAnchor="RFC8283">
          <front>
            <title>An Architecture for Use of PCE and the PCE Communication Protocol (PCEP) in a Network with Central Control</title>
            <author fullname="A. Farrel" initials="A." role="editor" surname="Farrel"/>
            <author fullname="Q. Zhao" initials="Q." role="editor" surname="Zhao"/>
            <author fullname="Z. Li" initials="Z." surname="Li"/>
            <author fullname="C. Zhou" initials="C." surname="Zhou"/>
            <date month="December" year="2017"/>
            <abstract>
              <t indent="0">The Path Computation Element (PCE) is a core component of Software- Defined Networking (SDN) systems. It can compute optimal paths for traffic across a network and can also update the paths to reflect changes in the network or traffic demands.</t>
              <t indent="0">PCE was developed to derive paths for MPLS Label Switched Paths (LSPs), which are supplied to the head end of the LSP using the Path Computation Element Communication Protocol (PCEP).</t>
              <t indent="0">SDN has a broader applicability than signaled MPLS traffic-engineered (TE) networks, and the PCE may be used to determine paths in a range of use cases including static LSPs, segment routing, Service Function Chaining (SFC), and most forms of a routed or switched network. It is, therefore, reasonable to consider PCEP as a control protocol for use in these environments to allow the PCE to be fully enabled as a central controller.</t>
              <t indent="0">This document briefly introduces the architecture for PCE as a central controller, examines the motivations and applicability for PCEP as a control protocol in this environment, and introduces the implications for the protocol. A PCE-based central controller can simplify the processing of a distributed control plane by blending it with elements of SDN and without necessarily completely replacing it.</t>
              <t indent="0">This document does not describe use cases in detail and does not define protocol extensions: that work is left for other documents.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8283"/>
          <seriesInfo name="DOI" value="10.17487/RFC8283"/>
        </reference>
        <reference anchor="RFC8402" target="https://www.rfc-editor.org/info/rfc8402" quoteTitle="true" derivedAnchor="RFC8402">
          <front>
            <title>Segment Routing Architecture</title>
            <author fullname="C. Filsfils" initials="C." role="editor" surname="Filsfils"/>
            <author fullname="S. Previdi" initials="S." role="editor" surname="Previdi"/>
            <author fullname="L. Ginsberg" initials="L." surname="Ginsberg"/>
            <author fullname="B. Decraene" initials="B." surname="Decraene"/>
            <author fullname="S. Litkowski" initials="S." surname="Litkowski"/>
            <author fullname="R. Shakir" initials="R." surname="Shakir"/>
            <date month="July" year="2018"/>
            <abstract>
              <t indent="0">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.</t>
              <t indent="0">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.</t>
              <t indent="0">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.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8402"/>
          <seriesInfo name="DOI" value="10.17487/RFC8402"/>
        </reference>
        <reference anchor="RFC8660" target="https://www.rfc-editor.org/info/rfc8660" quoteTitle="true" derivedAnchor="RFC8660">
          <front>
            <title>Segment Routing with the MPLS Data Plane</title>
            <author fullname="A. Bashandy" initials="A." role="editor" surname="Bashandy"/>
            <author fullname="C. Filsfils" initials="C." role="editor" surname="Filsfils"/>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="B. Decraene" initials="B." surname="Decraene"/>
            <author fullname="S. Litkowski" initials="S." surname="Litkowski"/>
            <author fullname="R. Shakir" initials="R." surname="Shakir"/>
            <date month="December" year="2019"/>
            <abstract>
              <t indent="0">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).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8660"/>
          <seriesInfo name="DOI" value="10.17487/RFC8660"/>
        </reference>
        <reference anchor="RFC8754" target="https://www.rfc-editor.org/info/rfc8754" quoteTitle="true" derivedAnchor="RFC8754">
          <front>
            <title>IPv6 Segment Routing Header (SRH)</title>
            <author fullname="C. Filsfils" initials="C." role="editor" surname="Filsfils"/>
            <author fullname="D. Dukes" initials="D." role="editor" surname="Dukes"/>
            <author fullname="S. Previdi" initials="S." surname="Previdi"/>
            <author fullname="J. Leddy" initials="J." surname="Leddy"/>
            <author fullname="S. Matsushima" initials="S." surname="Matsushima"/>
            <author fullname="D. Voyer" initials="D." surname="Voyer"/>
            <date month="March" year="2020"/>
            <abstract>
              <t indent="0">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.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8754"/>
          <seriesInfo name="DOI" value="10.17487/RFC8754"/>
        </reference>
        <reference anchor="RFC8939" target="https://www.rfc-editor.org/info/rfc8939" quoteTitle="true" derivedAnchor="RFC8939">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane: IP</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="L. Berger" initials="L." surname="Berger"/>
            <author fullname="D. Fedyk" initials="D." surname="Fedyk"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <date month="November" year="2020"/>
            <abstract>
              <t indent="0">This document specifies the Deterministic Networking (DetNet) data plane operation for IP hosts and routers that provide DetNet service to IP-encapsulated data. No DetNet-specific encapsulation is defined to support IP flows; instead, the existing IP-layer and higher-layer protocol header information is used to support flow identification and DetNet service delivery. This document builds on the DetNet architecture (RFC 8655) and data plane framework (RFC 8938).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8939"/>
          <seriesInfo name="DOI" value="10.17487/RFC8939"/>
        </reference>
        <reference anchor="RFC8964" target="https://www.rfc-editor.org/info/rfc8964" quoteTitle="true" derivedAnchor="RFC8964">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane: MPLS</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="L. Berger" initials="L." surname="Berger"/>
            <author fullname="A. Malis" initials="A." surname="Malis"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <author fullname="J. Korhonen" initials="J." surname="Korhonen"/>
            <date month="January" year="2021"/>
            <abstract>
              <t indent="0">This document specifies the Deterministic Networking (DetNet) data plane when operating over an MPLS Packet Switched Network. It leverages existing pseudowire (PW) encapsulations and MPLS Traffic Engineering (MPLS-TE) encapsulations and mechanisms. This document builds on the DetNet architecture and data plane framework.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8964"/>
          <seriesInfo name="DOI" value="10.17487/RFC8964"/>
        </reference>
        <reference anchor="RFC8986" target="https://www.rfc-editor.org/info/rfc8986" quoteTitle="true" derivedAnchor="RFC8986">
          <front>
            <title>Segment Routing over IPv6 (SRv6) Network Programming</title>
            <author fullname="C. Filsfils" initials="C." role="editor" surname="Filsfils"/>
            <author fullname="P. Camarillo" initials="P." role="editor" surname="Camarillo"/>
            <author fullname="J. Leddy" initials="J." surname="Leddy"/>
            <author fullname="D. Voyer" initials="D." surname="Voyer"/>
            <author fullname="S. Matsushima" initials="S." surname="Matsushima"/>
            <author fullname="Z. Li" initials="Z." surname="Li"/>
            <date month="February" year="2021"/>
            <abstract>
              <t indent="0">The Segment Routing over IPv6 (SRv6) Network Programming framework enables a network operator or an application to specify a packet processing program by encoding a sequence of instructions in the IPv6 packet header.</t>
              <t indent="0">Each instruction is implemented on one or several nodes in the network and identified by an SRv6 Segment Identifier in the packet.</t>
              <t indent="0">This document defines the SRv6 Network Programming concept and specifies the base set of SRv6 behaviors that enables the creation of interoperable overlays with underlay optimization.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8986"/>
          <seriesInfo name="DOI" value="10.17487/RFC8986"/>
        </reference>
        <reference anchor="RFC9023" target="https://www.rfc-editor.org/info/rfc9023" quoteTitle="true" derivedAnchor="RFC9023">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane: IP over IEEE 802.1 Time-Sensitive Networking (TSN)</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="A. Malis" initials="A." surname="Malis"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <date month="June" year="2021"/>
            <abstract>
              <t indent="0">This document specifies the Deterministic Networking IP data plane when operating over a Time-Sensitive Networking (TSN) sub-network. This document does not define new procedures or processes. Whenever this document makes statements or recommendations, these are taken from normative text in the referenced RFCs.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9023"/>
          <seriesInfo name="DOI" value="10.17487/RFC9023"/>
        </reference>
        <reference anchor="RFC9024" target="https://www.rfc-editor.org/info/rfc9024" quoteTitle="true" derivedAnchor="RFC9024">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane: IEEE 802.1 Time-Sensitive Networking over MPLS</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="A. Malis" initials="A." surname="Malis"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <author fullname="D. Fedyk" initials="D." surname="Fedyk"/>
            <date month="June" year="2021"/>
            <abstract>
              <t indent="0">This document specifies the Deterministic Networking data plane when Time-Sensitive Networking (TSN) networks are interconnected over a DetNet MPLS network.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9024"/>
          <seriesInfo name="DOI" value="10.17487/RFC9024"/>
        </reference>
        <reference anchor="RFC9025" target="https://www.rfc-editor.org/info/rfc9025" quoteTitle="true" derivedAnchor="RFC9025">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane: MPLS over UDP/IP</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="L. Berger" initials="L." surname="Berger"/>
            <author fullname="A. Malis" initials="A." surname="Malis"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <date month="April" year="2021"/>
            <abstract>
              <t indent="0">This document specifies the MPLS Deterministic Networking (DetNet) data plane operation and encapsulation over an IP network. The approach is based on the operation of MPLS-over-UDP technology.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9025"/>
          <seriesInfo name="DOI" value="10.17487/RFC9025"/>
        </reference>
        <reference anchor="RFC9037" target="https://www.rfc-editor.org/info/rfc9037" quoteTitle="true" derivedAnchor="RFC9037">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane: MPLS over IEEE 802.1 Time-Sensitive Networking (TSN)</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="J. Farkas" initials="J." surname="Farkas"/>
            <author fullname="A. Malis" initials="A." surname="Malis"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <date month="June" year="2021"/>
            <abstract>
              <t indent="0">This document specifies the Deterministic Networking (DetNet) MPLS data plane when operating over an IEEE 802.1 Time-Sensitive Networking (TSN) sub-network. This document does not define new procedures or processes. Whenever this document makes statements or recommendations, they are taken from normative text in the referenced RFCs.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9037"/>
          <seriesInfo name="DOI" value="10.17487/RFC9037"/>
        </reference>
        <reference anchor="RFC9056" target="https://www.rfc-editor.org/info/rfc9056" quoteTitle="true" derivedAnchor="RFC9056">
          <front>
            <title>Deterministic Networking (DetNet) Data Plane: IP over MPLS</title>
            <author fullname="B. Varga" initials="B." role="editor" surname="Varga"/>
            <author fullname="L. Berger" initials="L." surname="Berger"/>
            <author fullname="D. Fedyk" initials="D." surname="Fedyk"/>
            <author fullname="S. Bryant" initials="S." surname="Bryant"/>
            <author fullname="J. Korhonen" initials="J." surname="Korhonen"/>
            <date month="October" year="2021"/>
            <abstract>
              <t indent="0">This document specifies the Deterministic Networking data plane when encapsulating IP over an MPLS packet-switched network.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9056"/>
          <seriesInfo name="DOI" value="10.17487/RFC9056"/>
        </reference>
        <reference anchor="RFC9197" target="https://www.rfc-editor.org/info/rfc9197" quoteTitle="true" derivedAnchor="RFC9197">
          <front>
            <title>Data Fields for In Situ Operations, Administration, and Maintenance (IOAM)</title>
            <author fullname="F. Brockners" initials="F." role="editor" surname="Brockners"/>
            <author fullname="S. Bhandari" initials="S." role="editor" surname="Bhandari"/>
            <author fullname="T. Mizrahi" initials="T." role="editor" surname="Mizrahi"/>
            <date month="May" year="2022"/>
            <abstract>
              <t indent="0">In situ Operations, Administration, and Maintenance (IOAM) collects operational and telemetry information in the packet while the packet traverses a path between two points in the network. This document discusses the data fields and associated data types for IOAM. IOAM-Data-Fields can be encapsulated into a variety of protocols, such as Network Service Header (NSH), Segment Routing, Generic Network Virtualization Encapsulation (Geneve), or IPv6. IOAM can be used to complement OAM mechanisms based on, e.g., ICMP or other types of probe packets.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9197"/>
          <seriesInfo name="DOI" value="10.17487/RFC9197"/>
        </reference>
        <reference anchor="RFC9320" target="https://www.rfc-editor.org/info/rfc9320" quoteTitle="true" derivedAnchor="RFC9320">
          <front>
            <title>Deterministic Networking (DetNet) Bounded Latency</title>
            <author fullname="N. Finn" initials="N." surname="Finn"/>
            <author fullname="J.-Y. Le Boudec" initials="J.-Y." surname="Le Boudec"/>
            <author fullname="E. Mohammadpour" initials="E." surname="Mohammadpour"/>
            <author fullname="J. Zhang" initials="J." surname="Zhang"/>
            <author fullname="B. Varga" initials="B." surname="Varga"/>
            <date month="November" year="2022"/>
            <abstract>
              <t indent="0">This document presents a timing model for sources, destinations, and Deterministic Networking (DetNet) transit nodes. Using the model, it provides a methodology to compute end-to-end latency and backlog bounds for various queuing methods. The methodology can be used by the management and control planes and by resource reservation algorithms to provide bounded latency and zero congestion loss for the DetNet service.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9320"/>
          <seriesInfo name="DOI" value="10.17487/RFC9320"/>
        </reference>
        <reference anchor="RFC9546" target="https://www.rfc-editor.org/info/rfc9546" quoteTitle="true" derivedAnchor="RFC9546">
          <front>
            <title>Operations, Administration, and Maintenance (OAM) for Deterministic Networking (DetNet) with the MPLS Data Plane</title>
            <author fullname="G. Mirsky" initials="G." surname="Mirsky"/>
            <author fullname="M. Chen" initials="M." surname="Chen"/>
            <author fullname="B. Varga" initials="B." surname="Varga"/>
            <date month="February" year="2024"/>
            <abstract>
              <t indent="0">This document defines format and usage principles of the Deterministic Networking (DetNet) service Associated Channel over a DetNet network with the MPLS data plane. The DetNet service Associated Channel can be used to carry test packets of active Operations, Administration, and Maintenance (OAM) protocols that are used to detect DetNet failures and measure performance metrics.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9546"/>
          <seriesInfo name="DOI" value="10.17487/RFC9546"/>
        </reference>
        <reference anchor="RFC9552" target="https://www.rfc-editor.org/info/rfc9552" quoteTitle="true" derivedAnchor="RFC9552">
          <front>
            <title>Distribution of Link-State and Traffic Engineering Information Using BGP</title>
            <author fullname="K. Talaulikar" initials="K." role="editor" surname="Talaulikar"/>
            <date month="December" year="2023"/>
            <abstract>
              <t indent="0">In many environments, a component external to a network is called upon to perform computations based on the network topology and the current state of the connections within the network, including Traffic Engineering (TE) information. This is information typically distributed by IGP routing protocols within the network.</t>
              <t indent="0">This document describes a mechanism by which link-state and TE information can be collected from networks and shared with external components using the BGP routing protocol. This is achieved using a BGP Network Layer Reachability Information (NLRI) encoding format. The mechanism applies to physical and virtual (e.g., tunnel) IGP links. The mechanism described is subject to policy control.</t>
              <t indent="0">Applications of this technique include Application-Layer Traffic Optimization (ALTO) servers and Path Computation Elements (PCEs).</t>
              <t indent="0">This document obsoletes RFC 7752 by completely replacing that document. It makes some small changes and clarifications to the previous specification. This document also obsoletes RFC 9029 by incorporating the updates that it made to RFC 7752.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9552"/>
          <seriesInfo name="DOI" value="10.17487/RFC9552"/>
        </reference>
        <reference anchor="RFC9633" target="https://www.rfc-editor.org/info/rfc9633" quoteTitle="true" derivedAnchor="RFC9633">
          <front>
            <title>Deterministic Networking (DetNet) YANG Data Model</title>
            <author fullname="X. Geng" initials="X." surname="Geng"/>
            <author fullname="Y. Ryoo" initials="Y." surname="Ryoo"/>
            <author fullname="D. Fedyk" initials="D." surname="Fedyk"/>
            <author fullname="R. Rahman" initials="R." surname="Rahman"/>
            <author fullname="Z. Li" initials="Z." surname="Li"/>
            <date month="October" year="2024"/>
            <abstract>
              <t indent="0">This document contains the specification for the Deterministic Networking (DetNet) YANG data model for configuration and operational data for DetNet flows. The model allows the provisioning of an end-to-end DetNet service on devices along the path without depending on any signaling protocol. It also specifies operational status for flows.</t>
              <t indent="0">The YANG module defined in this document conforms to the Network Management Datastore Architecture (NMDA).</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9633"/>
          <seriesInfo name="DOI" value="10.17487/RFC9633"/>
        </reference>
        <reference anchor="RFC9634" target="https://www.rfc-editor.org/info/rfc9634" quoteTitle="true" derivedAnchor="RFC9634">
          <front>
            <title>Operations, Administration, and Maintenance (OAM) for Deterministic Networking (DetNet) with the IP Data Plane</title>
            <author fullname="G. Mirsky" initials="G." surname="Mirsky"/>
            <author fullname="M. Chen" initials="M." surname="Chen"/>
            <author fullname="D. Black" initials="D." surname="Black"/>
            <date month="October" year="2024"/>
            <abstract>
              <t indent="0">This document discusses the use of existing IP Operations, Administration, and Maintenance protocols and mechanisms in Deterministic Networking networks that use the IP data plane.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="9634"/>
          <seriesInfo name="DOI" value="10.17487/RFC9634"/>
        </reference>
      </references>
    </references>
    <section anchor="acknowledgments" numbered="false" toc="include" removeInRFC="false" pn="section-appendix.a">
      <name slugifiedName="name-acknowledgments">Acknowledgments</name>
      <t indent="0" pn="section-appendix.a-1">Thanks to <contact fullname="Jim Guichard"/>, <contact fullname="Donald Eastlake 3rd"/>, and <contact fullname="Stewart Bryant"/>
      for their reviews and comments.</t>
      <t indent="0" pn="section-appendix.a-2">The authors would also like to thank <contact fullname="Deb Cooley"/>,
      <contact fullname="Mike Bishop"/>, <contact fullname="Mohamed       Boucadair"/>, <contact fullname="Gorry Fairhurst"/>, and <contact fullname="Dave Thaler"/> for their comments during the different
      directorate and IESG reviews.</t>
    </section>
    <section numbered="false" toc="include" removeInRFC="false" pn="section-appendix.b">
      <name slugifiedName="name-contributors">Contributors</name>
      <contact fullname="Fengwei Qin">
        <organization showOnFrontPage="true">China Mobile</organization>
        <address>
          <email>qinfengwei@chinamobile.com</email>
        </address>
      </contact>
    </section>
    <section anchor="authors-addresses" numbered="false" removeInRFC="false" toc="include" pn="section-appendix.c">
      <name slugifiedName="name-authors-addresses">Authors' Addresses</name>
      <author fullname="Andrew G. Malis" initials="A." surname="Malis">
        <organization showOnFrontPage="true">Independent</organization>
        <address>
          <email>agmalis@gmail.com</email>
        </address>
      </author>
      <author fullname="Xuesong Geng" initials="X." surname="Geng" role="editor">
        <organization showOnFrontPage="true">Huawei</organization>
        <address>
          <email>gengxuesong@huawei.com</email>
        </address>
      </author>
      <author fullname="Mach (Guoyi)Chen" initials="M." surname="(Guoyi)Chen">
        <organization showOnFrontPage="true">Huawei</organization>
        <address>
          <email>mach.chen@huawei.com</email>
        </address>
      </author>
      <author fullname="Balazs Varga" initials="B." surname="Varga">
        <organization showOnFrontPage="true">Ericsson</organization>
        <address>
          <email>balazs.a.varga@ericsson.com</email>
        </address>
      </author>
      <author fullname="Carlos J. Bernardos" initials="CJ." surname="Bernardos">
        <organization abbrev="UC3M" showOnFrontPage="true">Universidad Carlos III de Madrid</organization>
        <address>
          <postal>
            <street>Av. Universidad, 30</street>
            <city>Leganes, Madrid</city>
            <code>28911</code>
            <country>Spain</country>
          </postal>
          <phone>+34 91624 6236</phone>
          <email>cjbc@it.uc3m.es</email>
          <uri>http://www.it.uc3m.es/cjbc/</uri>
        </address>
      </author>
    </section>
  </back>
</rfc>
