Internet-Draft Traffic Engineering Extensions for Enhan October 2023
Xiong, et al. Expires 25 April 2024 [Page]
Intended Status:
Standards Track
Q. Xiong, Ed.
ZTE Corporation
B. Tan
ZTE Corporation
Z. Du
China Mobile
J. Zhao
C. Liu
China Unicom
D. Yang
Beijing Jiaotong University

Traffic Engineering Extensions for Enhanced DetNet


As per [I-D.ietf-teas-rfc3272bis], DetNet can also be seen as a specialized branch of TE. As it is required to provide enhancements for data plane in scaling networks, this document proposes a set of extensions for traffic engineering to achieve the differentiated DetNet QoS in enhanced DetNet.

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

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 25 April 2024.

Table of Contents

1. Introduction

As defined in [I-D.ietf-teas-rfc3272bis], Traffic Engineering (TE) is mainly focus on the control and optimization of routing and forwarding functions to steer traffic through the network. TE can deal with the issues with performance evaluation and performance optimization of operational IP networks and address the traffic oriented performance requirements including delay, delay variation, packet loss, and throughput while utilizing network resources. 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 DetNet QoS includes the bounded latency indicating the minimum and maximum end-to-end latency from source to destination and bounded jitter (packet delay variation). Three techniques are used by DetNet to provide these qualities of service including service protection, explicit routes and resource allocation.

As per [I-D.ietf-teas-rfc3272bis], DetNet can also be seen as a specialized branch of TE. The DetNet forwarding sub-layer provides resource allocations and explicit routes to guarantee the bounded latency, using existing TE mechanisms such as SR-TE, MPLS-TE and so on. But the enhanced DetNet is required to provide the packet treatment for data plane to achieve the DetNet QoS in large-scale networks. [I-D.ietf-detnet-scaling-requirements] has described the enhanced requirements for DetNet enhanced data plane including the deterministic latency guarantees.

[I-D.xiong-detnet-large-scale-enhancements] has proposed the framework of enhanced DetNet data plane for packet treatment which should support new functions such as queuing mechanisms to ensure the deterministic latency. A common data fields can be defined as per [I-D.xiong-detnet-data-fields-edp] and a Deterministic Latency Action (DLA) option has been proposed to carry DetNet-specific metadata. The existing TE mechanisms for resource allocations and explicit routes are not sufficient for enhanced DetNet. For example, the explicit routes should consider the queuing information when selecting and distributing the explicit path. And the resource management should be provisioned including the resource reservations and allocations. The TE mechanisms should consider the queuing-based or time-based resources.

Moreover, as per [I-D.ietf-teas-rfc3272bis], DetNet is required to maintain per-flow state information and provide resource reservation for individual flows. As discussed in [I-D.xiong-detnet-enhanced-detnet-gap-analysis], it should deal with large-scale dynamic deterministic flows and large-scale network topology in enhanced DetNet. It may be challenging for network operations in large-scale networks even if the flow aggregation may be supported. As discussed in [I-D.xiong-detnet-large-scale-enhancements], it may provide traffic scheduling instead of the flow scheduling and support the TE control at traffic-aggregate level than the per-flow or flow-aggregate level.

Moreover, as per I-D.xiong-detnet-differentiated-detnet-aware-qos describes that multiple deterministic services may demand different set of SLAs and it should define more than one DetNet QoS levels according to different application scenarios. The TE mechanisms in enhanced DetNet should support the the Differentiated DetNet QoS of Multiple Services while utilizing network resources.

As per [I-D.ietf-teas-rfc3272bis], DetNet can also be seen as a specialized branch of TE. As it is required to provide enhancements for data plane in scaling networks, this document proposes a set of extensions for traffic engineering to achieve the differentiated DetNet QoS in enhanced DetNet.

1.1. Requirements Language

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119 [RFC2119].

2. Terminology

The terminology is defined as [RFC8655].

DD-TE: Differentiated DetNet-aware Traffic Engineering

DT: Deterministic Class-Type

TRC: Time-based Resources Container

3. Traffic Engineering for Differentiated DetNet QoS

As per [I-D.ietf-teas-rfc3272bis], DetNet can be viewed as a TE mechanism to achieve DetNet QoS. DetNet performs the per-flow or flow-aggregate scheduling in service sub-layer and uses resource allocations and explicit route mechanisms in forwarding sub-layer. And DetNet can be applied in existing TE data plane mechanisms such as IP, MPLS-TE and SR-TE.

As the enhanced DetNet should support the differentiated DetNet QoS, the document proposes a set of extensions for traffic engineering to achieve differentiated DetNet QoS in enhanced DetNet called Differentiated DetNet-aware Traffic Engineering (DD-TE). DD-TE can be used to achieve multiple classes of deterministic services and optimize the resources utilization in scaling networks.

The key elements required in DD-TE solution are as follows:

1. Policy

As per [I-D.ietf-teas-rfc3272bis], policy allows for the selection of paths (including next hops) based on information beyond basic reachability. The routing policy including bounded latency constraint-based routing can be considered when selecting and distributing the candidate paths. As per [I-D.peng-lsr-flex-algo-deterministic-routing], deterministic routes can be established along the constraint-based paths within a Flex-Algorithm topology. As per [I-D.xiong-pce-detnet-bounded-latency], deterministic paths can be computed in PCE or controller with the deterministic latency constraints. As defined in [I-D.xiong-idr-detnet-flow-mapping], the BGP flowspec can be used to apply the DetNet flows mapping policy.

2. Path steering

As per [I-D.ietf-teas-rfc3272bis], path steering is the ability to forward packets using more information than just knowledge of the next hop. The per-flow or flow-aggregate scheduling is not applicable since it requires a large amount of control signaling to establish and maintain DetNet flows when it will be large-scale dynamic deterministic flows and large-scale network topology in scaling networks of enhanced DetNet. As discussed in [I-D.xiong-detnet-large-scale-enhancements], it may provide traffic scheduling in enhanced DetNet data plane and provide 4 DetNet traffic classes for Differentiated DetNet QoS. So the DD-TE mechanism should use the traffic class information to forward packets at traffic-aggregate level instead of the per-flow or flow-aggregate level.

As per [I-D.xiong-detnet-large-scale-enhancements], in scaling networks of enhanced DetNet data plane, the enhanced QoS-related functions and metadata has been proposed to guarantee the bounded latency such as the queuing-based mechanisms and metadata. The deterministic latency information may be provided to forward packets for path steering. DD-TE can be applied in TE data plane such as IPv6 [I-D.xiong-detnet-6man-queuing-option], MPLS [] and SRv6 [I-D.xiong-detnet-spring-srh-extensions].

3. Resource management

As per [I-D.xiong-detnet-large-scale-enhancements], the resource management should support the time-based resource-aware control and forwarding including resource reservations and allocations. The time-based resource should cover the queuing and scheduling mechanisms based on the capability of end-to-end delay, jitter and loss. To guarantee the time-based resource, the resource control in layers model section 5 may be provided to avoid the conflict between DetNet flows to achieve differentiated DetNet QoS and high resources utilization.

4. Layers Model of DD-TE

The resource control of DD-TE is important to regulate the traffic, deliver different levels of services and alleviate congestion issues to guarantee the bounded latency. It needs to resolve competition for network resources between traffic flows belonging to the same service class (intra-class contention resolution) and traffic flows belonging to different classes (inter-class contention resolution).

This document proposes the layers model for enhanced DetNet control plane to configure the deterministic services to achieve differentiated DetNet QoS. The DetNet TE domains in control plane can be divided into three layers including deterministic links, deterministic paths and deterministic services as shown in Figure 1.

Deterministic Services:|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~>|

Deterministic Paths:   +.............................................>+

Deterministic Links:      O---------------->O   O--------------->O
                          O---------------->O   O--------------->O
                          O---------------->O   O--------------->O

                      +-----+              +-----+              +-----+
DetNet Domain:        |  A  |--------------|  B  |--------------|  C  |
                      +--+--+              +--+--+              +--+--+

Figure 1: The DD-TE Layers Model

The Layers Model of DD-TE has the following characteristics:

The deterministic links as defined in I-D.xiong-lsr-detnet-deterministic-links provide a one-dimensional deterministic metric to guarantee the deterministic forwarding capabilities at different levels.

The deterministic link has the following attributes:

4.2. Deterministic Paths

When DetNet services with different SLA requirements requested to transmit, one or more deterministic paths may be calculated based on the deterministic links. The deterministic paths may be co-existed with the same DT and the time-based resources should be planned when each path is established.

The deterministic paths has the following attributes:

4.3. Deterministic Services

The deterministic services may be configured to map the DetNet flows to the corresponding path.

The deterministic services has the following attributes:

5. Control Plane Extensions for DD-TE

3-Service Request-->|Controller|-->4-Deterministic Path Planning
                        |  ^ 2-Deterministic Links Resource Report
                        |  |
                        |  |
                        |  |
    5-Path Distribution V  |
      .                                               .
      . 1-Resoure Collection                          .
      .                                               .
Flow  .    +---+            +---+            +---+    .
+---> .    | A |------------| B |------------| C |    .
|     .    +---+            +---+            +---+    .
|     .               DetNet Domain                   .
|     .                                               .
|     . 6-Path Establishment and Resource Allocation   .
|     .                                               .
|     .................................................
|-->7-Admision Control and Traffic Policy of Deterministic service

Figure 2: The Control Plane for DD-TE

5.1. Configuration of Queuing Mechanisms

As described in [I-D.ietf-detnet-scaling-requirements], 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 information model as defined in [I-D.guo-detnet-vpfc-planning].

5.2. Deterministic Resource Collection

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-deterministic-traffic-engineering] and I-D.xiong-lsr-detnet-deterministic-link.

5.3. 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].

5.4. 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].

5.5. Deterministic Path Computation and Resource Planning

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.

5.6. 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.

6. Security Considerations


7. IANA Considerations


8. Acknowledgements


9. References

9.1. Normative References

Bernardos, C. J. and A. Mourad, "DETNET multidomain extensions", Work in Progress, Internet-Draft, draft-bernardos-detnet-multidomain-02, , <>.
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, , <>.
Guo, D., Wen, G., Yao, K., Xiong, Q., and G. Peng, "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-02, , <>.
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, , <>.
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-04, , <>.
Farrel, A., "Overview and Principles of Internet Traffic Engineering", Work in Progress, Internet-Draft, draft-ietf-teas-rfc3272bis-27, , <>.
Peng, S., Tan, B., and P. Liu, "Deadline Option", Work in Progress, Internet-Draft, draft-peng-6man-deadline-option-01, , <>.
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-07, , <>.
Peng, S. and B. Tan, "BGP Metric Credit Based Routing", Work in Progress, Internet-Draft, draft-peng-idr-bgp-metric-credit-00, , <>.
Peng, S., "IGP Extensions for Deterministic Traffic Engineering", Work in Progress, Internet-Draft, draft-peng-lsr-deterministic-traffic-engineering-01, , <>.
Peng, S. and T. Li, "IGP Flexible Algorithm with Deterministic Routing", Work in Progress, Internet-Draft, draft-peng-lsr-flex-algo-deterministic-routing-03, , <>.
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, , <>.
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, , <>.
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, , <>.
Xiong, Q., "Gap Analysis for Enhanced DetNet Data Plane", Work in Progress, Internet-Draft, draft-xiong-detnet-enhanced-detnet-gap-analysis-01, , <>.
Xiong, Q., Du, Z., Zhao, J., and D. Yang, "Enhanced DetNet Data Plane (EDP) Framework for Scaling Deterministic Networks", Work in Progress, Internet-Draft, draft-xiong-detnet-large-scale-enhancements-03, , <>.
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, , <>.
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, , <>.
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, , <>.
Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, , <>.
Farrel, A., Vasseur, J.-P., and J. Ash, "A Path Computation Element (PCE)-Based Architecture", RFC 4655, DOI 10.17487/RFC4655, , <>.
Psenak, P., Mirtorabi, S., Roy, A., Nguyen, L., and P. Pillay-Esnault, "Multi-Topology (MT) Routing in OSPF", RFC 4915, DOI 10.17487/RFC4915, , <>.
Przygienda, T., Shen, N., and N. Sheth, "M-ISIS: Multi Topology (MT) Routing in Intermediate System to Intermediate Systems (IS-ISs)", RFC 5120, DOI 10.17487/RFC5120, , <>.
Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation Element (PCE) Communication Protocol (PCEP)", RFC 5440, DOI 10.17487/RFC5440, , <>.
Lindem, A., Roy, A., and S. Mirtorabi, "OSPFv2 Multi-Instance Extensions", RFC 6549, DOI 10.17487/RFC6549, , <>.
Gredler, H., Ed., Medved, J., Previdi, S., Farrel, A., and S. Ray, "North-Bound Distribution of Link-State and Traffic Engineering (TE) Information Using BGP", RFC 7752, DOI 10.17487/RFC7752, , <>.
Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, , <>.
Crabbe, E., Minei, I., Medved, J., and R. Varga, "Path Computation Element Communication Protocol (PCEP) Extensions for Stateful PCE", RFC 8231, DOI 10.17487/RFC8231, , <>.
Dhody, D., Wu, Q., Manral, V., Ali, Z., and K. Kumaki, "Extensions to the Path Computation Element Communication Protocol (PCEP) to Compute Service-Aware Label Switched Paths (LSPs)", RFC 8233, DOI 10.17487/RFC8233, , <>.
Finn, N., Thubert, P., Varga, B., and J. Farkas, "Deterministic Networking Architecture", RFC 8655, DOI 10.17487/RFC8655, , <>.
Sivabalan, S., Filsfils, C., Tantsura, J., Henderickx, W., and J. Hardwick, "Path Computation Element Communication Protocol (PCEP) Extensions for Segment Routing", RFC 8664, DOI 10.17487/RFC8664, , <>.
Varga, B., Ed., Farkas, J., Berger, L., Malis, A., and S. Bryant, "Deterministic Networking (DetNet) Data Plane Framework", RFC 8938, DOI 10.17487/RFC8938, , <>.
Finn, N., Le Boudec, J.-Y., Mohammadpour, E., Zhang, J., and B. Varga, "Deterministic Networking (DetNet) Bounded Latency", RFC 9320, DOI 10.17487/RFC9320, , <>.
Xiong, Q., "Label Switched Path (LSP) Object Flag Extension for Stateful PCE", RFC 9357, DOI 10.17487/RFC9357, , <>.

Authors' Addresses

Quan Xiong (editor)
ZTE Corporation
Bin Tan
ZTE Corporation
Zongpeng Du
China Mobile
Junfeng Zhao
Chang Liu
China Unicom
No.9 Shouti Nanlu
Dong Yang
Beijing Jiaotong University