<?xml version="1.0" encoding="US-ASCII"?>
<?xml-stylesheet type="text/xsl" href="rfc2629.xslt" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc2629 version 1.2.11 -->
<!DOCTYPE rfc SYSTEM "rfc2629.dtd">
<?rfc toc="yes"?>
<?rfc sortrefs="yes"?>
<?rfc symrefs="yes"?>
<rfc category="info" docName="draft-ietf-detnet-controller-plane-framework-07"
     ipr="trust200902">
  <front>
    <title abbrev="DetNet Controller Plane">Deterministic Networking (DetNet)
    Controller Plane Framework</title>

    <author fullname="Andrew G. Malis" initials="A." surname="Malis">
      <organization>Independent</organization>

      <address>
        <email>agmalis@gmail.com</email>
      </address>
    </author>

    <author fullname="Xuesong Geng" initials="X." surname="Geng, Ed.">
      <organization>Huawei</organization>

      <address>
        <email>gengxuesong@huawei.com</email>
      </address>
    </author>

    <author fullname="Mach (Guoyi) Chen" initials="M." surname="Chen">
      <organization>Huawei</organization>

      <address>
        <email>mach.chen@huawei.com</email>
      </address>
    </author>

    <author fullname="Balazs Varga" initials="B." surname="Varga">
      <organization>Ericsson</organization>

      <address>
        <email>balazs.a.varga@ericsson.com</email>
      </address>
    </author>

    <author fullname="Carlos J. Bernardos" initials="C." surname="Bernardos">
      <organization>Universidad Carlos III de Madrid</organization>

      <address>
        <postal>
          <street>Av. Universidad, 30</street>

          <city>28911 Leganes, Madrid</city>

          <region/>

          <code/>

          <country>Spain</country>
        </postal>

        <phone>+34 91624 6236</phone>

        <facsimile/>

        <email>cjbc@it.uc3m.es</email>

        <uri>http://www.it.uc3m.es/cjbc/</uri>
      </address>
    </author>

    <date day="5" month="July" year="2024"/>

    <abstract>
      <t>This document provides a framework overview for the Deterministic
      Networking (DetNet) controller plane. It discusses concepts and
      requirements for DetNet controller plane which could be basis for future
      solution specification.</t>
    </abstract>
  </front>

  <middle>
    <section anchor="introduction" title="Introduction">
      <t>Deterministic Networking (DetNet) provides the capability to carry
      specified unicast and/or multicast data flows for real-time applications
      with extremely low data loss rates and bounded latency within a network
      domain. As defined in <xref target="RFC8655"/>, techniques used to
      provide DetNet capability include reserving data plane resources for
      individual (or aggregated) DetNet flows in some or all of the
      intermediate nodes along the path of the flow, providing explicit routes
      for DetNet flows that do not immediately change with the network
      topology, and distributing data from DetNet flow packets over time
      and/or space to ensure delivery of each packet&rsquo;s data in spite of
      the loss of a path.</t>

      <t/>

      <t>DetNet data plane is defined in a set of documents that are anchored
      by the DetNet Data Plane Framework<xref target="RFC8938"/> (and the
      associated DetNet MPLS defined in <xref target="RFC8964"/> and DetNet IP
      defined in <xref target="RFC8939"/> and other data plane specifications
      defined in <xref target="RFC9023"/>, <xref target="RFC9024"/>, <xref
      target="RFC9025"/>, <xref target="RFC9037"/> and <xref
      target="RFC9056"/>)</t>

      <t>While the Detnet Architecture and Data Plane documents are primarily
      concerned with data plane operations, they do contain some requirements
      for functions that would be required in order to automate DetNet service
      provisioning and monitoring via a DetNet controller plane. The purpose
      of this document is to gather these requirements into a single document
      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.</t>

      <t>Note that in the DetNet overall architecture, the controller plane
      includes what are more traditionally considered separate control and
      management planes. Traditionally, the management plane is primarily
      involved with fault management, configuration management and performance
      management(sometimes accounting management and security management is
      also considered in the management plane, but not in the scope of this
      document). , while 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 Section 4.4.2 of <xref
      target="RFC8655"/> and the aggregation of Control and Management planes
      in <xref target="RFC7426"/> for further details.</t>

      <section anchor="terminology" title="Terminology">
        <t>This document uses the terminology established in the DetNet
        Architecture <xref target="RFC8655"/>, and the reader is assumed to be
        familiar with that document and its terminology.</t>

        <t>The key words &ldquo;MUST&rdquo;, &ldquo;MUST NOT&rdquo;,
        &ldquo;REQUIRED&rdquo;, &ldquo;SHALL&rdquo;, &ldquo;SHALL NOT&rdquo;,
        &ldquo;SHOULD&rdquo;, &ldquo;SHOULD NOT&rdquo;,
        &ldquo;RECOMMENDED&rdquo;, &ldquo;NOT RECOMMENDED&rdquo;,
        &ldquo;MAY&rdquo;, and &ldquo;OPTIONAL&rdquo; in this document are to
        be interpreted as described in BCP 14 <xref target="RFC2119"/> <xref
        target="RFC8174"/>when, and only when, they appear in all capitals, as
        shown here.</t>
      </section>
    </section>

    <section anchor="requirements"
             title="DetNet Controller Plane Requirements">
      <t>Other DetNet documents, including <xref target="RFC8655"/> and <xref
      target="RFC8938"/>, contain requirements for the Controller Plane. For
      convenience, these requirements have been compiled here. These
      requirements have been organized into 3 groups, including: requirements
      primarily applicable to control plane, requirements primarily applicable
      to management plane and requirements applicable to both planes.</t>

      <section anchor="detnet-control-plane-requirements"
               title="DetNet Control Plane Requirements">
        <t>The primary requirements for the DetNet Control Plane include:</t>

        <t><list style="symbols">
            <t>Support the dynamic creation, modification, and deletion of
            DetNet flows. This may include some or all of explicit path
            determination, link bandwidth reservations, restricting 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, ability to manage
            bidirectional flows, etc., as needed for a flow.</t>

            <t>Support DetNet flow aggregation and de-aggregation via the
            ability to dynamically create and delete flow aggregates (FAs),
            and be able to modify existing FAs by adding or deleting
            participating flows.</t>

            <t>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
            centralized SDN controller or distributed signaling protocols. See
            <xref target="control-plane-architecture"/> for further discussion
            of these options.</t>

            <t>In the case of the DetNet MPLS data plane, manage DetNet
            Service Label (S-Label), Forwarding Label (F-Label), and
            Aggregation Label (A-Label) <xref target="RFC8964"/> allocation
            and distribution.</t>

            <t>Also in the case of the DetNet MPLS data plane, support the
            DetNet service sub-layer, which provides DetNet service functions
            such as protection and reordering through the use of packet
            replication, duplicate elimination, and packet ordering functions
            (PREOF).</t>

            <t>Support queue control techniques defined in Section 4.5 of
            <xref target="RFC8655"/> and <xref target="RFC9320"/> that require
            time synchronization among network nodes.</t>

            <t>Advertise static and dynamic node and link resources such as
            capabilities and adjacencies to other network nodes (for dynamic
            signaling approaches) or to network controllers (for centralized
            approaches).</t>

            <t>Scale to handle the number of DetNet flows expected in a domain
            (which may require per-flow signaling or provisioning).</t>

            <t>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).</t>
          </list></t>
      </section>

      <section anchor="detnet-management-plane-requirements"
               title="DetNet Management Plane Requirements">
        <t>The primary requirements of the DetNet Management Plane are that it
        must be able to:</t>

        <t><list style="symbols">
            <t>Monitor the performance of DetNet flows and nodes to ensure
            that they are meeting required objectives, both proactively and
            on-demand.</t>

            <t>Support DetNet flow continuity check and connectivity
            verification functions.</t>

            <t>Support testing and monitoring of packet replication, duplicate
            elimination, and packet ordering functionality in the DetNet
            domain.</t>
          </list></t>
      </section>

      <section anchor="requirements-for-both-planes"
               title="Requirements For Both Planes">
        <t>The following requirements apply to both the DetNet Controller and
        Management Planes:</t>

        <t><list style="symbols">
            <t>Operate in a converged network domain that contains both DetNet
            and non-DetNet flows.</t>

            <t>Adapt to DetNet domain topology changes such as links or nodes
            failures (fault recovery/restoration), additions and removals.</t>
          </list></t>
      </section>
    </section>

    <section anchor="control-plane-architecture"
             title="DetNet Control Plane Architecture">
      <t>As noted in the Introduction, the DetNet control plane is responsible
      for the instantiation and maintenance of flows, 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>The following sections define three types of DetNet control plane
      architectures: a fully distributed control plane utilizing dynamic
      signaling protocols, a fully centralized SDN-like control plane, and 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>In each of the following sections, there are examples to 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"
               title="Distributed Control Plane and Signaling Protocols">
        <t>In a fully distributed configuration model, User-to-Network
        Interface (UNI) information is transmitted over a DetNet UNI protocol
        from the user side to the network side.Then UNI and network
        configuration information propagate in the network via distributed
        control plane signaling protocols. Such a DetNet UNI protocol is not
        necessary in case that the End-systems are DetNet capable.</t>

        <t>Taking an RSVP-TE MPLS network as an example, where end systems are
        not part of the DetNet domain:</t>

        <t><list style="numbers">
            <t>Network nodes collects topology information and DetNet
            capabilities of the network nodes through IGP;</t>

            <t>Ingress edge node receives a flow establishment request from
            the UNI and calculates one or more valid path(s);</t>

            <t>The ingress node sends a PATH message with an explicit route
            through RSVP-TE <xref target="RFC3209"/>. After receiving the PATH
            message, the egress edge node sends a RESV message with the
            distributed label and resource reservation request.</t>
          </list>In this example, both IGP and RSVT-TE may request extensions
        for DetNet.</t>
      </section>

      <section anchor="sdnfully-centralized-control-plane"
               title="SDN/Fully Centralized Control Plane">
        <t>In the fully SDN/centralized configuration model, flow/UNI
        information is transmitted from a Centralized User Controller or from
        applications via an API/ northbound interface to a Centralized
        Controlle. Network node configurations for DetNet flows are performed
        by the controller using a protocol such as NETCONF <xref
        target="RFC6241"/>/YANG <xref target="RFC6020"/> or PCE-CC <xref
        target="RFC8283"/>.</t>

        <t>Take the following case as an example::</t>

        <t><list style="numbers">
            <t>A Centralized Controller collects topology information and
            DetNet capabilities of the network nodes via NETCONF/YANG;</t>

            <t>The Controller receives a flow establishment request from a UNI
            and calculates one or more valid path(s) through the network;</t>

            <t>The Controller chooses the optimal path and configures the
            devices along that path for DetNet flow transmission via
            PCE-CC.</t>
          </list></t>

        <t>Protocols in the above example may require extensions for
        DetNet.</t>
      </section>

      <section anchor="combined-control-plane-partly-centralized-partly-distributed"
               title="Hybrid Control Plane (partly centralized, partly distributed)">
        <t>In the hybrid model, controller and control plane protocols work
        together to provide DetNet services, and there are a number of
        possible combinations.</t>

        <t>In the following case, RSVP-TE and controller are used
        together:</t>

        <t><list style="numbers">
            <t>Controller collects topology information and DetNet
            capabilities of the network nodes via an IGP and/or BGP-LS <xref
            target="RFC7752"/>;</t>

            <t>Controller receives a flow establishment request through API
            and calculates one or more valid path(s) through the network ;</t>

            <t>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>

            <t>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>
          </list></t>

        <t>There are many other variations that could be included in a hybrid
        control plane. The requested DetNet extensions for protocol in each
        possible case is for future work.</t>
      </section>
    </section>

    <section anchor="detnet-control-plane-additional-details-and-issues"
             title="DetNet Control Plane for DetNet Mechanisms">
      <t>This section discusses requested control plane features for DetNet
      mechanisms as defined in <xref target="RFC8655"/>, including explicit
      path, resource reservation, service protection(PREOF). Different DetNet
      service may implement part/all of them based on the requirements.</t>

      <section anchor="explicit-paths" title="Explicit Paths">
        <t>Explicit paths are required in DetNet to provide a stable
        forwarding service and guarantee that DetNet service is not impacted
        when the network topology changes. The following features are
        necessary in control plane to implement explicit paths in DetNet:</t>

        <t><list style="symbols">
            <t>Path computation: DetNet explicit paths need to meet the SLA
            (Service Level Agreement) 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, IGP with CSPF (Constrained Shortest Path First) may be
            used to compute a set of feasible paths for a DetNet service. In a
            centralized network system, controller can compute paths
            satisfying the requirements of DetNet based on the network
            information collected from the DetNet domain.</t>

            <t>Path establishment: The computed path for the DetNet service
            has to be sent/configured/signaled to the network device, so the
            corresponding DetNet flow could pass through the network domain
            following the specified path.</t>
          </list></t>
      </section>

      <section anchor="resource-reservation" title="Resource Reservation">
        <t>DetNet flows are supposed to be protected from congestion, so
        sufficient resource reservation for DetNet service could protect
        service from congestion. There are multiple types of resources in the
        network that could be allocated to DetNet flows, e.g., packet
        processing resource, buffer resource, and bandwidth of the output
        port. The network resource requested by a specified DetNet service is
        determined by the SLA requirements and network capability.</t>

        <t><list style="symbols">
            <t>Resource Allocation: Port bandwidth is one of the basic
            attributes of a network device which is easy to obtain or
            calculate. In current traffic engineering implementations, network
            resource allocation is synonymous with bandwidth allocation. A
            DetNet flow is characterized with a traffic specification as
            defined in <xref target="RFC9016"/>, including attributes such as
            Interval, Maximum Packets Per Interval, and Maximum Payload Size.
            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 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 packet
            replication, duplicate elimination, and packet ordering functions
            (PREOF).</t>

            <t>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 maintains a
            mapping relationship between a DetNet flow and its corresponding
            resources.</t>
          </list></t>
      </section>

      <section anchor="preof-support" title="PREOF Support">
        <t>DetNet path redundancy is supported via packet replication,
        duplicate elimination, and packet ordering functions (PREOF). A DetNet
        flow is replicated and goes through 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 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 (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 &ldquo;LSP graph&rdquo;
        in case of DetNet MPLS data plane).</t>
      </section>

      <section anchor="dp-specific" title="Data Plane specific considerations">
        <section anchor="traditional-mpls" title="DetNet in an MPLS Domain">
          <t>For the purposes of this document, &ldquo;traditional MPLS&rdquo;
          is defined as MPLS without the use of segment routing (see <xref
          target="SR"/> for a discussion of MPLS with segment routing) or
          MPLS-TP <xref target="RFC5960"/>.</t>

          <t>In traditional 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"/>, RSVP-TE, and BGP
          <xref target="RFC8277"/> (which enables BGP/MPLS-based Layer 3 VPNs
          <xref target="RFC4384"/> and Layer 2 VPNs <xref
          target="RFC7432"/>).</t>

          <t>Any of these protocols could be used to distribute DetNet Service
          Labels (S-Labels) and Aggregation Labels (A-Labels) <xref
          target="RFC8964"/>. As discussed in <xref target="RFC8938"/>,
          S-Labels are similar to other MPLS service labels, such as
          pseudowire, 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>

          <t>However, as discussed in <xref
          target="distributed-control-plane"/>, distributed signaling
          protocols may have difficulty meeting DetNet&rsquo;s scalability
          requirements. MPLS also allows SDN-like centralized label management
          and distribution as an alternative to distributed signaling
          protocols, using protocols such as PCEP and OpenFlow <xref
          target="OPENFLOW"/>.</t>

          <t>PCEP, particularly when used as a part of PCE-CC, is a possible
          candidate protocol to use for centralized management of traditional
          MPLS-based DetNet domains. However, PCE path calculation algorithms
          would need to be extended to include the location determination for
          PREOF nodes in a path, and the means to signal the necessary
          resource reservation and PREOF function placement information to
          network nodes. See
          ((?I-D.ietf-pce-pcep-extension-for-pce-controller)) for further
          discussion of PCE-CC and PCEP for centralized control of an MPLS
          domain.</t>
        </section>

        <section anchor="detnet-in-an-ip-domain"
                 title="DetNet in an IP Domain">
          <t>For the purposes of this document, &ldquo;traditional IP&rdquo;
          is defined as IP without the use of segment routing (see <xref
          target="SR"/> for a discussion of IP with segment routing). In a
          later revision of this document, this section will discuss possible
          protocol extensions to existing IP routing protocols such as OSPF,
          IS-IS, and BGP. It should be noted that a DetNet IP data plane <xref
          target="RFC8939"/> is simpler than a DetNet MPLS data plane <xref
          target="RFC8964"/>, and doesn&rsquo;t support PREOF, so only one
          path per flow or flow aggregate is required.</t>
        </section>

        <section anchor="SR" title="DetNet in a Segment Routing Domain">
          <t>Segment Routing <xref target="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 policy to network
          edge nodes for use in packet headers. As such, segment routing can
          be considered as a new data plane for both MPLS and IP. It 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 traditional 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. However, further analysis is
          needed on the expected gain, as DetNet flows may require various
          type of DetNet specific resources as well.</t>

          <t>In a later revision of this document, this section will discuss
          the impact of DetNet on the Segment Routing Control and Management
          planes. Note that the DetNet MPLS and IP data planes described in
          <xref target="RFC8964"/> and <xref target="RFC8939"/> were
          constructed to be compatible with both types of segment routing,
          SR-MPLS <xref target="RFC8660"/> and SRv6 <xref target="RFC8754"/>.
          However, as of this writing, traffic engineering and resource
          reservation for segment routing are currently unsolved problems.</t>

          <t>Editor&rsquo;s note: this section may be collapsed to previous
          sections and listing MPLS segment routing in the MPLS section as one
          of the possible explicit routing techniques for MPLS, and do the
          same for IP.</t>
        </section>
      </section>
    </section>

    <section anchor="management-plane-overview"
             title="Management Plane Overview">
      <t>The Management Plane includes the ability to statically provision
      network nodes and to use OAM to monitor DetNet performance and detect
      outages or other issues at the DetNet layer.</t>

      <section anchor="provisioning" title="Provisioning">
        <t>Static provisioning in a Detnet network nodes will be performed via
        the use of appropriate YANG models, including <xref
        target="I-D.ietf-detnet-yang"/> and <xref
        target="I-D.ietf-detnet-topology-yang"/>.</t>
      </section>

      <section anchor="detnet-operations-administration-and-maintenance-oam"
               title="DetNet Operations, Administration and Maintenance (OAM)">
        <t>This document covers the general considerations for OAM.</t>

        <t/>

        <section anchor="oam-for-performance-monitoring-pm"
                 title="OAM for Performance Monitoring (PM)">
          <section anchor="active-pm" title="Active PM">
            <t>Active PM is performed by injecting OAM packets into the
            network to estimate the performance of the network by measuring
            the performance of the 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" title="Passive PM">
            <t>Passive PM monitors the actual service traffic in a network
            domain in order to measure its performance without having a
            detrimental affect 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"
                 title="OAM for Connectivity and Fault/Defect Management (CFM)">
          <t>The detailed requirements for connectivity and fault/defect
          detection and management in DetNet IP domain and DetNet MPLS domain
          are defined in respectively in <xref
          target="I-D.ietf-detnet-ip-oam"/> and <xref
          target="I-D.ietf-detnet-mpls-oam"/>.</t>
        </section>
      </section>
    </section>

    <section title="Multidomain Aspects">
      <t> When there are multiple domains involved, one or multiple controller
      plane functions (CFP) would have to collaborate to implement the
      requests received from the flow management entity (FME, as defined in
      <xref target="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, authenticate and
      negotiate per-hop behaviors. Furthermore, in case of wireless domains,
      the per-domain RAW specific functions like the PLRs have to be also
      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>

      <t/>
    </section>

    <section anchor="gap-analysis" title="Gap Analysis">
      <t>In a later revision of this document, this section will contain a gap
      analysis of existing IETF control and management plane protocols not
      already discussed elsewhere in this document for their ability (or
      inability) to satisfy the requirements in <xref target="requirements"/>,
      and discuss possible protocol extensions to existing protocols to fill
      the gaps, if any.</t>
    </section>

    <section anchor="iana-considerations" title="IANA Considerations">
      <t>This document has no actions for IANA.</t>

      <t>Note to RFC Editor: this section may be removed on publication as an
      RFC.</t>
    </section>

    <section anchor="security-considerations" title="Security Considerations">
      <t>Editor's note: This section needs more details.</t>

      <t>The overall security considerations of DetNet are discussed in <xref
      target="RFC8655"/> and <xref target="I-D.ietf-detnet-security"/>. For
      DetNet networks that make use of Segment Routing (whether SR-MPLS or
      SRv6), the security considerations in <xref target="RFC8402"/> also
      apply.</t>

      <t>DetNet networks that make use of a centralized controller plane may
      be threatened by the loss of connectivity (whether accidental or
      malicious) between the central controller and the network nodes, and/or
      the spoofing of control messages from the controller to the network
      nodes. This is important since such networks depend on centralized
      controllers to calculate flow paths and instantiate flow state in the
      network nodes. For networks that use both DetNet and Segment Routing
      with a centralized controller, this would also include the calculation
      of SID lists and their installation in edge/border routers.</t>

      <t>In both cases, such threats may be mitigated through redundant
      controllers, the use of authentication between the controller(s) and the
      network nodes, and other mechanisms for protection against DOS attacks.
      A mechanism for supporting one or more alternative central controllers
      and the ability to fail over to such an alternative controller will be
      required.</t>
    </section>

    <section anchor="acknowledgments" title="Acknowledgments">
      <t>Thanks to Jim Guichard, Donald Eastlake, and Stewart Bryant for their
      review comments.</t>
    </section>

    <section title="Contributors">
      <t>Fengwei Qin</t>

      <t>China Mobile</t>

      <t>Email: qinfengwei@chinamobile.com</t>
    </section>
  </middle>

  <back>
    <references title="Normative References">
      <reference anchor="RFC8655"
                 target="https://www.rfc-editor.org/info/rfc8655">
        <front>
          <title>Deterministic Networking Architecture</title>

          <author fullname="N. Finn" initials="N." surname="Finn">
            <organization/>
          </author>

          <author fullname="P. Thubert" initials="P." surname="Thubert">
            <organization/>
          </author>

          <author fullname="B. Varga" initials="B." surname="Varga">
            <organization/>
          </author>

          <author fullname="J. Farkas" initials="J." surname="Farkas">
            <organization/>
          </author>

          <date month="October" year="2019"/>

          <abstract>
            <t>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="RFC7426"
                 target="https://www.rfc-editor.org/info/rfc7426">
        <front>
          <title>Software-Defined Networking (SDN): Layers and Architecture
          Terminology</title>

          <author fullname="E. Haleplidis" initials="E." role="editor"
                  surname="Haleplidis">
            <organization/>
          </author>

          <author fullname="K. Pentikousis" initials="K." role="editor"
                  surname="Pentikousis">
            <organization/>
          </author>

          <author fullname="S. Denazis" initials="S." surname="Denazis">
            <organization/>
          </author>

          <author fullname="J. Hadi Salim" initials="J." surname="Hadi Salim">
            <organization/>
          </author>

          <author fullname="D. Meyer" initials="D." surname="Meyer">
            <organization/>
          </author>

          <author fullname="O. Koufopavlou" initials="O."
                  surname="Koufopavlou">
            <organization/>
          </author>

          <date month="January" year="2015"/>

          <abstract>
            <t>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="RFC2119"
                 target="https://www.rfc-editor.org/info/rfc2119">
        <front>
          <title>Key words for use in RFCs to Indicate Requirement
          Levels</title>

          <author fullname="S. Bradner" initials="S." surname="Bradner">
            <organization/>
          </author>

          <date month="March" year="1997"/>

          <abstract>
            <t>In many standards track documents several words are used to
            signify the requirements in the specification. These words are
            often capitalized. This document defines these words as they
            should be interpreted in IETF documents. This document specifies
            an Internet Best Current Practices for the Internet Community, and
            requests discussion and suggestions for improvements.</t>
          </abstract>
        </front>

        <seriesInfo name="BCP" value="14"/>

        <seriesInfo name="RFC" value="2119"/>

        <seriesInfo name="DOI" value="10.17487/RFC2119"/>
      </reference>

      <reference anchor="I-D.ietf-detnet-flow-information-model">
        <front>
          <title>DetNet Flow Information Model</title>

          <author fullname="Balazs Varga" initials="B" surname="Varga">
            <organization/>
          </author>

          <author fullname="Janos Farkas" initials="J" surname="Farkas">
            <organization/>
          </author>

          <author fullname="Rodney Cummings" initials="R" surname="Cummings">
            <organization/>
          </author>

          <author fullname="Yuanlong Jiang" initials="Y" surname="Jiang">
            <organization/>
          </author>

          <author fullname="Don Fedyk" initials="D" surname="Fedyk">
            <organization/>
          </author>

          <date day="15" month="May" year="2020"/>

          <abstract>
            <t>This document describes 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="Internet-Draft"
                    value="draft-ietf-detnet-flow-information-model-10"/>

        <format target="http://www.ietf.org/internet-drafts/draft-ietf-detnet-flow-information-model-10.txt"
                type="TXT"/>
      </reference>

      <reference anchor="RFC8402"
                 target="https://www.rfc-editor.org/info/rfc8402">
        <front>
          <title>Segment Routing Architecture</title>

          <author fullname="C. Filsfils" initials="C." role="editor"
                  surname="Filsfils">
            <organization/>
          </author>

          <author fullname="S. Previdi" initials="S." role="editor"
                  surname="Previdi">
            <organization/>
          </author>

          <author fullname="L. Ginsberg" initials="L." surname="Ginsberg">
            <organization/>
          </author>

          <author fullname="B. Decraene" initials="B." surname="Decraene">
            <organization/>
          </author>

          <author fullname="S. Litkowski" initials="S." surname="Litkowski">
            <organization/>
          </author>

          <author fullname="R. Shakir" initials="R." surname="Shakir">
            <organization/>
          </author>

          <date month="July" year="2018"/>

          <abstract>
            <t>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>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>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="I-D.ietf-detnet-security">
        <front>
          <title>Deterministic Networking (DetNet) Security
          Considerations</title>

          <author fullname="Tal Mizrahi" initials="T" surname="Mizrahi">
            <organization/>
          </author>

          <author fullname="Ethan Grossman" initials="E" surname="Grossman">
            <organization/>
          </author>

          <date day="30" month="May" year="2020"/>

          <abstract>
            <t>A DetNet (deterministic network) provides specific performance
            guarantees to its data flows, such as extremely low data loss
            rates and bounded latency. As a result, securing a DetNet implies
            that in addition to the best practice security measures taken for
            any mission-critical network, additional security measures may be
            needed whose purpose is exclusively to secure the intended
            operation of these novel service properties. Designers of DetNet
            components (such as routers) that provide these unique DetNet
            properties have the responsibility to uphold certain
            security-related properties that can be assumed by DetNet system-
            level designers. For example, the assumption that network traffic
            associated with a given flow can never affect traffic associated
            with a different flow is only true if the underlying components
            make it so. This document addresses DetNet-specific security
            considerations from the perspective of both the DetNet component
            designer and the DetNet system-level designer. It is assumed that
            both classes of reader are already familiar with network security
            best practices for the data plane technologies underlying a given
            DetNet implementation. Component-level considerations include
            isolation of data flows from each other, ingress filtering, and
            detection and reporting of packet arrival time violations.
            System-level considerations include a threat model and a taxonomy
            of relevant attacks, including their potential impacts and
            mitigations. A given DetNet may require securing only certain
            aspects of DetNet performance, for example extremely low data loss
            rates but not necessarily bounded latency. Therefore this document
            provides an association of threats against various use cases by
            industry, and also against the individual service properties as
            defined in the DetNet Use Cases. This document also addresses
            common DetNet security considerations related to the IP and MPLS
            data plane technologies (the first to be identified as supported
            by DetNet), thereby complementing the Security Considerations
            sections of the various DetNet Data Plane (and other) DetNet
            documents.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-ietf-detnet-security-10"/>

        <format target="http://www.ietf.org/internet-drafts/draft-ietf-detnet-security-10.txt"
                type="TXT"/>
      </reference>

      <reference anchor="RFC8174">
        <front>
          <title/>

          <author>
            <organization/>
          </author>

          <date/>
        </front>
      </reference>

      <?rfc include='reference.I-D.ietf-detnet-ip-oam'?>

      <?rfc include='reference.I-D.ietf-detnet-mpls-oam'?>

      <?rfc include='reference.RFC.8964'?>

      <?rfc include='reference.RFC.8939'?>

      <?rfc include='reference.RFC.9056'?>

      <?rfc include='reference.RFC.9025'?>

      <?rfc include='reference.RFC.9037'?>

      <?rfc include='reference.RFC.9023'?>

      <?rfc include='reference.RFC.9024'?>

      <?rfc include='reference.RFC.8938'?>

      <?rfc include='reference.RFC.9016'?>

      <?rfc include='reference.RFC.9320'?>
    </references>

    <references title="Informative References">
      <reference anchor="OPENFLOW"
                 target="https://www.opennetworking.org/wp-content/uploads/2014/10/openflow-switch-v1.5.1.pdf">
        <front>
          <title>OpenFlow Switch Specification, Version 1.5.1 (Protocol
          version 0x06)</title>

          <author>
            <organization>Open Networking Foundation</organization>
          </author>

          <date month="March" year="2015"/>
        </front>

        <seriesInfo name="ONF" value="TS-025"/>
      </reference>

      <reference anchor="RFC3209"
                 target="https://www.rfc-editor.org/info/rfc3209">
        <front>
          <title>RSVP-TE: Extensions to RSVP for LSP Tunnels</title>

          <author fullname="D. Awduche" initials="D." surname="Awduche">
            <organization/>
          </author>

          <author fullname="L. Berger" initials="L." surname="Berger">
            <organization/>
          </author>

          <author fullname="D. Gan" initials="D." surname="Gan">
            <organization/>
          </author>

          <author fullname="T. Li" initials="T." surname="Li">
            <organization/>
          </author>

          <author fullname="V. Srinivasan" initials="V." surname="Srinivasan">
            <organization/>
          </author>

          <author fullname="G. Swallow" initials="G." surname="Swallow">
            <organization/>
          </author>

          <date month="December" year="2001"/>

          <abstract>
            <t>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="IEEE.802.1QBV_2015"
                 target="http://ieeexplore.ieee.org/servlet/opac?punumber=7572858">
        <front>
          <title>IEEE Standard for Local and metropolitan area networks --
          Bridges and Bridged Networks - Amendment 25: Enhancements for
          Scheduled Traffic</title>

          <author>
            <organization>IEEE</organization>
          </author>

          <date day="18" month="March" year="2016"/>

          <abstract>
            <t>Enhancements to the forwarding process that supports scheduled
            traffic is provided in this amendment to IEEE Std 802.1Q-2014.</t>
          </abstract>
        </front>

        <seriesInfo name="IEEE" value="802.1Qbv-2015"/>

        <seriesInfo name="DOI" value="10.1109/IEEESTD.2016.7572858"/>
      </reference>

      <reference anchor="RFC5439"
                 target="https://www.rfc-editor.org/info/rfc5439">
        <front>
          <title>An Analysis of Scaling Issues in MPLS-TE Core
          Networks</title>

          <author fullname="S. Yasukawa" initials="S." surname="Yasukawa">
            <organization/>
          </author>

          <author fullname="A. Farrel" initials="A." surname="Farrel">
            <organization/>
          </author>

          <author fullname="O. Komolafe" initials="O." surname="Komolafe">
            <organization/>
          </author>

          <date month="February" year="2009"/>

          <abstract>
            <t>Traffic engineered Multiprotocol Label Switching (MPLS-TE) is
            deployed in providers' core networks. As providers plan to grow
            these networks, they need to understand whether existing protocols
            and implementations can support the network sizes that they are
            planning.</t>

            <t>This document presents an analysis of some of the scaling
            concerns for the number of Label Switching Paths (LSPs) in MPLS-TE
            core networks, and examines the value of two techniques (LSP
            hierarchies and multipoint-to-point LSPs) for improving scaling.
            The intention is to motivate the development of appropriate
            deployment techniques and protocol extensions to enable the
            application of MPLS-TE in large networks.</t>

            <t>This document only considers the question of achieving
            scalability for the support of point-to-point MPLS-TE LSPs.
            Point-to-multipoint MPLS-TE LSPs are for future study. This memo
            provides information for the Internet community.</t>
          </abstract>
        </front>

        <seriesInfo name="RFC" value="5439"/>

        <seriesInfo name="DOI" value="10.17487/RFC5439"/>
      </reference>

      <reference anchor="RFC6241"
                 target="https://www.rfc-editor.org/info/rfc6241">
        <front>
          <title>Network Configuration Protocol (NETCONF)</title>

          <author fullname="R. Enns" initials="R." role="editor"
                  surname="Enns">
            <organization/>
          </author>

          <author fullname="M. Bjorklund" initials="M." role="editor"
                  surname="Bjorklund">
            <organization/>
          </author>

          <author fullname="J. Schoenwaelder" initials="J." role="editor"
                  surname="Schoenwaelder">
            <organization/>
          </author>

          <author fullname="A. Bierman" initials="A." role="editor"
                  surname="Bierman">
            <organization/>
          </author>

          <date month="June" year="2011"/>

          <abstract>
            <t>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="RFC6020"
                 target="https://www.rfc-editor.org/info/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">
            <organization/>
          </author>

          <date month="October" year="2010"/>

          <abstract>
            <t>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="RFC8283"
                 target="https://www.rfc-editor.org/info/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">
            <organization/>
          </author>

          <author fullname="Q. Zhao" initials="Q." role="editor"
                  surname="Zhao">
            <organization/>
          </author>

          <author fullname="Z. Li" initials="Z." surname="Li">
            <organization/>
          </author>

          <author fullname="C. Zhou" initials="C." surname="Zhou">
            <organization/>
          </author>

          <date month="December" year="2017"/>

          <abstract>
            <t>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>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>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>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>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="RFC7752"
                 target="https://www.rfc-editor.org/info/rfc7752">
        <front>
          <title>North-Bound Distribution of Link-State and Traffic
          Engineering (TE) Information Using BGP</title>

          <author fullname="H. Gredler" initials="H." role="editor"
                  surname="Gredler">
            <organization/>
          </author>

          <author fullname="J. Medved" initials="J." surname="Medved">
            <organization/>
          </author>

          <author fullname="S. Previdi" initials="S." surname="Previdi">
            <organization/>
          </author>

          <author fullname="A. Farrel" initials="A." surname="Farrel">
            <organization/>
          </author>

          <author fullname="S. Ray" initials="S." surname="Ray">
            <organization/>
          </author>

          <date month="March" year="2016"/>

          <abstract>
            <t>In a number of environments, a component external to a network
            is called upon to perform computations based on the network
            topology and 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>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 new BGP Network Layer Reachability Information
            (NLRI) encoding format. The mechanism is applicable to physical
            and virtual IGP links. The mechanism described is subject to
            policy control.</t>

            <t>Applications of this technique include Application-Layer
            Traffic Optimization (ALTO) servers and Path Computation Elements
            (PCEs).</t>
          </abstract>
        </front>

        <seriesInfo name="RFC" value="7752"/>

        <seriesInfo name="DOI" value="10.17487/RFC7752"/>
      </reference>

      <reference anchor="RFC5960"
                 target="https://www.rfc-editor.org/info/rfc5960">
        <front>
          <title>MPLS Transport Profile Data Plane Architecture</title>

          <author fullname="D. Frost" initials="D." role="editor"
                  surname="Frost">
            <organization/>
          </author>

          <author fullname="S. Bryant" initials="S." role="editor"
                  surname="Bryant">
            <organization/>
          </author>

          <author fullname="M. Bocci" initials="M." role="editor"
                  surname="Bocci">
            <organization/>
          </author>

          <date month="August" year="2010"/>

          <abstract>
            <t>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>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="RFC5036"
                 target="https://www.rfc-editor.org/info/rfc5036">
        <front>
          <title>LDP Specification</title>

          <author fullname="L. Andersson" initials="L." role="editor"
                  surname="Andersson">
            <organization/>
          </author>

          <author fullname="I. Minei" initials="I." role="editor"
                  surname="Minei">
            <organization/>
          </author>

          <author fullname="B. Thomas" initials="B." role="editor"
                  surname="Thomas">
            <organization/>
          </author>

          <date month="October" year="2007"/>

          <abstract>
            <t>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="RFC8277"
                 target="https://www.rfc-editor.org/info/rfc8277">
        <front>
          <title>Using BGP to Bind MPLS Labels to Address Prefixes</title>

          <author fullname="E. Rosen" initials="E." surname="Rosen">
            <organization/>
          </author>

          <date month="October" year="2017"/>

          <abstract>
            <t>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="RFC4384"
                 target="https://www.rfc-editor.org/info/rfc4384">
        <front>
          <title>BGP Communities for Data Collection</title>

          <author fullname="D. Meyer" initials="D." surname="Meyer">
            <organization/>
          </author>

          <date month="February" year="2006"/>

          <abstract>
            <t>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="RFC7432"
                 target="https://www.rfc-editor.org/info/rfc7432">
        <front>
          <title>BGP MPLS-Based Ethernet VPN</title>

          <author fullname="A. Sajassi" initials="A." role="editor"
                  surname="Sajassi">
            <organization/>
          </author>

          <author fullname="R. Aggarwal" initials="R." surname="Aggarwal">
            <organization/>
          </author>

          <author fullname="N. Bitar" initials="N." surname="Bitar">
            <organization/>
          </author>

          <author fullname="A. Isaac" initials="A." surname="Isaac">
            <organization/>
          </author>

          <author fullname="J. Uttaro" initials="J." surname="Uttaro">
            <organization/>
          </author>

          <author fullname="J. Drake" initials="J." surname="Drake">
            <organization/>
          </author>

          <author fullname="W. Henderickx" initials="W." surname="Henderickx">
            <organization/>
          </author>

          <date month="February" year="2015"/>

          <abstract>
            <t>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="RFC8660"
                 target="https://www.rfc-editor.org/info/rfc8660">
        <front>
          <title>Segment Routing with the MPLS Data Plane</title>

          <author fullname="A. Bashandy" initials="A." role="editor"
                  surname="Bashandy">
            <organization/>
          </author>

          <author fullname="C. Filsfils" initials="C." role="editor"
                  surname="Filsfils">
            <organization/>
          </author>

          <author fullname="S. Previdi" initials="S." surname="Previdi">
            <organization/>
          </author>

          <author fullname="B. Decraene" initials="B." surname="Decraene">
            <organization/>
          </author>

          <author fullname="S. Litkowski" initials="S." surname="Litkowski">
            <organization/>
          </author>

          <author fullname="R. Shakir" initials="R." surname="Shakir">
            <organization/>
          </author>

          <date month="December" year="2019"/>

          <abstract>
            <t>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">
        <front>
          <title>IPv6 Segment Routing Header (SRH)</title>

          <author fullname="Clarence Filsfils" initials="C" surname="Filsfils">
            <organization/>
          </author>

          <author fullname="Darren Dukes" initials="D" surname="Dukes">
            <organization/>
          </author>

          <author fullname="Stefano Previdi" initials="S" surname="Previdi">
            <organization/>
          </author>

          <author fullname="John Leddy" initials="J" surname="Leddy">
            <organization/>
          </author>

          <author fullname="Satoru Matsushima" initials="S"
                  surname="Matsushima">
            <organization/>
          </author>

          <author fullname="Daniel Voyer" initials="D" surname="Voyer">
            <organization/>
          </author>

          <date day="22" month="October" year="2019"/>

          <abstract>
            <t>Segment Routing can be applied to the IPv6 data plane using a
            new type of Routing Extension Header called the Segment Routing
            Header. This document describes the Segment Routing Header and how
            it is used by Segment Routing capable nodes.</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-ietf-6man-segment-routing-header-26"/>

        <format target="http://www.ietf.org/internet-drafts/draft-ietf-6man-segment-routing-header-26.txt"
                type="TXT"/>
      </reference>

      <reference anchor="I-D.ietf-detnet-yang">
        <front>
          <title>Deterministic Networking (DetNet) Configuration YANG
          Model</title>

          <author fullname="Xuesong Geng" initials="X" surname="Geng">
            <organization/>
          </author>

          <author fullname="Mach Chen" initials="M" surname="Chen">
            <organization/>
          </author>

          <author fullname="Yeoncheol Ryoo" initials="Y" surname="Ryoo">
            <organization/>
          </author>

          <author fullname="Zhenqiang Li" initials="Z" surname="Li">
            <organization/>
          </author>

          <author fullname="Reshad Rahman" initials="R" surname="Rahman">
            <organization/>
          </author>

          <author fullname="Don Fedyk" initials="D" surname="Fedyk">
            <organization/>
          </author>

          <date day="11" month="June" year="2020"/>

          <abstract>
            <t>This document contains the specification for Deterministic
            Networking flow configuration YANG Model. The model allows for
            provisioning of end-to-end DetNet service along the path without
            dependency on any signaling protocol. The YANG module defined in
            this document conforms to the Network Management Datastore
            Architecture (NMDA).</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft" value="draft-ietf-detnet-yang-06"/>

        <format target="http://www.ietf.org/internet-drafts/draft-ietf-detnet-yang-06.txt"
                type="TXT"/>
      </reference>

      <reference anchor="I-D.ietf-detnet-topology-yang">
        <front>
          <title>Deterministic Networking (DetNet) Topology YANG Model</title>

          <author fullname="Xuesong Geng" initials="X" surname="Geng">
            <organization/>
          </author>

          <author fullname="Mach Chen" initials="M" surname="Chen">
            <organization/>
          </author>

          <author fullname="Zhenqiang Li" initials="Z" surname="Li">
            <organization/>
          </author>

          <author fullname="Reshad Rahman" initials="R" surname="Rahman">
            <organization/>
          </author>

          <date day="25" month="January" year="2019"/>

          <abstract>
            <t>This document defines a YANG data model for Deterministic
            Networking (DetNet) topology discovery and capability
            configuration. The YANG module defined in this document conforms
            to the Network Management Datastore Architecture (NMDA).</t>
          </abstract>
        </front>

        <seriesInfo name="Internet-Draft"
                    value="draft-ietf-detnet-topology-yang-00"/>

        <format target="http://www.ietf.org/internet-drafts/draft-ietf-detnet-topology-yang-00.txt"
                type="TXT"/>
      </reference>
    </references>
  </back>

  <!--

-->
</rfc>
