<?xml version="1.0" encoding="UTF-8"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" category="std" docName="draft-bernardos-detnet-multi-domain-pce-00" ipr="trust200902">
<?rfc toc="yes"?>
<?rfc sortrefs="yes"?>
<?rfc symrefs="yes"?>

  <front>
    <title abbrev="PCE Multi-Domain DetNet">A PCE-based Control Plane Framework for Multi-Domain
      Deterministic Networking (DetNet)</title>
      
    <author fullname="Carlos J. Bernardos" initials="C.J." role="editor" surname="Bernardos">
      <organization>Universidad Carlos III de Madrid</organization>
      <address>
        <postal>
          <street>Av. Universidad 30</street>
          <city>Leganes</city>
          <region>Madrid</region>
          <code>28911</code>
          <country>Spain</country>
        </postal>
        <phone>+34 91624 6235</phone>
        <email>cjbc@it.uc3m.es</email>
        <uri>http://www.it.uc3m.es/cjbc</uri>
      </address>
    </author>
    
    <author fullname="Luis M. Contreras" initials="L." surname="Contreras">
      <organization abbrev="Telefonica" showOnFrontPage="true">Telefonica</organization>
      <address>
        <postal>
          <country>Spain</country>
        </postal>
        <email>luismiguel.contrerasmurillo@telefonica.com</email>
      </address>
    </author>

   <author fullname="Quan Xiong" initials="Q" surname="Xiong">
      <organization>ZTE Corporation</organization>
      <address>
        <postal>
          <street/>
         <city></city>
          <region/>
          <code/>
          <country>China</country>
        </postal>
        <phone></phone>
        <email>xiong.quan@zte.com.cn</email>
     </address>
    </author>	

    <author fullname="Alain Mourad"
            initials="A."
            surname="Mourad">
      <organization abbrev="InterDigital">
        InterDigital Europe
      </organization>
      <address>
        <email>Alain.Mourad@InterDigital.com</email>
        <uri>http://www.InterDigital.com/</uri>
      </address>
    </author>

    <area>Routing</area>

    <workgroup>DETNET WG</workgroup>
    
    <abstract>
      <t>Deterministic Networking (DetNet) provides the capability to carry specified unicast or
        multicast data flows for real-time applications with extremely low data loss rates and
        bounded latency over a path or network. As DetNet deployments expand, they will inevitably
        need to span multiple domains that may be under separate administrative or technological
        control. This creates a need for a control plane solution that can establish and maintain
        end-to-end DetNet services across these domain boundaries.</t>
      <t>This document defines a framework for a Path Computation Element (PCE)-based control plane
        for multi-domain DetNet. It first establishes a working definition of a "DetNet Domain" for
        the purpose of path computation and control. It then describes two high-level architectural
        approaches for inter-domain path computation and resource reservation: a Hierarchical PCE
        model and a peer-to-peer PCE "stitching" model. This framework provides the foundation for
        more specific work on multi-domain DetNet solutions.</t>
    </abstract>
    
  </front>
  
  <middle>
  
    <section anchor="introduction" title="Introduction">
      <t>The Deterministic Networking (DetNet) architecture, as defined in <xref target="RFC8655"/>,
        provides a service for flows requiring bounded latency, and/or extremely low packet loss, and/or reliable service. The
        initial focus of DetNet has largely been on single-domain networks, where a single
        controller or administrative entity has full visibility and control over all network
        resources.</t>
      <t>However, many use cases, such as industrial automation, professional audio/video, and smart
        grids, require deterministic connectivity that spans multiple networks. These networks may
        be operated by different providers (administrative domains), utilize different underlying
        link-layer technologies (technological domains), or be structured as separate control areas
        for scalability.</t>
      <t>To support such scenarios, a control plane framework is needed to coordinate the
        establishment of end-to-end DetNet paths across these domain boundaries. The Path
        Computation Element (PCE) Communication Protocol (PCEP) <xref target="RFC5440"/> provides a
        standard mechanism for a PCE to compute paths and a Path Computation Client (PCC) to request
        them. This makes PCE a suitable candidate for building a multi-domain DetNet control
        plane.</t>
      <t>This document builds on the DetNet Controller Plane Framework <xref
          target="I-D.ietf-detnet-controller-plane-framework"/> by focusing specifically on
        multi-domain challenges. It proposes a foundational framework by:</t>
      <ul spacing="compact">
        <li>Defining what constitutes a "domain" in the context of DetNet path computation.</li>
        <li>Describing high-level PCE-based architectures for managing multi-domain paths.</li>
        <li>Identifying key considerations for establishing and maintaining DetNet flows across
          these domains.</li>
      </ul>
      <t>The goal is to establish the necessary foundational concepts before addressing specific
        technology implementations, such as multi-domain RAW (Reliable and Available Wireless) <xref
          target="I-D.bernardos-detnet-raw-multidomain"/>.</t>
    </section>
    
    <section anchor="terminology" title="Conventions and Terminology">
      <t>The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT",
        "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be
        interpreted as described in BCP 14 <xref target="RFC2119"/>
        <xref target="RFC8174"/> when, and only when, they appear in all capitals, as shown here.</t>
      <t>This document uses the terminology defined in <xref target="RFC8655"/>, <xref target="RFC4655"/> and <xref target="RFC5440"/>.</t>
    </section>
    
    <section anchor="domain-definition" title="Defining a DetNet Domain">
      <t>For the purpose of multi-domain DetNet control, a clear definition of a "domain" is
        essential. A domain represents a collection of network resources (nodes, links) that are
        managed and controlled as a single entity for the purpose of DetNet path computation and
        resource allocation.</t>
        
      <section anchor="domain-characteristics" title="Domain Characteristics">
        <t>A DetNet domain is characterized by a set of network nodes that are subject to a single,
          consistent set of DetNet control and management policies. From a PCE-based control plane
          perspective, this typically implies that:</t>
        <ul spacing="compact">
          <li>A single PCE instance (or a coordinated set of redundant PCEs) has complete
            topological visibility within the domain.</li>
          <li>This PCE instance is responsible for computing paths and managing the allocation of
            DetNet-specific resources (e.g., buffer space, link schedules, queue reservations) for
            all nodes within that domain.</li>
          <li>There is a trusted relationship and a secure communication channel between the PCE and
            all the nodes it controls within the domain.</li>
        </ul>
      </section>
      
      <section anchor="domain-scope" title="Scope of a DetNet Domain">
        <t>The boundaries of a DetNet domain can be defined based on several factors, which may
          overlap:</t>
        <dl spacing="compact">
          <dt>Administrative Domain:</dt>
          <dd>A set of network elements under the control of a single network operator or
            administrative entity. This is the most common interpretation. Inter-domain
            communication occurs when a path must cross from one operator's network to
            another's.</dd>
          <dt>PCE Control Domain:</dt>
          <dd>A domain is defined as the set of nodes controlled by a single PCE instance. This is
            the primary definition used within this framework. A large administrative domain might
            be divided into multiple smaller PCE control domains for scalability.</dd>
          <dt>Technological Domain:</dt>
          <dd>A domain could be defined by the consistent use of a specific data plane technology 
         (e.g., a TSN domain, an 3GPP 5G domain) or queuing mechanism (e.g. queuing solutions within 
          the categories as per <xref target="I-D.ietf-detnet-dataplane-taxonomy"/>). While paths may cross
            technological boundaries, this document posits that this does not inherently define a
            control plane domain boundary. A single PCE SHOULD be capable of managing a domain
            comprising multiple technologies. Similarly, the specific queuing mechanisms (e.g.,
            <xref target="RFC9016"/>) supported by devices do not define a domain boundary; a single
            domain can contain devices supporting multiple queuing solutions, which can be used
            concurrently. PCE needs to select a specific queuing mechanism along the path for a 
			DetNet flow within each domain.</dd>
        </dl>
        <!-- Carlos: This section requires further discussion. Is the primary definition of a domain being
          "a single PCE's area of control" the right consensus point for the WG? We need to clearly
          state the assumptions for the rest of the document. -->
      </section>
      
    </section>
    
    <section anchor="pce-architectures" title="PCE-based Multi-Domain DetNet Architectures">
    
      <section anchor="use-case" title="Exemplary Use Case">
        <t>Let's consider the scenario depicted in the figure below, where a DetNet flow is
          established between a source S and a destination D. The path for the flow traverses three
          different domains. Domain 1 is a wired domain, which could for example be a TSN-based DetNet 
		  MPLS <xref target="RFC8964"/> or DetNet IP <xref target="RFC8939"/> network. Domain 2 
		  is a wireless (RAW) domain. Domain 3 is again a wired domain. The RAW domain provides 
		  connectivity between the two wired domains. Note that this is just an example, and 
		  other combinations of wired/wireless domains could exist (e.g., a DetNet flow traversing 
		  a wired domain providing connectivity between two RAW domains).</t>
          
        <figure anchor="fig_scenario">
          <name>Exemplary multi-domain scenario</name>
          <artwork align="center" name=""><![CDATA[
                    .------------------------------------.
                    |            Parent PCE              |
                    '------------------------------------'
                           ^      |      ^
                           |      |      |
                           v      v      v
      .----------------.   .----------------.   .----------------.
      | Child PCE (d1) |   | Child PCE (d2) |   | Child PCE (d3) |
      '----------------'   '----------------'   '----------------'
            | |                  | |                  | |
 S ---- R1 ======== R2 -------- R3 ======== R4 -------- R5 ---- D
        <-- Domain 1 -->   <---- Domain 2 ---->   <-- Domain 3 -->
           (wired)              (RAW)                (wired)

      S, D: end-systems (source and destination)
      Rx: DetNet routers/bridges
      ==: wired link
      --: wireless link
]]></artwork>
        </figure>
        
        <t>Each domain has its own PCE, which is responsible for path computation and resource
          management within the domain. These are referred to as Child PCEs (C-PCEs). Routers R2
          and R3 are border routers of Domain 2 (RAW), and R3 and R4 are border routers of Domain 2
          and 3, respectively. A Parent PCE (P-PCE) is responsible for the end-to-end path
          computation and orchestration among the different C-PCEs.</t>
      </section>
      
      <section anchor="problem-statement" title="Problem Statement">
        <t>In a multi-domain environment, no single PCE has end-to-end visibility of the full
          network topology. The challenge is to compute an end-to-end path that meets the strict
          latency, jitter, and loss requirements of a DetNet flow, while respecting the
          administrative and confidentiality boundaries of each participating domain.</t>
        <t>Each domain's PCE is responsible for its own internal path computation and resource
          allocation. The multi-domain architecture must define how these individual PCEs cooperate
          to create a seamless end-to-end service. Two primary models are considered: Hierarchical
          PCE and Peer-to-Peer PCE.</t>
      </section>
      
      <section anchor="h-pce" title="Hierarchical PCE (H-PCE) Approach">
        <t>The Hierarchical PCE (H-PCE) architecture <xref target="RFC6805"/> defines a parent-child
          relationship between PCEs.</t>
        <ul spacing="compact">
          <li>A Parent PCE (P-PCE) has a partial, abstracted view of
            the child domains. It does not see the detailed topology within each child domain but
            knows the reachability and characteristics (e.g., available latency budget, cost) of
            paths to and through them.</li>
          <li>A Child PCE (C-PCE) has full visibility of its own
            domain's topology and resources. It is responsible for all intra-domain path
            computations.</li>
        </ul>
        <t>In a multi-domain DetNet context:</t>
        <ol spacing="compact">
          <li>A request for an end-to-end DetNet path is sent to the P-PCE. This request includes the
            source, destination, and required QoS parameters (e.g., maximum latency).</li>
          <li>The P-PCE computes a high-level, domain-sequence path. This path is a sequence of
            domains that the flow must traverse, along with the entry and exit boundary nodes for
            each domain.</li>
          <li>The P-PCE then sends requests to the C-PCE of each domain in the path sequence. Each
            request asks for an intra-domain path segment between the specified entry and exit nodes
            that meets a portion of the end-to-end QoS requirements.</li>
          <li>Each C-PCE computes its path segment, reserves the necessary resources locally, and
            reports success or failure back to the P-PCE.</li>
          <li>If all C-PCEs are successful, the P-PCE confirms the end-to-end path. If any C-PCE
            fails, the P-PCE may attempt to find an alternate domain path.</li>
        </ol>
        
        <t>The Parent PCE (P-PCE) would be responsible for computing the multi-domain path based on
          an abstracted topology of the different domains. The Child PCEs (C-PCEs) are responsible
          for the path computation in their own domains. A C-PCE would be aware of the specific
          technologies used in its domain (e.g., RAW, DetNet IP, DetNet MPLS, etc.), being able to compute a path
          taking into account the specific constraints of the technology. For instance, in a RAW
          domain, the C-PCE would be able to select the path, the schedule and the links to be used
          to guarantee a certain level of reliability.</t>
          
        <!-- Carlos: The specific PCEP extensions needed to carry DetNet constraints (e.g., detailed
          latency budgets, packet replication/ elimination function locations) between parent and
          child PCEs need to be detailed in a future document. Further study is required on aspects
          such as: (i) how the topology is abstracted and provided by the C-PCE to the P-PCE, (ii)
          how the P-PCE populates its TED, and (iii) what PCEP extensions are needed for a C-PCE to
          provide abstracted topology information to a P-PCE, and for a P-PCE to request a path with
          DetNet-specific constraints to a C-PCE.-->
          
      </section>
      
      <section anchor="p2p-pce" title="Peer-to-Peer (Stitching) PCE Approach">
        <t>In a peer-to-peer approach, also known as "stitching," there is no parent-child
          hierarchy. PCEs from adjacent domains cooperate as peers. The path computation is
          performed sequentially from one domain to the next. This model is described in <xref
            target="RFC5441"/> for inter-area and inter-AS TE path computation.</t>
        <t>In a multi-domain DetNet context:</t>
        <ol spacing="compact">
          <li>The PCE in the source domain (PCE-1) receives a path request for a flow destined for
            another domain.</li>
          <li>PCE-1 computes a path from the source node to a suitable exit border node in its
            domain.</li>
          <li>PCE-1 then sends a PCEP request to the PCE of the adjacent domain (PCE-2), specifying
            the entry border node (which is the exit node from domain 1) and the final destination.
            The request includes the remaining QoS budget.</li>
          <li>PCE-2 computes a path through its domain to either the final destination (if it's in
            domain 2) or to another suitable exit border node. It then "stitches" this segment to
            the previous one.</li>
          <li>This process repeats until the PCE in the destination domain is reached. The path is
            confirmed backward along the chain of PCEs.</li>
        </ol>
        
        <!-- Carlos: This approach requires strong trust relationships and policy agreements between peer
          PCEs. We need to detail the trade-offs between the H-PCE and Stitching models, considering
          factors like scalability, confidentiality, and complexity of coordination.-->
      </section>
    </section>
    <section anchor="flow-considerations" title="Multi-Domain DetNet Flow Considerations">
      <section anchor="e2e-computation" title="End-to-End Path Computation">
        <t>The end-to-end path is a concatenation of intra-domain path segments. The total latency
          and other QoS metrics are cumulative. The control plane must be able to allocate the
          end-to-end budget among the participating domains.</t>
		  
		<t>In hierarchical PCE, the P-PCE needs to collect the domain-specific information from
		C-PCEs and the P-PCE will divide the end-to-end budget of a DetNet flow into sub-budgets
		to several domains based on the capabilities (e.g. latency, jitter) within each domain.</t>
		
		<t>In stitching PCE, the end-to-end budget of a DetNet will be divided from the source PCE, 
		then to an adjacent domain, till to the destination PCE. The PCE within each domain needs to 
		compute the latency bound as per <xref target="RFC9320"/> considering the bounded latency metric.</t>
		
      </section>
      <section anchor="resource-management" title="Resource Management">
        <t>Resources MAY be reserved in each domain for the flow. If any domain in the path cannot
          provide the required resources, the end-to-end path setup fails. A mechanism for
          transactional, all-or-nothing resource commitment across domains is highly desirable.</t>
		  
		 <t>The control plane also needs to advertise inter-domain resource information, including 
		 bandwidth, delay, jitter with related queuing mechanisms for QoS coordination.</t>
        <!-- Carlos: Is something like a two-phase commit protocol needed for resources, or is a sequential
          reservation with backtracking sufficient? This is a key research and standardization
          question. -->
      </section>
      
      <section anchor="end-system-awareness" title="End-System awareness">
        <t>A critical aspect is whether the end-systems (source and destination) are
          DetNet-aware.</t>
        <dl spacing="compact">
          <dt>DetNet-aware End-Systems:</dt>
          <dd>The end-systems can signal their QoS requirements and participate in the DetNet
            control plane.</dd>
          <dt>DetNet-unaware End-Systems:</dt>
          <dd>The requirements for these systems must be configured at the edge of the DetNet domain
            by a proxy or network management system. In a multi-domain scenario, the entry node of
            the first DetNet domain acts as this ingress point.</dd>
        </dl>
      </section>
	  
	  <section anchor="flow-aggregation" title="Flow Aggregation">  
	  
	  <t>Flow aggregation is recommended in the multi-domain scenario to achieve the end-to-end 
	  QoS guarantees for aggregated flow(s) that span across multiple domains. Multiple flows may 
	  be aggregated in a domain and disaggregated in another domain. The network parameters of an 
	  aggregated flow should be exchanged among different network domains. The path computation 
	  should consider to identify the end-to-end budget of the aggregated flow which should cover
	  the requirements of all member flows.</t>
      
    </section>
	</section>
    
    <section anchor="security" title="Security Considerations">
      <t>Multi-domain operations introduce significant security challenges. The communication
        between PCEs in different domains MUST be secured, ensuring authentication, integrity, and
        confidentiality. Each domain must be protected from misbehaving or compromised peer
        domains.</t>
      <t>Topology and resource information exposed by a domain's PCE to an external entity (a parent
        PCE or a peer PCE) is a sensitive matter. The framework must allow for policy-based control
        over the level of abstraction and detail that is shared.</t>
      <t>Considerations from <xref target="RFC8253"/> also applies.</t>
      <!-- Carlos: This section is a placeholder and needs to be expanded significantly. -->
    </section>
    
    <section anchor="iana" title="IANA Considerations">
      <t>This document makes no requests of IANA.</t>
    </section>

    <section anchor="Acknowledgments" title="Acknowledgments">

      <t>
The work of Carlos J. Bernardos in this document has been partially supported by
the Horizon Europe DESIRE6G (Grant 101096466), and UNICO I+D 6G-DATADRIVEN-04 project (TSI-063000-2021-132).
      </t>

    </section>
    
  </middle>
  <back>
    <references>
      <name>Normative References</name>
      <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 initials="S." surname="Bradner" fullname="S. Bradner">
            <organization/>
          </author>
          <date year="1997" month="March"/>
        </front>
        <seriesInfo name="BCP" value="14"/>
        <seriesInfo name="RFC" value="2119"/>
        <seriesInfo name="DOI" value="10.17487/RFC2119"/>
      </reference>
      <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174">
        <front>
          <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
          <author initials="B." surname="Leiba" fullname="B. Leiba">
            <organization/>
          </author>
          <date year="2017" month="May"/>
        </front>
        <seriesInfo name="BCP" value="14"/>
        <seriesInfo name="RFC" value="8174"/>
        <seriesInfo name="DOI" value="10.17487/RFC8174"/>
      </reference>
      <reference anchor="RFC8655" target="https://www.rfc-editor.org/info/rfc8655">
        <front>
          <title>Deterministic Networking Architecture</title>
          <author initials="N." surname="Finn" fullname="N. Finn">
            <organization/>
          </author>
          <author initials="P." surname="Thubert" fullname="P. Thubert">
            <organization/>
          </author>
          <author initials="B." surname="Varga" fullname="B. Varga">
            <organization/>
          </author>
          <author initials="J." surname="Farkas" fullname="J. Farkas">
            <organization/>
          </author>
          <date year="2019" month="October"/>
        </front>
        <seriesInfo name="RFC" value="8655"/>
        <seriesInfo name="DOI" value="10.17487/RFC8655"/>
      </reference>
    </references>
    <references>
      <name>Informative References</name>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.4655.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.5440.xml"/>
      <xi:include href="https://xml2rfc.ietf.org/public/rfc/bibxml/reference.RFC.8253.xml"/>
      <reference anchor="RFC5441" target="https://www.rfc-editor.org/info/rfc5441">
        <front>
          <title>A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest
            Constrained Inter-Domain Traffic Engineering Label Switched Paths</title>
          <author initials="JP." surname="Vasseur" fullname="JP. Vasseur" role="editor">
            <organization/>
          </author>
          <date year="2009" month="April"/>
        </front>
        <seriesInfo name="RFC" value="5441"/>
        <seriesInfo name="DOI" value="10.17487/RFC5441"/>
      </reference>
      <reference anchor="RFC6805" target="https://www.rfc-editor.org/info/rfc6805">
        <front>
          <title>The Application of the Path Computation Element Architecture to the Dark Side of
            the Internet</title>
          <author initials="D." surname="King" fullname="D. King" role="editor">
            <organization/>
          </author>
          <author initials="A." surname="Farrel" fullname="A. Farrel" role="editor">
            <organization/>
          </author>
          <date year="2012" month="November"/>
        </front>
        <seriesInfo name="RFC" value="6805"/>
        <seriesInfo name="DOI" value="10.17487/RFC6805"/>
      </reference>
      <reference anchor="RFC9016" target="https://www.rfc-editor.org/info/rfc9016">
        <front>
          <title>Flow and Service Information Model for Deterministic Networking (DetNet)</title>
          <author initials="B." surname="Varga" fullname="B. Varga" role="editor">
            <organization/>
          </author>
          <author initials="J." surname="Farkas" fullname="J. Farkas">
            <organization/>
          </author>
          <author initials="L." surname="Berger" fullname="L. Berger">
            <organization/>
          </author>
          <author initials="A." surname="Malis" fullname="A. Malis">
            <organization/>
          </author>
          <author initials="S." surname="Bryant" fullname="S. Bryant">
            <organization/>
          </author>
          <author initials="J." surname="Korhonen" fullname="J. Korhonen">
            <organization/>
          </author>
          <date year="2021" month="May"/>
        </front>
        <seriesInfo name="RFC" value="9016"/>
        <seriesInfo name="DOI" value="10.17487/RFC9016"/>
      </reference>
      <reference anchor="I-D.ietf-detnet-controller-plane-framework"
        target="https://datatracker.ietf.org/doc/html/draft-ietf-detnet-controller-plane-framework">
        <front>
          <title>Deterministic Networking (DetNet) Controller Plane Framework</title>
          <author>
            <organization>Saad, T., et al.</organization>
          </author>
          <date/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-ietf-detnet-controller-plane-framework"/>
      </reference>
      <reference anchor="I-D.bernardos-detnet-raw-multidomain"
        target="https://datatracker.ietf.org/doc/html/draft-bernardos-detnet-raw-multidomain-06">
        <front>
          <title>Reliable and Available Wireless (RAW) based on Multi-link and Multi-domain
            strategies</title>
          <author>
            <organization>Bernardos, C., et al.</organization>
          </author>
          <date/>
        </front>
        <seriesInfo name="Internet-Draft" value="draft-bernardos-detnet-raw-multidomain-06"/>
      </reference>
       <reference anchor="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>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="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>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">
          <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>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="I-D.ietf-detnet-dataplane-taxonomy">
          <front>
            <title>Dataplane Enhancement Taxonomy</title>
            <author fullname="Jinoo Joung" initials="J." surname="Joung">
              <organization>Sangmyung University</organization>
            </author>
            <author fullname="Xuesong Geng" initials="X." surname="Geng">
              <organization>Huawei</organization>
            </author>
            <author fullname="Shaofu Peng" initials="S." surname="Peng">
              <organization>ZTE Corporation</organization>
            </author>
            <author fullname="Toerless Eckert" initials="T. T." surname="Eckert">
              <organization>Futurewei Technologies</organization>
            </author>
            <date day="7" month="July" year="2025"/>
            <abstract>
              <t>   This draft is to facilitate the understanding of the data plane
   enhancement solutions, which are suggested currently or can be
   suggested in the future, for deterministic networking.  This draft
   provides criteria for classifying data plane solutions.  Examples of
   each category are listed, along with reasons where necessary.
   Strengths and limitations of the categories are described.
   Suitability of the solutions for various services of deterministic
   networking are also mentioned.  Reference topologies for evaluation
   of the solutions are given as well.

              </t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-detnet-dataplane-taxonomy-04"/>
        </reference>	  
	  
    </references>
  </back>
</rfc>