Skip to main content

Enhanced DetNet Data Plane (EDP) Framework for Scaling Deterministic Networks
draft-xiong-detnet-large-scale-enhancements-02

The information below is for an old version of the document.
Document Type
This is an older version of an Internet-Draft whose latest revision state is "Active".
Authors Quan Xiong , Zongpeng Du , Junfeng Zhao , Dong Yang
Last updated 2023-03-13 (Latest revision 2022-10-24)
Replaces draft-xiong-detnet-wide-area-ip-requirements
RFC stream (None)
Formats
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date (None)
Responsible AD (None)
Send notices to (None)
draft-xiong-detnet-large-scale-enhancements-02
DETNET                                                          Q. Xiong
Internet-Draft                                           ZTE Corporation
Intended status: Informational                                     Z. Du
Expires: 14 September 2023                                  China Mobile
                                                                 J. Zhao
                                                                   CAICT
                                                                 D. Yang
                                             Beijing Jiaotong University
                                                           13 March 2023

  Enhanced DetNet Data Plane (EDP) Framework for Scaling Deterministic
                                Networks
             draft-xiong-detnet-large-scale-enhancements-02

Abstract

   The Enhanced Deterministic Networking (EDN) is required to provide
   the enhancement of flow identification and packet treatment for
   Deterministic Networking (DetNet) to achieve the DetNet QoS in large-
   scale networks.

   This document proposes the enhancement of packet treatment to support
   the functions and metadata for Enhanced DetNet Data plane (EDP).  It
   describes related enhanced controller plane considerations as well.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on 14 September 2023.

Copyright Notice

   Copyright (c) 2023 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

Xiong, et al.           Expires 14 September 2023               [Page 1]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents (https://trustee.ietf.org/
   license-info) in effect on the date of publication of this document.
   Please review these documents carefully, as they describe your rights
   and restrictions with respect to this document.  Code Components
   extracted from this document must include Revised BSD License text as
   described in Section 4.e of the Trust Legal Provisions and are
   provided without warranty as described in the Revised BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Conventions used in this document . . . . . . . . . . . . . .   3
     2.1.  Terminology . . . . . . . . . . . . . . . . . . . . . . .   3
     2.2.  Requirements Language . . . . . . . . . . . . . . . . . .   3
   3.  Enhancements of Enhanced DetNet Data Plane  . . . . . . . . .   4
     3.1.  Enhancements of Packet Treatment  . . . . . . . . . . . .   4
       3.1.1.  Flow Identification . . . . . . . . . . . . . . . . .   5
       3.1.2.  Deterministic Routes  . . . . . . . . . . . . . . . .   5
         3.1.2.1.  Deterministic Links . . . . . . . . . . . . . . .   5
         3.1.2.2.  Inter-domain Deterministic Routes . . . . . . . .   6
       3.1.3.  Deterministic Resources . . . . . . . . . . . . . . .   6
       3.1.4.  Queuing Treatment . . . . . . . . . . . . . . . . . .   7
     3.2.  Enhancements of DetNet-Specific Metadata  . . . . . . . .   7
     3.3.  Enhancements of DetNet IP/MPLS/SRv6 Data Plane  . . . . .   8
   4.  Controller Plane (Management and Control) Considerations  . .   8
     4.1.  Management and Scheduling of Multiple Queuing
           Mechanisms  . . . . . . . . . . . . . . . . . . . . . . .   8
     4.2.  Distributed Deterministic Path  . . . . . . . . . . . . .   9
     4.3.  Inter-domain Deterministic Path . . . . . . . . . . . . .   9
     4.4.  Deterministic Path Computation  . . . . . . . . . . . . .   9
     4.5.  Configuration of Flow Mapping . . . . . . . . . . . . . .   9
   5.  Security Considerations . . . . . . . . . . . . . . . . . . .   9
   6.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   9
   7.  Acknowledgements  . . . . . . . . . . . . . . . . . . . . . .   9
   8.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   9
     8.1.  Normative References  . . . . . . . . . . . . . . . . . .   9
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  14

1.  Introduction

   According to [RFC8655], Deterministic Networking (DetNet) operates at
   the IP layer and delivers service which provides extremely low data
   loss rates and bounded latency within a network domain.  The
   framework of DetNet data planes has been specified in [RFC8938].  The
   IP and MPLS DetNet data plane has been defined respectively in
   [RFC8939] and [RFC8964].  The DetNet IP data plane primarily uses 6-
   tuple-based flow identification.  And the DetNet MPLS data plane

Xiong, et al.           Expires 14 September 2023               [Page 2]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   leverages existing pseudowire (PW) encapsulations and MPLS Traffic
   Engineering (MPLS-TE) encapsulations.

   The applications in 5G networks demand much more deterministic and
   precise properties in large-scale networks.  The existing
   deterministic technologies are facing large-scale number of nodes and
   long-distance transmission, traffic scheduling, dynamic flows, and
   other controversial issues in large-scale networks.  The Enhanced
   DetNet (EDN) is required to provide the enhancement of flow
   identification and packet treatment and support the enhanced
   functions or mechanisms for DetNet to achieve the DetNet in large-
   scale networks.  The Enhanced DetNet Data Plane (EDP) is required to
   support a data plane method of flow identification and packet
   treatment.  [I-D.xiong-detnet-enhanced-detnet-gap-analysis] has
   described the service requirements and characteristics of scaling
   deterministic networks and analyzes the existing technologies gap for
   EDP especially applying the DetNet data plane as per [RFC8938].
   [I-D.ietf-detnet-scaling-requirements] has described the enhancement
   requirements for EDP.  The EDP aims to describe how to use IP and/or
   MPLS, and related OAM, to support a data plane method of flow
   identification and packet treatment over Layer 3.  The enhanced QoS-
   related functions and metadata should be provided in scaling
   networks.  For example, as described in [RFC9320], the end-to-end
   bounded latency depends on the value of queuing delay bound along
   with the queuing mechanisms.  Multiple queuing mechanisms can be used
   to guarantee the bounded latency in DetNet.  New DetNet-specific
   metadata should be carried in EDP such as IP/MPLS/SRv6 Data Plane.

   This document proposes the enhancement of packet treatment to support
   the functions and metadata for Enhanced DetNet Data plane (EDP).  It
   describes related enhanced controller plane considerations as well.

2.  Conventions used in this document

2.1.  Terminology

   The terminology is defined as [RFC8655] and [RFC8938].

2.2.  Requirements Language

   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 [RFC2119] [RFC8174] when, and only when, they appear in all
   capitals, as shown here.

   Abbreviations and definitions used in this document:

Xiong, et al.           Expires 14 September 2023               [Page 3]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   EDN:           Enhanced DetNet or Enhanced Deterministic Networking

   EDP:           Enhanced Data plane

   IPv6:          IP version 6 forwarding plane

   SRv6:          Segment Routing for IPv6 forwarding plane

3.  Enhancements of Enhanced DetNet Data Plane

   As defined in [RFC8938], the DetNet data plane describes how
   application flows, or App-flows are carried over DetNet networks and
   it is provided by the DetNet service and forwarding sub-layers with
   DetNet-related data plane functions and mechanisms.  From charter and
   milestones, the enhanced DetNet data plane is required to provide the
   enhancement of flow identification and packet treatment including the
   enhanced QoS-related functions and metadata in scaling networks.

3.1.  Enhancements of Packet Treatment

   This section proposes the enhancement for the DetNet Data Plane
   Protocol Stack as shown in Figure 1 and the enhanced DetNet-related
   data plane functions and mechanisms should be provided by the DetNet
   service and forwarding sub-layers.

                 |  packets going  |            ^  packets coming   ^
                 v down the stack  v            |   up the stack    |
           +-----------------------------+   +----------------------------+
           |           Source            |   |        Destination         |
           +-----------------------------+   +----------------------------+
           |Service sub-layer:           |   |Service sub-layer:          |
           |  Flow Identification        |   |  Flow Identification       |
           +-----------------------------+   +----------------------------+
           |Forwarding sub-layer:        |   |Forwarding sub-layer:       |
           |  Deterministic Routes       |   |  Deterministic Routes      |
           |  Deterministic Resources    |   |  Deterministic Resources   |
           |  Queuing treatment          |   |  Queuing treatment         |
           +-----------------------------+   +----------------------------+
           |       Lower layers          |   |       Lower layers         |
           +-----------------------------+   +----------------------------+
                             v                           ^
                              \_________________________/

   <postamble>:
        

Xiong, et al.           Expires 14 September 2023               [Page 4]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   Figure 1: Enhanced Functions in DetNet Data Plane Protocol Stack

3.1.1.  Flow Identification

   From the perspective of differentiated services requirements in
   [I-D.xiong-detnet-enhanced-detnet-gap-analysis] section 3.1.1, a
   scaling network needs to provide the deterministic service for
   various applications.  And the deterministic service may demand
   different DetNet QoS levels according to different application
   scenarios.  The DetNet data plane should support the identification
   of multiple flows and the differentiated deterministic QoS for each
   DetNet flow.

   According to the gap described in
   [I-D.xiong-detnet-enhanced-detnet-gap-analysis] section 3.3.1, this
   document proposes the enhanced DetNet data plane to support flow
   identification of DetNet differentiated services with service-level
   identification.  It may downscale the network operations with a large
   number of deterministic flows and network nodes in scaling networks.

3.1.2.  Deterministic Routes

   As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis]
   section 3.3.2.1, it may be challenging to compute the best path to
   meet all of the requirements and the the paths vary with the real-
   time change of the network topology in scaling networks.  The
   explicit routes may be not appropriate for scaling networks.  This
   document propose the deterministic routes which can be strict
   explicit paths or loose routes.  The former is applicable to
   centralized scenarios with controllers, and the latter is applicable
   to distributed scenarios.

3.1.2.1.  Deterministic Links

   As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis]
   section 3.3.2.1, it may be challenging to compute the best path to
   meet all of the requirements within a scaling network topology pool
   including multiple network metrics.  This document proposes the
   deterministic links to provide a one-dimensional deterministic metric
   to guarantee for the deterministic forwarding capabilities at
   different levels.

   The computing end-to-end delay bounds is defined in [RFC9320].  It is
   the sum of non-queuing delay bound and queuing delay bound in DetNet
   bounded latency model.  The upper bounds of queuing delay depends on
   the queuing mechanisms deployed along the path.  For example, a link
   with a queuing mechanism that does not guarantee a bounded delay a
   non-determinisitc link and a link with a queuing mechanism that can

Xiong, et al.           Expires 14 September 2023               [Page 5]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   provide deterministic delay is called a deterministic link.  The
   delay of a a deterministic link is consist of the propagation delay
   of the packet on the link and the queuing delay of the packet at the
   node.  A deterministic link can be a sub-network that provides
   deterministic transmission or a Point-to-Point (P2P) link.  The
   deterministic links could be distributed by IGP protocol as per
   [I-D.peng-lsr-flex-algo-deterministic-routing].

3.1.2.2.  Inter-domain Deterministic Routes

   As per [I-D.bernardos-detnet-multidomain], technical gaps are
   existing in multi-domain DetNet scenarios.  As discussed in
   [I-D.xiong-detnet-enhanced-detnet-gap-analysis] section 3.3.2.1, the
   inter-domain deterministic routes need to be established and
   provisioned in multi-domain scenarios.  The stitching of the intra-
   domain paths should be considered in DetNet data plane.

   In the centralized scenario, when the source and destination PEs of a
   deterministic service are located at the two ends with a limited
   physical range, one controller (single domain) or multiple
   controllers (cross domains) compute one or more paths with
   deterministic SLA according to the typical Traffic Specification
   (T-SPEC) based on the collected deterministic resources, or compute
   dynamically according to the service T-SPEC as required by the
   services.

   In the distributed scenario, deterministic loose routes are computed
   on the device through routing protocols.  Interior Gateway Protocol
   (IGP) is used to compute deterministic routes based on deterministic-
   delay inside a domain, and Border Gateway Protocol (BGP) is used to
   compute deterministic routes based on accurate delay/jitter across
   domains.

3.1.3.  Deterministic Resources

   As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis]
   section 3.3.2.2, the reservation and allocation of queuing related
   resources or deterministic latency resources should be taken into
   consideration in DetNet data plane.  The networks need to shield the
   differences between network capabilities.  Deterministic resource is
   the basis for providing deterministic network services.  It refers to
   the resources that meet the deterministic indicators of a node and
   link processing as well as the corresponding resource processing
   mechanisms (such as link bandwidth, queues, and scheduling
   algorithms).  It is required to make unified modeling for all the
   deterministic resources.  The deterministic links are provided and
   distributed to support the deterministic resource and forwarding
   capabilities.

Xiong, et al.           Expires 14 September 2023               [Page 6]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis]
   section 3.1.2, it is necessary to make overall resource planning and
   scheduling for the network to achieve the high-efficiency of
   resources utilization when provide multiple DetNet services.  The
   admission control policy of a flow should take into account the
   deterministic resource.

3.1.4.  Queuing Treatment

   As dicussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis]
   section 3.3.2.3, it is required to support the enhancement of queuing
   mechanisms.  Multiple queuing mechanisms can provide different levels
   of latency, jitter and other guarantees.  The DetNet forwarding sub-
   layer may provide the function and technology such as multiple
   queuing and traffic treatment for DetNet application flows.  The
   DetNet data plane may also encode the queuing related information in
   packets.  The encapsulation of a DetNet flow allows the packets to be
   sent over an unique queuing technology.  The DetNet forwarding nodes
   along the path can follow the queue scheduling carried in the packet
   to achieve the end-to-end bounded latency.

   The DetNet forwarding sub-layer may provide capabilities applying
   existing queuing mechanisms or traffic treatment.  For example, the
   traffic treatment has been proposed in
   [I-D.du-detnet-layer3-low-latency] to decrease the micro-bursts in
   layer3 network for low-latency traffic.  The time-scheduling queuing
   mechanisms includes the Time Aware Shaping [IIEEE802.1Qbv] and
   priority-scheduling includes the Credit-Based Shaper [IEEE802.1Q-
   2014] with Asynchronous Traffic Shaping[IEEE802.1Qcr].  The cyclic-
   scheduling queuing mechanism has been proposed in [IEEE802.1Qch] and
   improved in [I-D.dang-queuing-with-multiple-cyclic-buffers].  The
   deadline-scheduling queuing mechanism has been proposed in
   [I-D.stein-srtsn] and improved in
   [I-D.peng-detnet-deadline-based-forwarding].  The per-flow queuing
   mechanism includes Guaranteed-Service Integrated service (IntServ)
   [RFC2212].  The timeslot-based queuing mechanism has been proposed in
   [I-D.peng-detnet-packet-timeslot-mechanism].

3.2.  Enhancements of DetNet-Specific Metadata

   1. deterministic latency information

   DetNet forwarding sub-layer may provide the function and technology
   such as multiple queuing and traffic treatment for DetNet application
   flows to guarantee the deterministic latency.  The DetNet data plane
   may also encode the deterministic latency related information in
   packets.

Xiong, et al.           Expires 14 September 2023               [Page 7]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   The information ensuring deterministic latency should be provided for
   EDP.  A common and simplified data fields can be defined as per
   [I-D.xiong-detnet-data-fields-edp] including encapsulation in IPv6
   [I-D.xiong-detnet-6man-queuing-option] , MPLS
   [I-D.sx-detnet-mpls-queue] and
   [I-D.xiong-detnet-spring-srh-extensions].  For example, the
   encapsulation of a DetNet flow allows the packets to be sent over an
   unique queuing mechanism.  It is required to carry queuing related
   information in data plane so as to make appropriate packet forwarding
   and scheduling decisions to meet the time bounds.

3.3.  Enhancements of DetNet IP/MPLS/SRv6 Data Plane

   An IP data plane may operate natively or through the use of an
   encapsulation.  IP encapsulation can satisfy enhanced DetNet
   requirements.  Explicit inclusion of the flow identification, path
   selection, queuing and traffic treatment is possible through the use
   of IP options, IP extension headers or existing IP headers.  For
   example, the queuing information has been carried in IPv6/SRv6
   networks as defined in [I-D.xiong-detnet-6man-queuing-option] and
   [I-D.xiong-detnet-spring-srh-extensions].

   MPLS provides a service sub-layer for traffic by adding specific flow
   attributes (S-label and d-cw) in packets.  MPLS provides a forwarding
   sub-layer for traffic over implicit and explicit paths such as
   F-Labels.  Explicit inclusion of queuing and traffic treatment is
   possible through the use of MPLS metadata or MPLS TC field as defined
   in [I-D.sx-detnet-mpls-queue] and [I-D.eckert-detnet-mpls-tc-tcqf].

4.  Controller Plane (Management and Control) Considerations

4.1.  Management and Scheduling of Multiple Queuing Mechanisms

   As described in [I-D.ietf-detnet-scaling-requirements] section 3.6.1,
   it is required to support the configuration of multiple queuing
   mechanisms.  Different queuing mechanisms may be supported at
   different levels of latency, jitter and other guarantees.  The
   enhancement for controller plane should be provided such as
   configuration data model as defined in
   [I-D.guo-detnet-vpfc-planning].  And the type of queuing mechanism
   and the related queuing parameters should be advertised and
   configured.  For example, the deterministic links with queuing
   resource could be distributed by IGP protocol as per
   [I-D.peng-lsr-flex-algo-deterministic-routing].  And the queuing
   parameters are carried in deterministic latency information may be
   selected in path computation as per
   [I-D.xiong-pce-detnet-bounded-latency].

Xiong, et al.           Expires 14 September 2023               [Page 8]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

4.2.  Distributed Deterministic Path

   The deterministic routes may be loose routes in distributed
   scenarios.  It is required to support the distributed deterministic
   routes which are established by distributed protocols such as IGP as
   defined in [I-D.peng-lsr-flex-algo-deterministic-routing].

4.3.  Inter-domain Deterministic Path

   In scaling deterministic networks, it may across multiple network
   domains, it is required to support the inter-domain deterministic
   routes to achieve the end-to-end latency, bounded jitter.  And the
   deadline of latency and jitter of each domain and segment should be
   determined and controlled.  The inter-domain mechanism MUST be
   considered at the boundary nodes such as BGP configurations defined
   in [I-D.peng-idr-bgp-metric-credit] and PCEP solution
   [I-D.bernardos-detnet-multidomain].

4.4.  Deterministic Path Computation

   As defined in [I-D.xiong-pce-detnet-bounded-latency], the
   deterministic latency constraints can be carried in PCEP extensions
   and the end-to-end deterministic path computation should be achieved
   for DetNet service.

4.5.  Configuration of Flow Mapping

   As defined in [I-D.xiong-idr-detnet-flow-mapping], the BGP flowspec
   can be used for the filtering of the packets that match the DetNet
   networks and the mapping between TSN streams and DetNet flows in the
   control plane.

5.  Security Considerations

   TBA

6.  IANA Considerations

   TBA

7.  Acknowledgements

   The authors would like to thank Peng Liu, Bin Tan, Aihua Liu Shaofu
   Peng for their review, suggestions and comments to this document.

8.  References

8.1.  Normative References

Xiong, et al.           Expires 14 September 2023               [Page 9]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   [I-D.bernardos-detnet-multidomain]
              Bernardos, C. J. and A. Mourad, "DETNET multidomain
              extensions", Work in Progress, Internet-Draft, draft-
              bernardos-detnet-multidomain-01, 12 January 2023,
              <https://datatracker.ietf.org/doc/html/draft-bernardos-
              detnet-multidomain-01>.

   [I-D.dang-queuing-with-multiple-cyclic-buffers]
              Liu, B. and J. Dang, "A Queuing Mechanism with Multiple
              Cyclic Buffers", Work in Progress, Internet-Draft, draft-
              dang-queuing-with-multiple-cyclic-buffers-00, 22 February
              2021, <https://datatracker.ietf.org/doc/html/draft-dang-
              queuing-with-multiple-cyclic-buffers-00>.

   [I-D.du-detnet-layer3-low-latency]
              Du, Z. and P. Liu, "Micro-burst Decreasing in Layer3
              Network for Low-Latency Traffic", Work in Progress,
              Internet-Draft, draft-du-detnet-layer3-low-latency-05, 7
              July 2022, <https://datatracker.ietf.org/doc/html/draft-
              du-detnet-layer3-low-latency-05>.

   [I-D.eckert-detnet-mpls-tc-tcqf]
              Eckert, T. T., Bryant, S., and A. G. Malis, "Deterministic
              Networking (DetNet) Data Plane - MPLS TC Tagging for
              Cyclic Queuing and Forwarding (MPLS-TC TCQF)", Work in
              Progress, Internet-Draft, draft-eckert-detnet-mpls-tc-
              tcqf-03, 11 July 2022,
              <https://datatracker.ietf.org/doc/html/draft-eckert-
              detnet-mpls-tc-tcqf-03>.

   [I-D.guo-detnet-vpfc-planning]
              Guo, D., Wen, G., Yao, K., and G. Peng, "Deterministic
              Networking (DetNet) Controller Plane - VPFC Planning
              Scheme Based on VPFP in Large-scale Deterministic
              Networks", Work in Progress, Internet-Draft, draft-guo-
              detnet-vpfc-planning-01, 15 February 2023,
              <https://datatracker.ietf.org/doc/html/draft-guo-detnet-
              vpfc-planning-01>.

   [I-D.ietf-detnet-controller-plane-framework]
              Malis, A. G., Geng, X., Chen, M., Qin, F., Varga, B., and
              C. J. Bernardos, "Deterministic Networking (DetNet)
              Controller Plane Framework", Work in Progress, Internet-
              Draft, draft-ietf-detnet-controller-plane-framework-04, 13
              March 2023, <https://datatracker.ietf.org/doc/html/draft-
              ietf-detnet-controller-plane-framework-04>.

Xiong, et al.           Expires 14 September 2023              [Page 10]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   [I-D.ietf-detnet-scaling-requirements]
              Liu, P., Li, Y., Eckert, T. T., Xiong, Q., Ryoo, J.,
              zhushiyin, and X. Geng, "Requirements for Scaling
              Deterministic Networks", Work in Progress, Internet-Draft,
              draft-ietf-detnet-scaling-requirements-01, 1 March 2023,
              <https://datatracker.ietf.org/doc/html/draft-ietf-detnet-
              scaling-requirements-01>.

   [I-D.joung-detnet-asynch-detnet-framework]
              Joung, J., Ryoo, J., Cheung, T., Li, Y., and P. Liu,
              "Asynchronous Deterministic Networking Framework for
              Large-Scale Networks", Work in Progress, Internet-Draft,
              draft-joung-detnet-asynch-detnet-framework-01, 24 October
              2022, <https://datatracker.ietf.org/doc/html/draft-joung-
              detnet-asynch-detnet-framework-01>.

   [I-D.peng-detnet-deadline-based-forwarding]
              Peng, S., Liu, P., and D. Yang, "Deadline Based
              Deterministic Forwarding", Work in Progress, Internet-
              Draft, draft-peng-detnet-deadline-based-forwarding-05, 12
              March 2023, <https://datatracker.ietf.org/doc/html/draft-
              peng-detnet-deadline-based-forwarding-05>.

   [I-D.peng-detnet-packet-timeslot-mechanism]
              Peng, S., Liu, A., Liu, P., and D. Yang, "Generic Packet
              Timeslot Scheduling Mechanism", Work in Progress,
              Internet-Draft, draft-peng-detnet-packet-timeslot-
              mechanism-01, 10 March 2023,
              <https://datatracker.ietf.org/doc/html/draft-peng-detnet-
              packet-timeslot-mechanism-01>.

   [I-D.peng-idr-bgp-metric-credit]
              Peng, S. and B. Tan, "BGP Metric Credit Based Routing",
              Work in Progress, Internet-Draft, draft-peng-idr-bgp-
              metric-credit-00, 28 December 2021,
              <https://datatracker.ietf.org/doc/html/draft-peng-idr-bgp-
              metric-credit-00>.

   [I-D.peng-lsr-flex-algo-deterministic-routing]
              Peng, S. and T. Li, "IGP Flexible Algorithm with
              Deterministic Routing", Work in Progress, Internet-Draft,
              draft-peng-lsr-flex-algo-deterministic-routing-03, 24
              August 2022, <https://datatracker.ietf.org/doc/html/draft-
              peng-lsr-flex-algo-deterministic-routing-03>.

   [I-D.pthubert-detnet-ipv6-hbh]
              Thubert, P. and F. Yang, "IPv6 Options for DetNet", Work
              in Progress, Internet-Draft, draft-pthubert-detnet-ipv6-

Xiong, et al.           Expires 14 September 2023              [Page 11]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

              hbh-07, 22 February 2022,
              <https://datatracker.ietf.org/doc/html/draft-pthubert-
              detnet-ipv6-hbh-07>.

   [I-D.stein-srtsn]
              Stein, Y. J., "Segment Routed Time Sensitive Networking",
              Work in Progress, Internet-Draft, draft-stein-srtsn-01, 29
              August 2021, <https://datatracker.ietf.org/doc/html/draft-
              stein-srtsn-01>.

   [I-D.sx-detnet-mpls-queue]
              Song, X. and Q. Xiong, "MPLS Sub-Stack Encapsulation for
              Deterministic Latency Action", Work in Progress, Internet-
              Draft, draft-sx-detnet-mpls-queue-04, 10 March 2023,
              <https://datatracker.ietf.org/doc/html/draft-sx-detnet-
              mpls-queue-04>.

   [I-D.xiong-detnet-6man-queuing-option]
              Xiong, Q. and J. Zhao, "IPv6 Option for DetNet Data
              Fields", Work in Progress, Internet-Draft, draft-xiong-
              detnet-6man-queuing-option-04, 10 March 2023,
              <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-
              6man-queuing-option-04>.

   [I-D.xiong-detnet-data-fields-edp]
              Xiong, Q. and D. Yang, "Data Fields for DetNet Enhanced
              Data Plane", Work in Progress, Internet-Draft, draft-
              xiong-detnet-data-fields-edp-00, 10 March 2023,
              <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-
              data-fields-edp-00>.

   [I-D.xiong-detnet-enhanced-detnet-gap-analysis]
              Xiong, Q., "Gap Analysis for Enhanced DetNet Data Plane",
              Work in Progress, Internet-Draft, draft-xiong-detnet-
              enhanced-detnet-gap-analysis-00, 7 December 2022,
              <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-
              enhanced-detnet-gap-analysis-00>.

   [I-D.xiong-detnet-spring-srh-extensions]
              Xiong, Q., Wu, H., and D. Yang, "Segment Routing Header
              Extensions for DetNet Data Fields", Work in Progress,
              Internet-Draft, draft-xiong-detnet-spring-srh-extensions-
              00, 10 March 2023, <https://datatracker.ietf.org/doc/html/
              draft-xiong-detnet-spring-srh-extensions-00>.

   [I-D.xiong-idr-detnet-flow-mapping]
              Xiong, Q., Wu, H., Zhao, J., and D. Yang, "BGP Flow
              Specification for DetNet and TSN Flow Mapping", Work in

Xiong, et al.           Expires 14 September 2023              [Page 12]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

              Progress, Internet-Draft, draft-xiong-idr-detnet-flow-
              mapping-04, 12 March 2023,
              <https://datatracker.ietf.org/doc/html/draft-xiong-idr-
              detnet-flow-mapping-04>.

   [I-D.xiong-pce-detnet-bounded-latency]
              Xiong, Q. and P. Liu, "PCEP Extension for DetNet Bounded
              Latency", Work in Progress, Internet-Draft, draft-xiong-
              pce-detnet-bounded-latency-01, 9 October 2022,
              <https://datatracker.ietf.org/doc/html/draft-xiong-pce-
              detnet-bounded-latency-01>.

   [RFC2119]  Bradner, S., "Key words for use in RFCs to Indicate
              Requirement Levels", BCP 14, RFC 2119,
              DOI 10.17487/RFC2119, March 1997,
              <https://www.rfc-editor.org/info/rfc2119>.

   [RFC2212]  Shenker, S., Partridge, C., and R. Guerin, "Specification
              of Guaranteed Quality of Service", RFC 2212,
              DOI 10.17487/RFC2212, September 1997,
              <https://www.rfc-editor.org/info/rfc2212>.

   [RFC8174]  Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC
              2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174,
              May 2017, <https://www.rfc-editor.org/info/rfc8174>.

   [RFC8557]  Finn, N. and P. Thubert, "Deterministic Networking Problem
              Statement", RFC 8557, DOI 10.17487/RFC8557, May 2019,
              <https://www.rfc-editor.org/info/rfc8557>.

   [RFC8578]  Grossman, E., Ed., "Deterministic Networking Use Cases",
              RFC 8578, DOI 10.17487/RFC8578, May 2019,
              <https://www.rfc-editor.org/info/rfc8578>.

   [RFC8655]  Finn, N., Thubert, P., Varga, B., and J. Farkas,
              "Deterministic Networking Architecture", RFC 8655,
              DOI 10.17487/RFC8655, October 2019,
              <https://www.rfc-editor.org/info/rfc8655>.

   [RFC8938]  Varga, B., Ed., Farkas, J., Berger, L., Malis, A., and S.
              Bryant, "Deterministic Networking (DetNet) Data Plane
              Framework", RFC 8938, DOI 10.17487/RFC8938, November 2020,
              <https://www.rfc-editor.org/info/rfc8938>.

   [RFC8939]  Varga, B., Ed., Farkas, J., Berger, L., Fedyk, D., and S.
              Bryant, "Deterministic Networking (DetNet) Data Plane:
              IP", RFC 8939, DOI 10.17487/RFC8939, November 2020,
              <https://www.rfc-editor.org/info/rfc8939>.

Xiong, et al.           Expires 14 September 2023              [Page 13]
Internet-Draft   EDP Framework for Scaling Deterministic      March 2023

   [RFC8964]  Varga, B., Ed., Farkas, J., Berger, L., Malis, A., Bryant,
              S., and J. Korhonen, "Deterministic Networking (DetNet)
              Data Plane: MPLS", RFC 8964, DOI 10.17487/RFC8964, January
              2021, <https://www.rfc-editor.org/info/rfc8964>.

   [RFC9320]  Finn, N., Le Boudec, J.-Y., Mohammadpour, E., Zhang, J.,
              and B. Varga, "Deterministic Networking (DetNet) Bounded
              Latency", RFC 9320, DOI 10.17487/RFC9320, November 2022,
              <https://www.rfc-editor.org/info/rfc9320>.

Authors' Addresses

   Quan Xiong
   ZTE Corporation
   No.6 Huashi Park Rd
   Wuhan
   Hubei, 430223
   China
   Email: xiong.quan@zte.com.cn

   ZongPeng Du
   China Mobile
   Beijing
   China
   Email: duzongpeng@chinamobile.com

   Junfeng Zhao
   CAICT
   China
   Email: zhaojunfeng@caict.ac.cn

   Dong Yang
   Beijing Jiaotong University
   Beijing
   China
   Email: dyang@bjtu.edu.cn

Xiong, et al.           Expires 14 September 2023              [Page 14]