| Internet-Draft | Enhanced DetNet Data Plane Framework for | February 2024 |
| Xiong, et al. | Expires 29 August 2024 | [Page] |
- Workgroup:
- DETNET
- Internet-Draft:
- draft-xiong-detnet-large-scale-enhancements-04
- Published:
- Intended Status:
- Informational
- Expires:
Enhanced DetNet Data Plane Framework for Scaling Deterministic Networks
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 scaling networks.¶
This document proposes the enhancement of the framework to support the functions and metadata for enhanced DetNet data plane.¶
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 29 August 2024.¶
Copyright Notice
Copyright (c) 2024 IETF Trust and the persons identified as the document authors. All rights reserved.¶
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.¶
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 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 QoS in large-scale networks. The Enhanced Data Plane for DetNet (EDP) is required to support a data plane method of flow identification and packet treatment. As per [I-D.zhao-detnet-enhanced-use-cases], various deterministic applications are co-existed with different SLAs guarantees in scaling networks. [I-D.xiong-detnet-enhanced-detnet-gap-analysis] has described the characteristics of scaling deterministic networks and analyzed the existing technologies gaps especially applying the DetNet data plane as per [RFC8938]. [I-D.ietf-detnet-scaling-requirements] has described the enhancement requirements for enhanced DetNet data plane. 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 data plane such as IP/MPLS/SRv6 Data Plane.¶
This document proposes the enhancement of the framework to support the functions and metadata for enhanced DetNet data plane.¶
2. Conventions used in this document
2.1. Terminology
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:¶
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.¶
+----------------------------------+
|Service sub-layer: |
| |
| Flow Aggregation |
+----------------------------------+
|Forwarding sub-layer: |
| |
| Deterministic Routes |
| Time-based Resources Allocation |
| Queuing Mechanisms |
+----------------------------------+
3.1.1. Flow Aggregation
From the perspective of differentiated services requirements in [I-D.ietf-detnet-scaling-requirements], 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 aggregate-class level identification of multiple flows to achieve the differentiated deterministic QoS for each DetNet flow. It may also downscale the network operations with a large number of deterministic flows and network nodes in scaling networks. DetNet service sub-layer SHOULD provide the flow aggregation function based on the classified QoS requirements to improve the scalability in enhanced DetNet.¶
3.1.2. Deterministic Routes
As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis], 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. The deterministic routes 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. Moreover, the enhanced DetNet data plane should perform the deterministic routes and forwarding at different classes.¶
DetNet forwarding sub-layer may provide the deterministic routes function in enhanced DetNet data plane for the deterministic routing and forwarding of traffic from ingress nodes to egress nodes.¶
3.1.2.1. Deterministic Links
As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis], 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. The deterministic links should be used to provide a one-dimensional deterministic metric to guarantee for the deterministic forwarding capabilities at different levels as defined in [I-D.xiong-lsr-detnet-deterministic-links]. The deterministic links are provided and distributed to support the deterministic resource and forwarding capabilities indicated by Deterministic Class-Type (DT).¶
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 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. Deterministic Paths
When DetNet services with different SLA requirements requested to transmit, one or more deterministic paths may be established based on the deterministic links. In the distributed scenario, deterministic loose routes are computed on the device through routing protocols. Interior Gateway Protocol (IGP) [I-D.peng-lsr-flex-algo-deterministic-routing] is used to compute deterministic routes based on deterministic-delay inside a domain, and Border Gateway Protocol (BGP) [I-D.peng-idr-bgp-metric-credit] is used to compute deterministic routes based on accurate delay/jitter across domains.¶
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. As per [I-D.bernardos-detnet-multidomain], technical gaps are existing in multi-domain DetNet scenarios. 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.¶
3.1.3. Time-based Resources Allocation
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.¶
As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis] section 3.3.2, the allocation of queuing related resources or time-based resources should be taken into consideration in enhanced DetNet data plane. The DetNet networks need to shield the differences between network capabilities. Deterministic resource is the basis for providing deterministic services. It refers to the time-based 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. Time-based Resources Container (TRC) is defined to provide the time-based resources with different classes. The container contains the corresponding scheduling resources reserved in control plane to guarantee the capability and then the time-based resources should be allocated in enhanced DetNet data plane.¶
DetNet forwarding sub-layer may provide the time-based resources allocation function in enhanced DetNet data plane for the allocation of specific nodes and deterministic link time-based resources to specific flows and classes. It also provide the admission control of a flow to a particular class of allocated resources.¶
3.1.4. Queuing Mechanisms
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 extended such as the Cycle Specified Queuing and Forwarding (CSQF) [I-D.chen-detnet-sr-based-bounded-latency] and Tagged Cyclic Queuing and Forwarding (TCQF) [I-D.eckert-detnet-tcqf]. 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 Fair Queuing (FQ) mechanism includes the extension such as Work Conserving Stateless Core Fair Queuing (C-SCORE) [I-D.joung-detnet-stateless-fair-queuing]. The timeslot-based queuing mechanism has been proposed in Timeslot Queuing and Forwarding (TQF)[I-D.peng-detnet-packet-timeslot-mechanism].¶
DetNet forwarding sub-layer may provide the queuing and scheduling mechanisms in enhanced DetNet data plane to achieve the end-to-end bounded latency and multiple mechanisms may be proposed to provide different levels of bounded latency guarantees.¶
3.2. Enhancements of DetNet-Specific Metadata
1. deterministic latency information¶
DetNet forwarding sub-layer may provide the enhanced function and technology such as multiple queuing mechanisms and traffic treatment for DetNet application flows to guarantee the deterministic latency. The enhanced DetNet data plane may encode the deterministic latency related information in packets.¶
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 SRv6 [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.¶
2. aggregated class information¶
As per [I-D.ietf-detnet-scaling-requirements], the deterministic services may demand different deterministic QoS requirements according to different levels of application requirements. The flow aggregation on class-level and explicit flow identification should be supported. The enhanced DetNet data plane may also encode the aggregated class information in packets. The deterministic latency information and the aggregated class information as per [I-D.xiong-detnet-data-fields-edp] may be used alone or together to indicate the required queuing and forwarding behaviours. The aggregated class information can also reuse the IP DSCP or MPLS TC field.¶
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-tcqf].¶
4. Security Considerations
TBA¶
6. Acknowledgements
The authors would like to thank Peng Liu, Bin Tan, Aihua Liu Shaofu Peng for their review, suggestions and comments to this document.¶
7. References
7.1. Normative References
- [I-D.bernardos-detnet-multidomain]
- Bernardos, C. J. and A. Mourad, "DETNET multidomain extensions", Work in Progress, Internet-Draft, draft-bernardos-detnet-multidomain-02, , <https://datatracker.ietf.org/doc/html/draft-bernardos-detnet-multidomain-02>.
- [I-D.chen-detnet-sr-based-bounded-latency]
- Chen, M., Geng, X., Li, Z., Joung, J., and J. Ryoo, "Segment Routing (SR) Based Bounded Latency", Work in Progress, Internet-Draft, draft-chen-detnet-sr-based-bounded-latency-03, , <https://datatracker.ietf.org/doc/html/draft-chen-detnet-sr-based-bounded-latency-03>.
- [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, , <https://datatracker.ietf.org/doc/html/draft-du-detnet-layer3-low-latency-05>.
- [I-D.eckert-detnet-tcqf]
- Eckert, T. T., Li, Y., Bryant, S., Malis, A. G., Ryoo, J., Liu, P., Li, G., Ren, S., and F. Yang, "Deterministic Networking (DetNet) Data Plane - Tagged Cyclic Queuing and Forwarding (TCQF) for bounded latency with low jitter in large scale DetNets", Work in Progress, Internet-Draft, draft-eckert-detnet-tcqf-05, , <https://datatracker.ietf.org/doc/html/draft-eckert-detnet-tcqf-05>.
- [I-D.guo-detnet-vpfc-planning]
- Guo, D., Wen, G., Yao, K., Xiong, Q., Peng, G., Xuejun, Y., and zhushiyin, "Deterministic Networking (DetNet) Controller Plane - VPFC Planning Information Model Based on VPFP in Scaling Deterministic Networks", Work in Progress, Internet-Draft, draft-guo-detnet-vpfc-planning-03, , <https://datatracker.ietf.org/doc/html/draft-guo-detnet-vpfc-planning-03>.
- [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-05, , <https://datatracker.ietf.org/doc/html/draft-ietf-detnet-controller-plane-framework-05>.
- [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-05, , <https://datatracker.ietf.org/doc/html/draft-ietf-detnet-scaling-requirements-05>.
- [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-03, , <https://datatracker.ietf.org/doc/html/draft-joung-detnet-asynch-detnet-framework-03>.
- [I-D.joung-detnet-stateless-fair-queuing]
- Joung, J., Ryoo, J., Cheung, T., Li, Y., and P. Liu, "Latency Guarantee with Stateless Fair Queuing", Work in Progress, Internet-Draft, draft-joung-detnet-stateless-fair-queuing-01, , <https://datatracker.ietf.org/doc/html/draft-joung-detnet-stateless-fair-queuing-01>.
- [I-D.peng-detnet-deadline-based-forwarding]
- Peng, S., Du, Z., Basu, K., cheng, Yang, D., and C. Liu, "Deadline Based Deterministic Forwarding", Work in Progress, Internet-Draft, draft-peng-detnet-deadline-based-forwarding-08, , <https://datatracker.ietf.org/doc/html/draft-peng-detnet-deadline-based-forwarding-08>.
- [I-D.peng-detnet-packet-timeslot-mechanism]
- Peng, S., Liu, P., Basu, K., Liu, A., Yang, D., and G. Peng, "Timeslot Queueing and Forwarding Mechanism", Work in Progress, Internet-Draft, draft-peng-detnet-packet-timeslot-mechanism-05, , <https://datatracker.ietf.org/doc/html/draft-peng-detnet-packet-timeslot-mechanism-05>.
- [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, , <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, , <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-hbh-07, , <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, , <https://datatracker.ietf.org/doc/html/draft-stein-srtsn-01>.
- [I-D.sx-detnet-mpls-queue]
- Song, X., Xiong, Q., and R. Gandhi, "MPLS Sub-Stack Encapsulation for Deterministic Latency Action", Work in Progress, Internet-Draft, draft-sx-detnet-mpls-queue-06, , <https://datatracker.ietf.org/doc/html/draft-sx-detnet-mpls-queue-06>.
- [I-D.xiong-detnet-6man-queuing-option]
- Xiong, Q., Zhao, J., and R. Gandhi, "IPv6 Option for DetNet Data Fields", Work in Progress, Internet-Draft, draft-xiong-detnet-6man-queuing-option-05, , <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-6man-queuing-option-05>.
- [I-D.xiong-detnet-data-fields-edp]
- Xiong, Q., Liu, A., Gandhi, R., and D. Yang, "Data Fields for DetNet Enhanced Data Plane", Work in Progress, Internet-Draft, draft-xiong-detnet-data-fields-edp-01, , <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-data-fields-edp-01>.
- [I-D.xiong-detnet-enhanced-detnet-gap-analysis]
- Xiong, Q. and A. Liu, "Gap Analysis for Enhanced DetNet", Work in Progress, Internet-Draft, draft-xiong-detnet-enhanced-detnet-gap-analysis-03, , <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-enhanced-detnet-gap-analysis-03>.
- [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-01, , <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-spring-srh-extensions-01>.
- [I-D.xiong-detnet-teas-te-extensions]
- Xiong, Q., Tan, B., Du, Z., Zhao, J., Liu, C., and D. Yang, "Traffic Engineering Extensions for Enhanced DetNet", Work in Progress, Internet-Draft, draft-xiong-detnet-teas-te-extensions-01, , <https://datatracker.ietf.org/doc/html/draft-xiong-detnet-teas-te-extensions-01>.
- [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 Progress, Internet-Draft, draft-xiong-idr-detnet-flow-mapping-05, , <https://datatracker.ietf.org/doc/html/draft-xiong-idr-detnet-flow-mapping-05>.
- [I-D.xiong-lsr-detnet-deterministic-links]
- Xiong, Q. and X. Qian, "IGP Extensions for DetNet Deterministic Links", Work in Progress, Internet-Draft, draft-xiong-lsr-detnet-deterministic-links-00, , <https://datatracker.ietf.org/doc/html/draft-xiong-lsr-detnet-deterministic-links-00>.
- [I-D.xiong-pce-detnet-bounded-latency]
- Xiong, Q., Liu, P., and R. Gandhi, "PCEP Extension for DetNet Bounded Latency", Work in Progress, Internet-Draft, draft-xiong-pce-detnet-bounded-latency-03, , <https://datatracker.ietf.org/doc/html/draft-xiong-pce-detnet-bounded-latency-03>.
- [I-D.zhao-detnet-enhanced-use-cases]
- Zhao, J., Xiong, Q., and Z. Du, "Enhanced Use cases for Scaling Deterministic Networks", Work in Progress, Internet-Draft, draft-zhao-detnet-enhanced-use-cases-00, , <https://datatracker.ietf.org/doc/html/draft-zhao-detnet-enhanced-use-cases-00>.
- [RFC2119]
- Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, , <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, , <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, , <https://www.rfc-editor.org/info/rfc8174>.
- [RFC8557]
- Finn, N. and P. Thubert, "Deterministic Networking Problem Statement", RFC 8557, DOI 10.17487/RFC8557, , <https://www.rfc-editor.org/info/rfc8557>.
- [RFC8578]
- Grossman, E., Ed., "Deterministic Networking Use Cases", RFC 8578, DOI 10.17487/RFC8578, , <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, , <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, , <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, , <https://www.rfc-editor.org/info/rfc8939>.
- [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, , <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, , <https://www.rfc-editor.org/info/rfc9320>.