sync reader
5G 延迟和抖动对 5G-TSN 网络中 TAS 调度的影响:实证研究
Impact of 5G Latency and Jitter on TAS Scheduling in a 5G-TSN Network: An Empirical Study · 2026-03-07
本页提供英文原文段落与中文逐段译稿。译稿包含自动复核状态;标记为需人工复核的段落应回到 PDF/HTML 校对公式、表格和符号。
- 本站范围
- 全文逐段对照
- 内容来源
- 本地英文段落 + 中文译稿
- 阅读规模
- 124/124 段已生成译稿
本地保存的可公开原文段落,随页面一起滚动
自动复核标记:22 段需要人工回看公式、表格或符号
Industrial Internet of Things (IIoT) enables tightly integrated Cyber-Physical Systems (CPSs), which are critical for manufacturing automation in modern Industry 4.0. These systems demand deterministic, low-latency communication to guarantee safe and predictable operation in dynamic industrial environments [ 1 ]. Among the most demanding IIoT applications are Connected Robotics and Autonomous Systems (CRAS), including Autonomous Mobile Robots (AMRs), drones, and intelligent agents. These systems rely on precise coordination between sensing, computing, and actuation, and are highly sensitive to communication delays and jitter [ 2 ].
工业物联网(Industrial Internet of Things, IIoT)使紧密集成的网络物理系统(Cyber-Physical Systems, CPSs)成为可能,而这些系统对于现代工业 4.0 中的制造自动化至关重要。这些系统需要确定性、低时延通信,以保证在动态工业环境中的安全且可预测的运行 [1]。在要求最严苛的 IIoT 应用中,包括互联机器人与自主系统(Connected Robotics and Autonomous Systems, CRAS),例如自主移动机器人(Autonomous Mobile Robots, AMRs)、无人机以及智能代理。这些系统依赖于感知、计算和执行之间的精确协调,并且对通信时延和抖动高度敏感 [2]。
术语 IIoT、CPSs、CRAS、AMRs 均已保留并给出中文;“deterministic, low-latency communication”译为“确定性、低时延通信”符合 TSN 语境;引用 [1]、[2] 未遗漏。未发现明显问题。
To meet these demands, Time-Sensitive Networking (TSN) standards define mechanisms that enable deterministic communication over wired Ethernet infrastructures [ 3 ]. One of the key components of TSN is the IEEE 802.1Qbv Time-Aware Shaper (TAS), which operates at the output ports of TSN switches. TAS enforces scheduled access to the transmission medium by periodically opening and closing gates that control the egress of packets from different traffic queues. By precisely determining when each queue is allowed to transmit, TAS ensures bounded delay and low jitter for selected traffic classes. This deterministic behavior is essential to support time-critical IIoT applications that require guaranteed communication performance [ 4 ]. Nevertheless, TSN ’s reliance on wired infrastructure limits mobility and flexibility, especially in complex industrial settings.
为满足这些需求,时间敏感网络(Time-Sensitive Networking, TSN)标准定义了一些机制,使有线以太网基础设施上的确定性通信成为可能 [3]。TSN 的关键组件之一是 IEEE 802.1Qbv 时间感知整形器(Time-Aware Shaper, TAS),它在 TSN 交换机的输出端口处运行。TAS 通过周期性地打开和关闭门控来强制执行对传输介质的调度访问,这些门控控制来自不同流量队列的数据包的出端口发送。通过精确确定每个队列被允许发送的时间,TAS 为选定的流量类别确保有界时延和低抖动。这种确定性行为对于支持需要有保证通信性能的时间关键型 IIoT 应用至关重要 [4]。然而,TSN 对有线基础设施的依赖限制了移动性和灵活性,尤其是在复杂工业场景中。
IEEE 802.1Qbv、TAS、TSN 等缩写保留完整;“egress”译为“出端口发送”以贴合交换机队列语境;“bounded delay”译为“有界时延”;转折 “Nevertheless” 已译出。未发现明显问题。
To overcome these limitations, 5th Generation (5G) mobile networks offer mobility, flexibility, wide-area coverage, and ultra-Reliable and Low-Latency Communications (uRLLC) capabilities, which have sparked significant interest in integrating 5G with TSN for industrial scenarios [ 5 ]. In this paradigm, industrial end devices such as robots and production line equipment connect wirelessly to the network via the 5G system. The 5G network provides access to a wired TSN backbone composed of TSN switches connected to edge computing platforms hosting IIoT control functions. This integration aims to combine 5G mobility and coverage with TSN determinism. However, the stochastic nature of 5G, characterized by variable delay in the radio and core segments, disrupts the strict timing required by TAS. This variability challenges the achievement of End-to-End (E2E) deterministic communication.
为克服这些限制,第五代(5th Generation, 5G)移动网络提供移动性、灵活性、广域覆盖以及超可靠低时延通信(ultra-Reliable and Low-Latency Communications, uRLLC)能力,这些能力已经激发了将 5G 与 TSN 集成用于工业场景的显著兴趣 [5]。在这一范式中,机器人和生产线设备等工业终端设备通过 5G 系统以无线方式接入网络。5G 网络提供对有线 TSN 骨干网的访问,该骨干网由连接到边缘计算平台的 TSN 交换机构成,而这些边缘计算平台承载 IIoT 控制功能。这种集成旨在将 5G 的移动性和覆盖能力与 TSN 的确定性结合起来。然而,5G 的随机性特征,即无线段和核心网段中的可变时延,会破坏 TAS 所要求的严格时序。这种可变性对实现端到端(End-to-End, E2E)确定性通信构成挑战。
uRLLC、E2E、TAS 等缩写已保留;“radio and core segments”译为“无线段和核心网段”;“stochastic nature”译为“随机性特征”准确;因果与转折关系完整。未发现明显问题。
To address these challenges, TAS configurations must be carefully adapted to maintain synchronized transmissions across TSN switches. In particular, these configurations must compensate for the delay variability introduced by the 5G system while avoiding excessive buffering, added latency, or bandwidth inefficiencies. Ensuring proper alignment of transmission windows is essential to preserve the deterministic guarantees required by time-sensitive IIoT applications.
为应对这些挑战,必须仔细调整 TAS 配置,以维持跨 TSN 交换机的同步传输。特别是,这些配置必须补偿 5G 系统引入的时延可变性,同时避免过度缓冲、额外时延或带宽效率低下。确保传输窗口的正确对齐,对于保持时间敏感型 IIoT 应用所要求的确定性保证至关重要。
“TAS configurations”译为“TAS 配置”;“transmission windows”译为“传输窗口”;“bandwidth inefficiencies”译为“带宽效率低下”。逻辑上包含补偿与避免副作用两个并列要求,未遗漏。未发现明显问题。
Literature Review. The 5G - TSN integration has drawn substantial research interest. Prior works have explored architectures where 5G functions as a logical TSN switch and have proposed solutions for time synchronization and Quality of Service (QoS) mapping between domains. Simulation studies have also evaluated TAS scheduling and jitter mitigation; however, these typically rely on idealized wireless models. Although such studies have advanced the understanding of 5G - TSN integration, critical challenges remain in tuning TAS parameters to compensate for realistic 5G delay and jitter dynamics. In particular, there is a lack of experimental validation under commercial 5G conditions. For interested readers, a detailed literature review is provided in Section VII.
文献综述。5G-TSN 集成已经引起了大量研究兴趣。已有工作探索了 5G 作为逻辑 TSN 交换机发挥作用的架构,并提出了用于域间时间同步和服务质量(Quality of Service, QoS)映射的解决方案。仿真研究也评估了 TAS 调度和抖动缓解;然而,这些研究通常依赖理想化的无线模型。尽管此类研究推进了对 5G-TSN 集成的理解,但在调整 TAS 参数以补偿真实 5G 时延和抖动动态方面,关键挑战仍然存在。特别是,在商用 5G 条件下仍缺乏实验验证。对于感兴趣的读者,第 VII 节提供了详细的文献综述。
“Literature Review”按论文小标题译为“文献综述”;QoS、TAS 保留;“commercial 5G conditions”译为“商用 5G 条件”;“Section VII”译为“第 VII 节”。未发现明显问题。
Contributions. This article analyzes the impact of 5G -induced delay and jitter on the operation of the IEEE 802.1Qbv TAS in an integrated 5G - TSN network, focusing on the configuration of TAS scheduling parameters to accommodate a delay-critical traffic flow. The main contributions are:
贡献。本文分析了 5G 引入的时延和抖动对集成 5G-TSN 网络中 IEEE 802.1Qbv TAS 运行的影响,重点关注 TAS 调度参数的配置,以适配一个时延关键型流量流。主要贡献如下:
“Contributions”译为“贡献”;“5G-induced delay and jitter”译为“5G 引入的时延和抖动”;“delay-critical traffic flow”译为“时延关键型流量流”。该段以冒号引出后续贡献,结构保留。未发现明显问题。
C1 We provide a detailed analysis of the delay components involved in the transmission of packets between adjacent TAS -enabled TSN switches interconnected via a 5G network. This analysis characterizes how 5G -induced delays and jitter interact with TAS parameters, and quantifies their impact on E2E latency performance. C2 Based on this analysis, we identify the conditions under which deterministic communication can be achieved in 5G - TSN networks. We thoroughly investigate the resulting scenarios arising from different TAS parameter configurations and provide general configuration guidelines to ensure deterministic behavior. C3 We implement an experimental testbed integrating a commercial private 5G network and TAS -enabled TSN switches, enabling real-world evaluation of TAS configurations under realistic conditions. The testbed is used to assess the impact of 5G delay and jitter on specific TAS settings under representative network scenarios.
C1 我们对通过 5G 网络互连的、相邻且启用 TAS 的 TSN 交换机之间数据包传输所涉及的时延组成部分进行了详细分析。该分析刻画了 5G 引入的时延和抖动如何与 TAS 参数相互作用,并量化了它们对 E2E 时延性能的影响。C2 基于这一分析,我们识别了在 5G-TSN 网络中能够实现确定性通信的条件。我们深入研究了由不同 TAS 参数配置产生的各种结果场景,并提供了一般性配置指南,以确保确定性行为。C3 我们实现了一个实验测试床,将商用专用 5G 网络与启用 TAS 的 TSN 交换机集成在一起,从而能够在真实条件下对 TAS 配置进行现实世界评估。该测试床用于在具有代表性的网络场景下评估 5G 时延和抖动对特定 TAS 设置的影响。
C1、C2、C3 编号保留;“adjacent TAS-enabled TSN switches interconnected via a 5G network”已译出相邻、启用 TAS、经 5G 互连三层限定;“commercial private 5G network”译为“商用专用 5G 网络”。该段包含多个贡献条目但输入本身为一个段落,按要求未拆分。未发现明显问题。
We provide a detailed analysis of the delay components involved in the transmission of packets between adjacent TAS -enabled TSN switches interconnected via a 5G network. This analysis characterizes how 5G -induced delays and jitter interact with TAS parameters, and quantifies their impact on E2E latency performance.
我们对通过 5G 网络互连的、相邻且启用 TAS 的 TSN 交换机之间数据包传输所涉及的时延组成部分进行了详细分析。该分析刻画了 5G 引入的时延和抖动如何与 TAS 参数相互作用,并量化了它们对 E2E 时延性能的影响。
该段内容与 P007 中 C1 基本重复,按输入段落独立翻译;E2E、TAS 保留;“delay components”译为“时延组成部分”。未发现明显问题。
Based on this analysis, we identify the conditions under which deterministic communication can be achieved in 5G - TSN networks. We thoroughly investigate the resulting scenarios arising from different TAS parameter configurations and provide general configuration guidelines to ensure deterministic behavior.
基于这一分析,我们识别了在 5G-TSN 网络中能够实现确定性通信的条件。我们深入研究了由不同 TAS 参数配置产生的各种结果场景,并提供了一般性配置指南,以确保确定性行为。
该段内容与 P007 中 C2 基本重复,按输入段落独立翻译;“resulting scenarios”译为“各种结果场景”较直译但保留原有限定。未发现明显问题。
We implement an experimental testbed integrating a commercial private 5G network and TAS -enabled TSN switches, enabling real-world evaluation of TAS configurations under realistic conditions. The testbed is used to assess the impact of 5G delay and jitter on specific TAS settings under representative network scenarios.
我们实现了一个实验测试床,将商用专用 5G 网络与启用 TAS 的 TSN 交换机集成在一起,从而能够在真实条件下对 TAS 配置进行现实世界评估。该测试床用于在具有代表性的网络场景下评估 5G 时延和抖动对特定 TAS 设置的影响。
该段内容与 P007 中 C3 基本重复,按输入段落独立翻译;“real-world evaluation”译为“现实世界评估”;“representative network scenarios”译为“具有代表性的网络场景”。未发现明显问题。
This article builds upon our previous conference work [ 6 ], which presented an initial testbed-based study of TAS scheduling in integrated 5G - TSN environments. In this extended version, we provide a more comprehensive theoretical and experimental analysis of the impact of 5G -induced delay and jitter on TAS operation. We identify and characterize critical scenarios arising from different TAS parameter configurations. Furthermore, we derive general configuration guidelines and formally establish the conditions required to guarantee deterministic E2E performance in 5G - TSN networks.
本文建立在我们先前的会议论文工作 [6] 之上,该工作提出了一个基于测试床的、关于集成 5G-TSN 环境中 TAS 调度的初步研究。在这个扩展版本中,我们对 5G 引入的时延和抖动对 TAS 运行的影响,提供了更全面的理论分析和实验分析。我们识别并刻画了由不同 TAS 参数配置所产生的关键场景。此外,我们推导出通用配置指南,并形式化地确立了在 5G-TSN 网络中保证确定性端到端(E2E)性能所需的条件。
术语 TAS、5G-TSN、E2E 保留并补充中文含义;“5G-induced delay and jitter”译为“5G 引入的时延和抖动”准确;“formally establish”译为“形式化地确立”无明显遗漏。未发现明显问题。
Our results show that guaranteeing bounded latency and jitter requires configuring the TAS transmission window offset between TSN switches based on the maximum observed 5G delay, estimated using a high-percentile delay metric. While increasing this offset helps to absorb delay variability, it also increases E2E latency. Moreover, if the offset becomes excessively large, it may cause misalignment between the transmission windows of TSN switches, thereby violating the deterministic behavior. Additionally, to ensure that packets always arrive within their assigned transmission windows, the TAS cycle period should be greater than the sum of the peak-to-peak jitter introduced by 5G and the transmission window duration. Finally, we see how additional traffic flows with the same priority may also increase 5G delay and jitter. Similarly, if the 5G network lacks proper isolation between traffic types, flows with lower priority can contribute to latency and jitter degradation. Such cases require recalculating TAS parameters.
我们的结果表明,要保证有界时延和有界抖动,需要基于观测到的最大 5G 时延来配置 TSN 交换机之间的 TAS 传输窗口偏移量,而该最大时延使用高百分位时延指标进行估计。虽然增大这一偏移量有助于吸收时延变化性,但它也会增加端到端(E2E)时延。此外,如果该偏移量变得过大,它可能导致 TSN 交换机的传输窗口之间发生失配,从而违反确定性行为。另外,为确保数据包总是到达其被分配的传输窗口内,TAS 周期时长应当大于 5G 引入的峰峰值抖动与传输窗口持续时间之和。最后,我们看到,具有相同优先级的额外业务流也可能增加 5G 时延和抖动。类似地,如果 5G 网络在不同业务类型之间缺乏适当隔离,则较低优先级的业务流也可能促成时延和抖动劣化。此类情形需要重新计算 TAS 参数。
“bounded latency and jitter”译为“有界时延和有界抖动”;“high-percentile delay metric”译为“高百分位时延指标”;“peak-to-peak jitter”译为“峰峰值抖动”,术语风险较低。逻辑上保留了偏移量增大既吸收变化性又增加 E2E 时延、过大则导致窗口失配的转折关系。未发现明显问题。
Paper Outline. The paper is organized as follows: Section II covers background on industrial 5G - TSN networks and TAS. Section III presents the system model. Section IV analyzes 5G delay and jitter impact on TAS. Section V describes the testbed and the experimental setup. Section VI reports performance results. Section VII reviews related work. Section VIII outlines the key conclusions and future work.
论文结构。本文组织如下:第 II 节介绍工业 5G-TSN 网络和 TAS 的背景。第 III 节给出系统模型。第 IV 节分析 5G 时延和抖动对 TAS 的影响。第 V 节描述测试床和实验设置。第 VI 节报告性能结果。第 VII 节回顾相关工作。第 VIII 节概述主要结论和未来工作。
章节编号、主题顺序和 TAS 等缩写均与原段一致;“Paper Outline”译为“论文结构”符合论文语境。未发现明显问题。
This section overviews 5G - TSN networks in Industry 4.0. First, we introduce the main network segments and key characteristics of industrial applications. Then, we discuss QoS traffic management and the TAS mechanism. Finally, we highlight time synchronization for deterministic communications.
本节概述工业 4.0 中的 5G-TSN 网络。首先,我们介绍主要网络段以及工业应用的关键特征。然后,我们讨论 QoS 业务管理和 TAS 机制。最后,我们强调用于确定性通信的时间同步。
“Industry 4.0”译为“工业 4.0”;“network segments”译为“网络段”;QoS、TAS 保留。逻辑顺序完整。未发现明显问题。
As depicted in Fig. 1, three connectivity segments are defined in a 5G - TSN -based industrial network [ 5 ]:
如图 1 所示,在基于 5G-TSN 的工业网络中定义了三个连接段 [5]:
“connectivity segments”译为“连接段”;引用 [5] 和图 1 保留。该段引出后续列表,未发现明显问题。
• Edge/Cloud Room: Centralizes management tasks handled by the Manufacturing Execution System (MES), such as monitoring, data collection, and analytics. Control functions are traditionally performed by Programmable Logic Controllers (PLCs), which may run on dedicated hardware or general-purpose servers, i.e., virtualized PLCs (vPLCs). This layer may also include a network device that provides the TSN Grand Master (GM) clock reference, typically derived from Global Navigation Satellite System (GNSS) [ 7 ], for distribution across the network. • 5G System: According to 3rd Generation Partnership Project (3GPP) TS 23.501 (v19.0.0) [ 8 ], the 5G system integrates into the TSN network as one or more virtual TSN switches, with the User Plane Functions (UPFs) and User Equipments (UEs) acting as endpoints. The UE connects wirelessly to the next generation Node B (gNB). The TSN Translators, specifically the Network-side Translator (NW-TT) located in the UPF and the Device-side Translator (DS-TT) in the UE, support the integration between the TSN and 5G domains by adapting traffic formats and QoS information, and enabling the transport of synchronization information. • Production Lines: Each includes Field Devices (FDs) such as sensors and actuators, along with local PLCs for distributed control. FDs report operational data to centralized PLCs, enabling hierarchical decision-making. Each production line connects to a TSN Slave (SL) switch that receives clock signals from the TSN Master (MS) switch via the 5G system and redistributes synchronization to the FDs within this production line.
• 边缘/云机房:集中由制造执行系统(MES)处理的管理任务,例如监测、数据收集和分析。控制功能传统上由可编程逻辑控制器(PLC)执行,这些控制器可以运行在专用硬件或通用服务器上,即虚拟化 PLC(vPLC)。这一层还可以包括一个网络设备,用于提供 TSN Grand Master(GM)时钟参考,该参考通常来源于全球导航卫星系统(GNSS)[7],以便在整个网络中分发。• 5G 系统:根据第三代合作伙伴计划(3GPP)TS 23.501(v19.0.0)[8],5G 系统作为一个或多个虚拟 TSN 交换机集成到 TSN 网络中,其中用户面功能(UPF)和用户设备(UE)充当端点。UE 以无线方式连接到下一代 Node B(gNB)。TSN 转换器,具体而言是位于 UPF 中的网络侧转换器(NW-TT)以及位于 UE 中的设备侧转换器(DS-TT),通过适配业务格式和 QoS 信息,并支持同步信息的传输,来支撑 TSN 域与 5G 域之间的集成。• 生产线:每条生产线包括现场设备(FD),例如传感器和执行器,并包括用于分布式控制的本地 PLC。FD 向集中式 PLC 报告运行数据,从而支持分层决策。每条生产线连接到一个 TSN Slave(SL)交换机,该交换机通过 5G 系统从 TSN Master(MS)交换机接收时钟信号,并将同步重新分发给该生产线内的 FD。
该段在输入中包含三个项目符号合并文本,且 P017-P019 又分别重复拆分这些项目,可能源自 PDF 抽取重复;按要求仍为 P016 输出一个小节。术语 MES、PLC、vPLC、GM、GNSS、3GPP TS 23.501 v19.0.0、UPF、UE、gNB、NW-TT、DS-TT、FD、SL、MS 均保留。存在列表抽取/重复上下文风险,但翻译内容未发现明显术语或数字错误。
Edge/Cloud Room: Centralizes management tasks handled by the Manufacturing Execution System (MES), such as monitoring, data collection, and analytics. Control functions are traditionally performed by Programmable Logic Controllers (PLCs), which may run on dedicated hardware or general-purpose servers, i.e., virtualized PLCs (vPLCs). This layer may also include a network device that provides the TSN Grand Master (GM) clock reference, typically derived from Global Navigation Satellite System (GNSS) [ 7 ], for distribution across the network.
边缘/云机房:集中由制造执行系统(MES)处理的管理任务,例如监测、数据收集和分析。控制功能传统上由可编程逻辑控制器(PLC)执行,这些控制器可以运行在专用硬件或通用服务器上,即虚拟化 PLC(vPLC)。这一层还可以包括一个网络设备,用于提供 TSN Grand Master(GM)时钟参考,该参考通常来源于全球导航卫星系统(GNSS)[7],以便在整个网络中分发。
与 P016 中第一项内容重复,应是输入抽取将列表整体和列表项分别保留导致;引用 [7]、缩写和逻辑关系完整。因存在重复抽取上下文风险,需人工确认是否保留。
5G System: According to 3rd Generation Partnership Project (3GPP) TS 23.501 (v19.0.0) [ 8 ], the 5G system integrates into the TSN network as one or more virtual TSN switches, with the User Plane Functions (UPFs) and User Equipments (UEs) acting as endpoints. The UE connects wirelessly to the next generation Node B (gNB). The TSN Translators, specifically the Network-side Translator (NW-TT) located in the UPF and the Device-side Translator (DS-TT) in the UE, support the integration between the TSN and 5G domains by adapting traffic formats and QoS information, and enabling the transport of synchronization information.
5G 系统:根据第三代合作伙伴计划(3GPP)TS 23.501(v19.0.0)[8],5G 系统作为一个或多个虚拟 TSN 交换机集成到 TSN 网络中,其中用户面功能(UPF)和用户设备(UE)充当端点。UE 以无线方式连接到下一代 Node B(gNB)。TSN 转换器,具体而言是位于 UPF 中的网络侧转换器(NW-TT)以及位于 UE 中的设备侧转换器(DS-TT),通过适配业务格式和 QoS 信息,并支持同步信息的传输,来支撑 TSN 域与 5G 域之间的集成。
与 P016 中第二项内容重复,应是输入抽取重复;标准号 3GPP TS 23.501、版本 v19.0.0、引用 [8] 均保留。NW-TT、DS-TT 位置关系分别对应 UPF 和 UE,未发现明显问题。因重复抽取风险,需人工确认。
Production Lines: Each includes Field Devices (FDs) such as sensors and actuators, along with local PLCs for distributed control. FDs report operational data to centralized PLCs, enabling hierarchical decision-making. Each production line connects to a TSN Slave (SL) switch that receives clock signals from the TSN Master (MS) switch via the 5G system and redistributes synchronization to the FDs within this production line.
生产线:每条生产线包括现场设备(FD),例如传感器和执行器,并包括用于分布式控制的本地 PLC。FD 向集中式 PLC 报告运行数据,从而支持分层决策。每条生产线连接到一个 TSN Slave(SL)交换机,该交换机通过 5G 系统从 TSN Master(MS)交换机接收时钟信号,并将同步重新分发给该生产线内的 FD。
与 P016 中第三项内容重复,应是输入抽取重复;FD、PLC、SL、MS 缩写保留。逻辑上保留了现场设备上报数据、生产线交换机接收并重新分发同步的关系。因重复抽取风险,需人工确认。
Industrial network traffic is predominantly delay-sensitive, with E2E latency requirements ranging from hundreds of microseconds to few tens of milliseconds [ 9 ]. Although other traffic types exist, such as network control, mobile robotics, and video streams, TAS can be applied to Cyclic-Synchronous applications, which require highly predictable timing to ensure reliable communications [ 5, 10 ].
工业网络流量主要对时延敏感,其端到端(E2E)时延需求范围从数百微秒到几十毫秒 [9]。虽然还存在其他流量类型,例如网络控制、移动机器人和视频流,但 TAS 可以应用于循环同步应用,这类应用需要高度可预测的时序,以确保可靠通信 [5, 10]。
“hundreds of microseconds to few tens of milliseconds”译为“数百微秒到几十毫秒”,保留数量级;“Cyclic-Synchronous applications”译为“循环同步应用”,术语可能也可译为“周期同步应用”,但语义可接受。引用 [9]、[5, 10] 保留。未发现明显问题。
The Cyclic-Synchronous applications consist of periodic communication between devices operating on independent cycles, with synchronization enforced at intermediate network nodes rather than end devices. Each device samples and updates at its own rate, allowing for bounded jitter and some timing variation. Although the E2E packet transmission delay must remain within predictable bounds, occasional variation is tolerated. Thereby, jitter is constrained to the latency bound [ 10 ]. This traffic is commonly used in controller-to-I/O exchanges, periodic sensor polling, and updates to supervisory systems. Examples include PLC -to-actuator response commands, graphic updates to Supervisory Control and Data Acquisition (SCADA) systems, and routine diagnostic or historian data transfers.
循环同步(Cyclic-Synchronous)应用由运行在独立周期上的设备之间的周期性通信构成,其中同步是在中间网络节点处强制执行,而不是在终端设备处强制执行。每个设备以其自身的速率进行采样和更新,从而允许有界抖动以及一定的时序变化。尽管端到端(E2E)分组传输时延必须保持在可预测的界限之内,但偶发的变化是可以容忍的。因此,抖动被约束在时延界限之内 [10]。这类流量通常用于控制器到 I/O 的交换、周期性传感器轮询,以及对监控系统的更新。示例包括 PLC 到执行器的响应命令、对监控与数据采集(SCADA)系统的图形更新,以及常规诊断数据或历史数据库数据传输。
术语 Cyclic-Synchronous 译为“循环同步”,E2E、PLC、SCADA 已保留并解释;数字和引用 [10] 保留;“jitter is constrained to the latency bound”译为“抖动被约束在时延界限之内”,语义可能依赖上下文但未发现明显错译。
In addition, another category of time-sensitive industrial applications coexists with Cyclic-Synchronous: the Isochronous. Although both of them require strict delay and jitter analysis in 5G - TSN networks, our work addresses general Cyclic-Synchronous applications and evaluates the feasibility of their scheduling, as the stringent requirements of Isochronous applications cannot currently be met, which significantly exceed the latency capabilities of existing 5G deployments [ 11 ].
此外,另一类时间敏感型工业应用与循环同步应用共存,即等时(Isochronous)应用。尽管二者都要求在 5G-TSN 网络中进行严格的时延和抖动分析,但我们的工作面向一般的循环同步应用,并评估其调度的可行性,因为等时应用的严格要求目前无法得到满足,而且这些要求显著超出了现有 5G 部署的时延能力 [11]。
Isochronous 译为“等时”并保留英文;“both of them”对应二者;因果关系“as”已体现;引用 [11] 保留。未发现明显问题。
Traffic prioritization in TSN networks relies on the 3-bit Priority Code Point (PCP) field defined in IEEE 802.1Q Virtual Local Area Network (VLAN) tags, allowing up to eight priority levels [ 3 ]. These levels enable differentiation according to QoS requirements: higher values (i.e., PCP 4–7) are typically assigned to critical traffic, while lower ones (i.e., PCP 0–3) serve less time-sensitive or best-effort data [ 5 ].
TSN 网络中的流量优先级划分依赖于 IEEE 802.1Q 虚拟局域网(VLAN)标签中定义的 3 比特优先级代码点(Priority Code Point, PCP)字段,该字段最多允许八个优先级等级 [3]。这些等级能够根据 QoS 需求进行区分:较高的取值(即 PCP 4-7)通常分配给关键流量,而较低的取值(即 PCP 0-3)用于时间敏感性较低的数据或尽力而为数据 [5]。
3-bit、八个优先级、PCP 4-7、PCP 0-3 和引用 [3][5] 均保留;QoS 保留为常用缩写;“best-effort”译为“尽力而为”。未发现明显问题。
In 5G networks, QoS is managed for each flow by a QoS Flow ID (QFI) and associated with a standardized 5G QoS Identifier (5QI), as specified in 3GPP TS 23.501 [ 8 ]. Each 5QI defines key performance characteristics such as priority level, delay tolerance, and packet error rate, which determine the treatment of traffic throughout the 5G system [ 12 ].
在 5G 网络中,如 3GPP TS 23.501 [8] 所规定,QoS 通过 QoS 流 ID(QoS Flow ID, QFI)针对每个流进行管理,并与标准化的 5G QoS 标识符(5G QoS Identifier, 5QI)相关联。每个 5QI 定义关键性能特征,例如优先级等级、时延容忍度和分组错误率,这些特征决定了整个 5G 系统中对流量的处理方式 [12]。
QFI、5QI、3GPP TS 23.501、引用 [8][12] 均保留;“packet error rate”译为“分组错误率”,符合通信语境。未发现明显问题。
While TSN enforces QoS through PCP -based prioritization, 5G employs 5QI -driven flow control to differentiate traffic. The mapping between TSN traffic classes and 5G QoS flows remains an active research topic, primarily due to the semantic differences between the PCP -based prioritization in TSN and the 5QI -based framework in 5G. As shown in [ 9 ], a feasible approach involves classifying Ethernet frames based on their PCP field at the UE and UPF, using packet filters to associate them with appropriate 5G QoS flows.
TSN 通过基于 PCP 的优先级划分来实施 QoS,而 5G 则采用由 5QI 驱动的流控制来区分流量。TSN 流量类别与 5G QoS 流之间的映射仍然是一个活跃的研究主题,这主要是由于 TSN 中基于 PCP 的优先级划分与 5G 中基于 5QI 的框架之间存在语义差异。如 [9] 所示,一种可行方法是在 UE 和 UPF 处根据以太网帧的 PCP 字段对其进行分类,并使用分组过滤器将它们与适当的 5G QoS 流关联起来。
PCP、5QI、QoS、UE、UPF 和引用 [9] 均保留;“semantic differences”译为“语义差异”;逻辑关系完整。未发现明显问题。
IEEE 802.1Qbv is a TSN standard that specifies the TAS mechanism, which enables time-aware scheduling of Layer 2 frames at the egress ports of TSN switches based on QoS requirements [ 13, 14, 15 ]. TAS utilizes the PCP field in the IEEE 802.1Q header to classify packets into one of eight First-In First-Out (FIFO) queues. At each egress port, these queues are prioritized to ensure that higher-priority traffic is transmitted before lower-priority traffic.
IEEE 802.1Qbv 是一项 TSN 标准,它规定了 TAS 机制;该机制能够根据 QoS 需求,在 TSN 交换机的出口端口处对第 2 层帧进行时间感知调度 [13, 14, 15]。TAS 利用 IEEE 802.1Q 报头中的 PCP 字段,将分组分类到八个先进先出(First-In First-Out, FIFO)队列之一。在每个出口端口处,这些队列被赋予优先级,以确保较高优先级流量先于较低优先级流量传输。
IEEE 802.1Qbv、TAS、Layer 2、PCP、FIFO 和引用 [13,14,15] 均保留;“egress ports”译为“出口端口”;优先级逻辑无遗漏。未发现明显问题。
Each egress port is controlled by a Gate Control List (GCL), which defines a time-triggered transmission schedule divided into transmission windows governed by the clock reference. During each transmission window, one or more queues are permitted to transmit, depending on the binary state of their associated gates. Each queue has its own gate, and the GCL specifies the time intervals during which each gate is open or closed. When multiple gates are open, transmission order typically follows queue priority, although exact behavior may depend on the switch implementation.
每个出口端口由一个门控控制列表(Gate Control List, GCL)控制,该列表定义了一个由时钟参考支配的、按时间触发的传输调度,该调度被划分为多个传输窗口。在每个传输窗口期间,允许一个或多个队列进行传输,具体取决于其关联门的二进制状态。每个队列都有自己的门,而 GCL 指定每个门处于打开或关闭状态的时间区间。当多个门同时打开时,传输顺序通常遵循队列优先级,尽管确切行为可能取决于交换机实现。
GCL、传输窗口、二进制门状态、打开/关闭区间均完整保留;“clock reference”译为“时钟参考”,可接受;最后一句保留了实现相关的不确定性。未发现明显问题。
TAS scheduling is organized around periodic network cycles that enable deterministic communication. A network cycle consists of a fixed-duration time interval which encompasses a full instance of a specific set of transmission windows defined by the GCL [ 16 ]. The duration of the network cycle is typically chosen to align with the application cycles involved, which are defined as the periods at which message exchanges occur. This alignment is commonly achieved by selecting the network cycle duration as the greatest common divisor of the involved application cycles. For more information on TAS see [ 4 ].
TAS 调度围绕周期性网络周期组织,以支持确定性通信。一个网络周期由一个固定时长的时间间隔构成,该时间间隔包含由 GCL 定义的一组特定传输窗口的一个完整实例 [16]。网络周期的持续时间通常被选择为与所涉及的应用周期对齐,而应用周期被定义为消息交换发生的周期。通常通过将网络周期持续时间选择为所涉及应用周期的最大公约数来实现这种对齐。关于 TAS 的更多信息,请参见 [4]。
“network cycles”“application cycles”均译为周期相关概念,存在中文重复但语义忠实;“greatest common divisor”译为“最大公约数”;引用 [16][4] 保留。未发现明显问题。
Time synchronization is essential in 5G - TSN networks to support the deterministic requirements of IIoT applications. In typical TSN architectures, a TSN MS switch distributes the GM clock via Precision Time Protocol (PTP) or generalized Precision Time Protocol (gPTP) messages to multiple TSN SL switches, each deployed along a different production line, as defined in Section II-A. Upon receiving these messages, each TSN SL switch estimates the time difference between its local clock and the reference clock of the TSN MS switch, known as the clock offset, and adjusts its local time accordingly [ 17 ].
时间同步在 5G-TSN 网络中至关重要,用于支持 IIoT 应用的确定性需求。在典型 TSN 架构中,如第 II-A 节所定义,TSN MS 交换机通过精确时间协议(Precision Time Protocol, PTP)或广义精确时间协议(generalized Precision Time Protocol, gPTP)消息,将 GM 时钟分发给多个 TSN SL 交换机,其中每个 TSN SL 交换机都部署在不同的生产线上。接收到这些消息后,每个 TSN SL 交换机会估计其本地时钟与 TSN MS 交换机参考时钟之间的时间差,即所谓的时钟偏移,并相应地调整其本地时间 [17]。
IIoT、TSN MS、GM、PTP、gPTP、TSN SL、clock offset 和引用 [17] 均保留;“as defined in Section II-A”的修饰对象可能涉及整句架构说明,译文已放在典型架构描述中。未发现明显问题。
According to the architecture defined in 3GPP TS 23.501 [ 8 ], TSN translators, specifically the NW-TT and DS-TT, enable propagation of the GM clock across the 5G system to the TSN domain, thus maintaining clock consistency across TSN switches interconnected via 5G (see Fig. 1). A widely adopted configuration for propagating synchronization over 5G is the Transparent Clock (TC) mode defined in IEEE 1588 [ 18, 19, 20 ], where synchronization messages are forwarded with the correctionField updated to reflect the residence time within each intermediate node, while original timestamps remain unchanged. Unlike Boundary Clock (BC) mode, where each node terminates and regenerates synchronization messages, TC mode preserves a single timing domain by accumulating residence times [ 21 ]. The NW-TT and DS-TT measure the residence time within the 5G system and include this delay in the forwarded messages with the correctionField. This operation complies with IEEE 1588-2019 and enables accurate clock correction at the TSN endpoint. For more information see [ 17, 21, 18, 20, 19 ].
根据 3GPP TS 23.501 [8] 中定义的架构,TSN 转换器,具体而言即 NW-TT 和 DS-TT,使 GM 时钟能够跨越 5G 系统传播到 TSN 域,从而维持通过 5G 互连的 TSN 交换机之间的时钟一致性(见图 1)。一种被广泛采用的、用于在 5G 上传播同步的配置是 IEEE 1588 [18, 19, 20] 中定义的透明时钟(Transparent Clock, TC)模式;在该模式下,同步消息会被转发,同时 correctionField 被更新以反映每个中间节点内的驻留时间,而原始时间戳保持不变。与边界时钟(Boundary Clock, BC)模式不同,在 BC 模式中每个节点都会终止并重新生成同步消息;TC 模式通过累积驻留时间来保持单一时序域。NW-TT 和 DS-TT 测量 5G 系统内的驻留时间,并通过 correctionField 将该时延包含在转发后的消息中。该操作符合 IEEE 1588-2019,并能够在 TSN 端点处实现准确的时钟校正。更多信息请参见 [17, 21, 18, 20, 19]。
3GPP TS 23.501、NW-TT、DS-TT、GM、IEEE 1588、TC、BC、correctionField、IEEE 1588-2019 和所有引用均保留;“residence time”译为“驻留时间”;“forwarded messages with the correctionField”原文表达略不自然,译文按技术含义处理。未发现明显问题。
Discrepancies in the clocks of different devices within the 5G - TSN network may occur, preventing the devices from updating their clocks accurately. The 3GPP TS 22.104 [ 22 ] specifies that a maximum clock drift contribution of 900 ns must be guaranteed for 5G systems to enable time-critical industrial applications. In line with this, the work in [ 20 ] empirically quantizes a maximum peak-to-peak synchronization error of 500 ns, which is significantly below the requirement.
5G-TSN 网络内不同设备的时钟可能会出现不一致,从而使设备无法准确地更新其时钟。3GPP TS 22.104 [22] 规定,为了使 5G 系统能够支持时间关键型工业应用,必须保证最大时钟漂移贡献为 900 ns。与此一致,[20] 中的工作通过实证方式量化得到最大峰峰值同步误差为 500 ns,这显著低于该要求。
术语“clock drift contribution”译为“时钟漂移贡献”,“peak-to-peak synchronization error”译为“峰峰值同步误差”;900 ns、500 ns 和引用 [22]、[20] 保留正确。逻辑上“低于要求”指误差小于最大允许漂移贡献,未发现明显问题。
This section introduces the network and traffic models. We then describe the TAS model, followed by a description of the different sources of latency in the system. Table I provides a summary of key mathematical notations used throughout the paper.
本节介绍网络模型和流量模型。随后我们描述 TAS 模型,接着描述系统中不同的时延来源。表 I 汇总了全文使用的关键数学符号。
TAS、表 I、network/traffic models 均已保留或准确翻译;段落为章节引导,无公式风险。未发现明显问题。
Notation Conventions. We use calligraphic letters (e.g., 𝒳 \mathcal{X}) to denote sets. Lowercase letters (e.g., y y) represent random variables, while uppercase letters (e.g., Y Y) denote constant parameters. Binary variables are typeset in uppercase sans serif font (e.g., 𝖷 \mathsf{X}). Subscripts indicate that a parameter applies to specific elements of a given set; for example, z i, j z_{i,j} refers to the parameter z z corresponding to elements i ∈ ℐ i\in\mathcal{I} and j ∈ 𝒥 j\in\mathcal{J}. Superscripts provide descriptive annotations, e.g., z desc z^{\text{desc}} denotes the variable z z with descriptor ”desc”. In addition, f x (⋅) f_{x}(\cdot) and F x (⋅) F_{x}(\cdot) denote the Probability Density Function (PDF) and Cumulative Distribution Function (CDF) of the random variable x x, respectively. Finally, the letter Z ^ \hat{Z} denotes the statistical upper bound of F x (⋅) F_{x}(\cdot).
符号约定。我们使用花体字母(例如 𝒳,\(\mathcal{X}\))表示集合。小写字母(例如 \(y\))表示随机变量,而大写字母(例如 \(Y\))表示常量参数。二元变量使用大写无衬线字体排版(例如 𝖷,\(\mathsf{X}\))。下标表示某个参数适用于给定集合中的特定元素;例如,\(z_{i,j}\) 指的是与元素 \(i \in \mathcal{I}\) 和 \(j \in \mathcal{J}\) 对应的参数 \(z\)。上标提供描述性注释,例如 \(z^{\text{desc}}\) 表示带有描述符“desc”的变量 \(z\)。此外,\(f_x(\cdot)\) 和 \(F_x(\cdot)\) 分别表示随机变量 \(x\) 的概率密度函数(Probability Density Function, PDF)和累积分布函数(Cumulative Distribution Function, CDF)。最后,字母 \(\hat{Z}\) 表示 \(F_x(\cdot)\) 的统计上界。
输入中存在 OCR/抽取重复,如“y y”“Y Y”“z z”等,译文按数学含义合并呈现;PDF/CDF、\(\hat{Z}\)、\(f_x(\cdot)\)、\(F_x(\cdot)\) 保留。由于“\(\hat{Z}\) denotes the statistical upper bound of \(F_x(\cdot)\)”中变量 \(Z\) 与 \(x\) 的关系缺少上下文,但公式本身可译。未发现明显问题。
We consider a set of network nodes denoted by ℐ \mathcal{I}, comprising: (i) two TSN switches, denoted as master switch MS and slave switch SL, respectively; (ii) two TSN translators, one being a network-side translator and denoted as NW-TT and the other being the device-side translator and denoted as DS-TT; (iii) a 5G UE denoted as UE; and (iv) a 5G gNB and an UPF, denoted by gNB and UPF, respectively. Each communication link is represented by ε \varepsilon, and the set of all such links is denoted by ℰ \mathcal{E}. A specific link between nodes i i and j j is denoted by ε i, j ∈ ℰ \varepsilon_{i,j}\in\mathcal{E}, where i, j ∈ ℐ i,j\in\mathcal{I}. The topology is defined by the sequential links: ℰ ≡ { ε MS, NW-TT, ε NW-TT, UPF, ε UPF, gNB, ε gNB, UE, ε UE, DS-TT, ε DS-TT, SL } \mathcal{E}\equiv\{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}},\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}},\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}},\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}},\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}},\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}\}. We define the subset of nodes corresponding to the 5G system as ℐ 5G ≡ { UE, gNB, UPF, NW-TT, DS-TT } \mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}\equiv\{\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}},\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}},\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}},\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}},\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}}\}. Similarly, the virtual 5G system link set ℰ 5G ⊂ ℰ \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}\subset\mathcal{E} contains the subset of physical links that connect the nodes of the 5G system, i.e., ℰ 5G ≡ { ε NW-TT, UPF, ε UPF, gNB, ε gNB, UE, ε UE, DS-TT } \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}\equiv\{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}},\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}},\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}},\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}},\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}}}\}. Finally, we define the subset of TSN switches as ℐ TSN ⊂ ℐ \mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\subset\mathcal{I}, i.e., ℐ TSN ≡ { MS, SL } \mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\equiv\{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}\}, which are interconnected via the 5G system with the link set ℰ TSN ⊂ ℰ \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\subset\mathcal{E}, containing the subset of physical links to the 5G bridge bounds NW-TT and DS-TT, i.e., ℰ TSN ≡ { ε MS, NW-TT, ε DS-TT, SL } \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\equiv\{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}\}, respectively.
我们考虑一个由 \(\mathcal{I}\) 表示的网络节点集合,其包括:(i)两个 TSN 交换机,分别表示为主交换机 MS 和从交换机 SL;(ii)两个 TSN 转换器,其中一个是网络侧转换器,表示为 NW-TT,另一个是设备侧转换器,表示为 DS-TT;(iii)一个表示为 UE 的 5G UE;以及(iv)一个 5G gNB 和一个 UPF,分别表示为 gNB 和 UPF。每条通信链路由 \(\varepsilon\) 表示,所有这类链路的集合由 \(\mathcal{E}\) 表示。节点 \(i\) 与 \(j\) 之间的一条特定链路表示为 \(\varepsilon_{i,j} \in \mathcal{E}\),其中 \(i,j \in \mathcal{I}\)。拓扑由以下顺序链路定义:\(\mathcal{E} \equiv \{\varepsilon_{\text{MS},\text{NW-TT}}, \varepsilon_{\text{NW-TT},\text{UPF}}, \varepsilon_{\text{UPF},\text{gNB}}, \varepsilon_{\text{gNB},\text{UE}}, \varepsilon_{\text{UE},\text{DS-TT}}, \varepsilon_{\text{DS-TT},\text{SL}}\}\)。我们将对应于 5G 系统的节点子集定义为 \(\mathcal{I}^{\text{5G}} \equiv \{\text{UE}, \text{gNB}, \text{UPF}, \text{NW-TT}, \text{DS-TT}\}\)。类似地,虚拟 5G 系统链路集合 \(\mathcal{E}^{\text{5G}} \subset \mathcal{E}\) 包含连接 5G 系统节点的物理链路子集,即 \(\mathcal{E}^{\text{5G}} \equiv \{\varepsilon_{\text{NW-TT},\text{UPF}}, \varepsilon_{\text{UPF},\text{gNB}}, \varepsilon_{\text{gNB},\text{UE}}, \varepsilon_{\text{UE},\text{DS-TT}}\}\)。最后,我们将 TSN 交换机子集定义为 \(\mathcal{I}^{\text{TSN}} \subset \mathcal{I}\),即 \(\mathcal{I}^{\text{TSN}} \equiv \{\text{MS}, \text{SL}\}\),它们通过链路集合 \(\mathcal{E}^{\text{TSN}} \subset \mathcal{E}\) 经由 5G 系统互连;该集合包含通向 5G 网桥边界 NW-TT 和 DS-TT 的物理链路子集,即 \(\mathcal{E}^{\text{TSN}} \equiv \{\varepsilon_{\text{MS},\text{NW-TT}}, \varepsilon_{\text{DS-TT},\text{SL}}\}\)。
原文 LaTeX 中混有 glossaries 抽取噪声,译文已恢复为可读公式;节点集合、链路集合、5G/TSN 子集和所有链路方向均逐项保留。原文末尾 “respectively” 指代稍不清晰,但不影响集合定义。未发现明显问题。
Let 𝒮 \mathcal{S} denote the set of traffic flows traversing the considered 5G - TSN network. Specifically, 𝒮 \mathcal{S} includes:
令 \(\mathcal{S}\) 表示穿越所考虑的 5G-TSN 网络的流量流集合。具体而言,\(\mathcal{S}\) 包括:
“traffic flows”译为“流量流”,\(\mathcal{S}\) 保留;该段引出列表,内容依赖后续段落。未发现明显问题。
• A downlink Delay-Critical (DC) flow generated by a Cyclic-Synchronous application, as described in Section II-B. We assume a DC flow in downlink as a set of packets sharing a source at the Edge/Cloud Room, e.g., a PLC, and any of the devices in the same production line as the destination, e.g., actuators, which are typically served by a common switch, i.e., the SL switch. Each application cycle, of periodic duration T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, the PLC generates a batch of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets of constant size L DC L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, resulting in an average data rate R DC gen = N DC ⋅ L DC / T DC app R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}~=~N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\cdot~L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}/T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, as a response delivered to all these actuators after processing the production state [ 23 ]. Additionally, packets must traverse the 5G - TSN network subject to an E2E delay constraint d DC E2E ≤ D DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}}~\leq~D_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Assuming these packets belong to a single application, they share the same timing constraints between them. • A downlink Best-Effort (BE) flow composed of packets that do not require strict timing guarantees. We assume packets of constant size L BE L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} are generated at a constant data rate R BE gen R_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}^{\text{gen}}. • Uplink and downlink PTP flows are considered to support clock synchronization among TSN switches. The exchange of these messages, as defined by the PTP standard, occurs periodically, with an application cycle T PTP app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}} significantly larger than T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, i.e., T PTP app ≫ T DC app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}\gg T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}.
• 一个由循环同步应用生成的下行时延关键型(Delay-Critical, DC)流,如第 II-B 节所述。我们假设下行方向的一个 DC 流是一组分组,这些分组共享位于边缘/云机房(Edge/Cloud Room)的源,例如 PLC,并且以同一生产线中的任一设备作为目的地,例如执行器;这些设备通常由一个公共交换机服务,即 SL 交换机。在每个应用周期中,其周期时长为 \(T_{\text{DC}}^{\text{app}}\),PLC 生成一批 \(N_{\text{DC}}\) 个恒定大小为 \(L_{\text{DC}}\) 的分组,从而得到平均数据速率 \(R_{\text{DC}}^{\text{gen}} = N_{\text{DC}} \cdot L_{\text{DC}} / T_{\text{DC}}^{\text{app}}\),这是在处理生产状态之后传送给所有这些执行器的响应 [23]。此外,分组必须在满足 E2E 时延约束 \(d_{\text{DC}}^{\text{E2E}} \leq D_{\text{DC}}\) 的条件下穿越 5G-TSN 网络。假设这些分组属于单个应用,则它们彼此之间共享相同的定时约束。• 一个下行尽力而为型(Best-Effort, BE)流,由不要求严格定时保证的分组组成。我们假设恒定大小为 \(L_{\text{BE}}\) 的分组以恒定数据速率 \(R_{\text{BE}}^{\text{gen}}\) 生成。• 上行和下行 PTP 流被认为用于支持 TSN 交换机之间的时钟同步。按照 PTP 标准定义,这些消息的交换周期性发生,其应用周期 \(T_{\text{PTP}}^{\text{app}}\) 显著大于 \(T_{\text{DC}}^{\text{app}}\),即 \(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\)。
该输入段落实际包含三个项目符号内容,并且后续 P037-P039 又分别重复这些项目;按要求仍作为 P036 单独完整翻译。公式 \(R_{\text{DC}}^{\text{gen}}\)、\(d_{\text{DC}}^{\text{E2E}} \leq D_{\text{DC}}\)、\(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\) 保留;“as a response delivered...” 的修饰关系可能依赖原文排版,但译文按 PLC 生成批量分组作为响应处理。由于段落抽取疑似列表合并且与 P037-P039 重复,需人工复核。
A downlink Delay-Critical (DC) flow generated by a Cyclic-Synchronous application, as described in Section II-B. We assume a DC flow in downlink as a set of packets sharing a source at the Edge/Cloud Room, e.g., a PLC, and any of the devices in the same production line as the destination, e.g., actuators, which are typically served by a common switch, i.e., the SL switch. Each application cycle, of periodic duration T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, the PLC generates a batch of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets of constant size L DC L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, resulting in an average data rate R DC gen = N DC ⋅ L DC / T DC app R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}~=~N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\cdot~L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}/T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, as a response delivered to all these actuators after processing the production state [ 23 ]. Additionally, packets must traverse the 5G - TSN network subject to an E2E delay constraint d DC E2E ≤ D DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}}~\leq~D_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Assuming these packets belong to a single application, they share the same timing constraints between them.
一个由循环同步应用生成的下行时延关键型(Delay-Critical, DC)流,如第 II-B 节所述。我们假设下行方向的一个 DC 流是一组分组,这些分组共享位于边缘/云机房的源,例如 PLC,并且以同一生产线中的任一设备作为目的地,例如执行器;这些设备通常由一个公共交换机服务,即 SL 交换机。在每个应用周期中,其周期时长为 \(T_{\text{DC}}^{\text{app}}\),PLC 生成一批 \(N_{\text{DC}}\) 个恒定大小为 \(L_{\text{DC}}\) 的分组,从而得到平均数据速率 \(R_{\text{DC}}^{\text{gen}} = N_{\text{DC}} \cdot L_{\text{DC}} / T_{\text{DC}}^{\text{app}}\),这是在处理生产状态之后传送给所有这些执行器的响应 [23]。此外,分组必须在满足 E2E 时延约束 \(d_{\text{DC}}^{\text{E2E}} \leq D_{\text{DC}}\) 的条件下穿越 5G-TSN 网络。假设这些分组属于单个应用,则它们彼此之间共享相同的定时约束。
DC、PLC、SL、E2E 及公式均保留;该段与 P036 的第一项重复,可能是 PDF 列表抽取造成。未见数字或公式错误,但重复上下文需注意。
A downlink Best-Effort (BE) flow composed of packets that do not require strict timing guarantees. We assume packets of constant size L BE L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} are generated at a constant data rate R BE gen R_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}^{\text{gen}}.
一个下行尽力而为型(Best-Effort, BE)流,由不要求严格定时保证的分组组成。我们假设恒定大小为 \(L_{\text{BE}}\) 的分组以恒定数据速率 \(R_{\text{BE}}^{\text{gen}}\) 生成。
BE、\(L_{\text{BE}}\)、\(R_{\text{BE}}^{\text{gen}}\) 保留;该段与 P036 的第二项重复,未发现明显问题。
Uplink and downlink PTP flows are considered to support clock synchronization among TSN switches. The exchange of these messages, as defined by the PTP standard, occurs periodically, with an application cycle T PTP app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}} significantly larger than T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, i.e., T PTP app ≫ T DC app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}\gg T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}.
上行和下行 PTP 流被认为用于支持 TSN 交换机之间的时钟同步。按照 PTP 标准定义,这些消息的交换周期性发生,其应用周期 \(T_{\text{PTP}}^{\text{app}}\) 显著大于 \(T_{\text{DC}}^{\text{app}}\),即 \(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\)。
PTP、TSN、上下行方向、应用周期关系均保留;该段与 P036 的第三项重复。未发现明显问题。
PTP flows are assigned the highest priority, followed by DC and then BE flows, consistently across both the 5G and TSN domains. Accordingly, PTP and DC packets are assigned higher PCP values for TSN scheduling, and they are mapped to 5G QoS flows with lower 5QI indices, indicating stricter QoS treatment. BE packets are mapped to the lowest priority class with higher 5QI index.
PTP 流被分配最高优先级,其后依次是 DC 流和 BE 流,并且这一点在 5G 域和 TSN 域中保持一致。因此,为了进行 TSN 调度,PTP 和 DC 分组被分配更高的 PCP 值,并且它们被映射到具有更低 5QI 指数的 5G QoS 流,这表示更严格的 QoS 处理。BE 分组被映射到优先级最低、5QI 指数更高的类别。
优先级顺序 PTP > DC > BE、PCP 值更高、5QI 指数更低代表更严格 QoS 处理均准确保留;5G QoS、TSN 调度术语未遗漏。未发现明显问题。
At each TSN switch i ∈ ℐ TSN i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, each egress port is associated with a set 𝒬 i \mathcal{Q}_{i} containing up to eight output queues. We assume a one-to-one mapping between each queue q ∈ 𝒬 i q\in\mathcal{Q}_{i} and a traffic flow s ∈ 𝒮 s\in\mathcal{S}, allowing interchangeability of q q and s s throughout this paper. Furthermore, we assume the GCL enforces mutually exclusive gate openings among the eight queues per egress port, guaranteeing that only one queue is permitted to transmit at any given instant.
在每个 TSN 交换机 \(i \in \mathcal{I}^{\text{TSN}}\) 处,每个出端口都关联一个集合 \(\mathcal{Q}_{i}\),该集合最多包含八个输出队列。我们假设每个队列 \(q \in \mathcal{Q}_{i}\) 与一个业务流 \(s \in \mathcal{S}\) 之间存在一一映射,因此在本文中允许 \(q\) 与 \(s\) 互换使用。此外,我们假设 GCL 在每个出端口的八个队列之间强制执行互斥的门打开,保证在任意给定时刻只允许一个队列进行传输。
术语 GCL、TSN、egress port、output queue 已保留/准确转译;“up to eight”译为“最多八个”;“one-to-one mapping”和“interchangeability”逻辑未遗漏;互斥门打开的约束表达清楚。未发现明显问题。
Accordingly, the GCL configuration for queue q ∈ 𝒬 i q\in\mathcal{Q}_{i} at switch i ∈ ℐ TSN i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} is formally expressed by Eq. (1). The binary variable 𝖦 i, q (t) \mathsf{G}_{i,q}(t) indicates whether the gate is open (1) or closed (0). The gates operate periodically with period T i nc T_{i}^{\text{nc}}, referred to as the network cycle. In the network cycle n = 0 n=0, the gate opening and closing instants, T i, q open T_{i,q}^{\text{open}} and T i, q closed T_{i,q}^{\text{closed}}, define the transmission window duration W i, q = T i, q closed − T i, q open W_{i,q}=T_{i,q}^{\text{closed}}-T_{i,q}^{\text{open}}. 𝖦 i, q (t) = { 1, n T i nc + T i, q open < t ≤ n T i nc + T i, q closed, ∀ n ∈ ℕ ∪ { 0 }. 0, otherwise. \mathsf{G}_{i,q}(t)=\begin{cases}1,&nT_{i}^{\text{nc}}+T_{i,q}^{\text{open}}<t\leq nT_{i}^{\text{nc}}+T_{i,q}^{\text{closed}},\\ &\;\forall n\in\mathbb{N}\cup\{0\}.\\ 0,&\text{otherwise}.\end{cases} (1)
因此,交换机 \(i \in \mathcal{I}^{\text{TSN}}\) 处队列 \(q \in \mathcal{Q}_{i}\) 的 GCL 配置由式(1)形式化表示。二元变量 \(\mathsf{G}_{i,q}(t)\) 表示该门是打开(1)还是关闭(0)。这些门以周期 \(T_{i}^{\text{nc}}\) 周期性运行,该周期称为网络周期。在网络周期 \(n=0\) 中,门打开和关闭的时刻 \(T_{i,q}^{\text{open}}\) 与 \(T_{i,q}^{\text{closed}}\) 定义传输窗口时长 \(W_{i,q}=T_{i,q}^{\text{closed}}-T_{i,q}^{\text{open}}\)。 \[ \mathsf{G}_{i,q}(t)= \begin{cases} 1, & nT_{i}^{\text{nc}}+T_{i,q}^{\text{open}}<t\leq nT_{i}^{\text{nc}}+T_{i,q}^{\text{closed}},\\ & \forall n\in\mathbb{N}\cup\{0\}.\\ 0, & \text{otherwise}. \end{cases} \tag{1} \]
二元变量、网络周期、开闭时刻、窗口时长均准确保留;不等式左开右闭 \(<t\leq\) 未误译;\(\forall n\in\mathbb{N}\cup\{0\}\) 已保留。公式来自输入文本,格式重排但含义未改变。未发现明显问题。
The DC flow period T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}} typically ranges from several hundreds of microseconds up to a few tens of milliseconds, whereas PTP synchronization messages are generated approximately every T PTP app ≈ 1 s T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}\approx 1\,\text{s}. Given that condition T PTP app ≫ T DC app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}~\gg~T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, we consider the duration of the network cycle, T i nc = T DC app T_{i}^{\text{nc}}=T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, as the DC flow is the primary target of this work.
DC 流周期 \(T_{\text{DC}}^{\text{app}}\) 通常从数百微秒到几十毫秒不等,而 PTP 同步消息大约每 \(T_{\text{PTP}}^{\text{app}}\approx 1\,\text{s}\) 生成一次。鉴于条件 \(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\),我们将网络周期的持续时间视为 \(T_{i}^{\text{nc}}=T_{\text{DC}}^{\text{app}}\),\(\forall i\in\mathcal{I}^{\text{TSN}}\),因为 DC 流是本文工作的主要目标。
“several hundreds of microseconds up to a few tens of milliseconds”译为“数百微秒到几十毫秒”;PTP 周期约 1 秒保留;远大于关系 \(\gg\) 与 \(T_i^{\text{nc}}=T_{\text{DC}}^{\text{app}}\) 未遗漏。未发现明显问题。
Each network cycle comprises three non-overlapping transmission windows (see Fig. 2): W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} for the DC traffic, W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} for PTP synchronization messages and W i, BE W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} for BE traffic, followed by a fixed guard band T GB T^{\text{GB}} to avoid interference on DC traffic. Thus, T i nc = W i, DC + W i, PTP + W i, BE + T GB T_{i}^{\text{nc}}~=~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~+~W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}~+~W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}~+~T^{\text{GB}}, ∀ i ∈ ℐ TSN \forall~i~\in~\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. We consider W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} occupies a negligible fraction of T i nc T_{i}^{\text{nc}}, 100 to 1000 times smaller, due to the low frequency of synchronization messages, i.e., W i, PTP ≪ W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}\ll W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and W i, PTP ≪ W i, BE W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}\ll W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}. Due to this and for ease of reading, W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} is omitted in subsequent equations, while it is implicitly assumed to be scheduled immediately after W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. For further details on PTP planning, see [ 21 ].
每个网络周期包含三个互不重叠的传输窗口(见图 2):用于 DC 业务的 \(W_{i,\text{DC}}\)、用于 PTP 同步消息的 \(W_{i,\text{PTP}}\),以及用于 BE 业务的 \(W_{i,\text{BE}}\),其后跟随一个固定保护带 \(T^{\text{GB}}\),以避免对 DC 业务造成干扰。因此, \[ T_{i}^{\text{nc}}=W_{i,\text{DC}}+W_{i,\text{PTP}}+W_{i,\text{BE}}+T^{\text{GB}},\quad \forall i\in\mathcal{I}^{\text{TSN}}. \] 我们认为,由于同步消息频率较低,\(W_{i,\text{PTP}}\) 只占 \(T_{i}^{\text{nc}}\) 的一个可忽略的比例,小 100 到 1000 倍,即 \(W_{i,\text{PTP}}\ll W_{i,\text{DC}}\) 且 \(W_{i,\text{PTP}}\ll W_{i,\text{BE}}\)。因此,并且为了便于阅读,后续方程中省略 \(W_{i,\text{PTP}}\),同时隐含假设它被调度在 \(W_{i,\text{DC}}\) 之后立即执行。关于 PTP 规划的进一步细节,见文献 [21]。
三个窗口、固定保护带、周期求和公式均保留;“100 to 1000 times smaller”译为“小 100 到 1000 倍”,语义较直译但中文略生硬;PTP 窗口在后续公式省略但隐含紧随 DC 窗口的逻辑已保留。未发现公式风险。
Finally, at the MS, each batch of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets belonging to the DC flow is assumed to be available at the start of every network cycle.
最后,在 MS 处,假定属于 DC 流的每一批 \(N_{\text{DC}}\) 个分组在每个网络周期开始时均可用。
MS、DC、\(N_{\text{DC}}\) 保留;“each batch”和“at the start of every network cycle”未遗漏。未发现明显问题。
For each packet of flow s ∈ 𝒮 s\in\mathcal{S} traversing node i ∈ ℐ i\in\mathcal{I}, the total delay comprises five components: input queuing delay, processing delay, output queuing delay, transmission delay, and propagation delay. These can be seen in Fig. 3.
对于穿越节点 \(i \in \mathcal{I}\) 的流 \(s \in \mathcal{S}\) 中的每个分组,总时延由五个组成部分构成:输入排队时延、处理时延、输出排队时延、传输时延和传播时延。这些组成部分可见于图 3。
五类 delay 的顺序与含义保持一致;“packet of flow”译为“流中的每个分组”;节点集合 \(\mathcal{I}\) 和流集合 \(\mathcal{S}\) 已保留。未发现明显问题。
The input queuing delay d i, s que,in d_{i,s}^{\text{que,in}} is the interval between the arrival of a packet at node i i and the start of its processing. The processing delay d i, s proc d_{i,s}^{\text{proc}} corresponds to the time required by node i i to parse the packet header and determine the forwarding action. The output queuing delay d i, s que,out d_{i,s}^{\text{que,out}} refers to the delay from the end of processing at node i i until the packet is transmitted to the next hop.
输入排队时延 \(d_{i,s}^{\text{que,in}}\) 是分组到达节点 \(i\) 与其开始处理之间的时间间隔。处理时延 \(d_{i,s}^{\text{proc}}\) 对应于节点 \(i\) 解析分组头并确定转发动作所需的时间。输出排队时延 \(d_{i,s}^{\text{que,out}}\) 指从节点 \(i\) 处理结束到分组被传输到下一跳之间的时延。
三个时延定义准确;“parse the packet header”和“determine the forwarding action”均已翻译;“until the packet is transmitted to the next hop”未误译为到达下一跳。未发现明显问题。
The transmission delay d ε i, j, s tran d_{\varepsilon_{i,j},s}^{\text{tran}} corresponds to the time needed to serialize all bits of the packet over the link ε i, j ∈ ℰ \varepsilon_{i,j}\in\mathcal{E}. It depends on the packet size L s L_{s} and the link capacity r ε i, j r_{\varepsilon_{i,j}}, and is given by d ε i, j, s tran = L s / r ε i, j d_{\varepsilon_{i,j},s}^{\text{tran}}=L_{s}/r_{\varepsilon_{i,j}}. The propagation delay D ε i, j prop D_{\varepsilon_{i,j}}^{\text{prop}} is the time a signal takes to travel through link ε i, j ∈ ℰ \varepsilon_{i,j}\in\mathcal{E} and is assumed to be constant for any flow s ∈ 𝒮 s\in\mathcal{S} in that link in time.
传输时延 \(d_{\varepsilon_{i,j},s}^{\text{tran}}\) 对应于通过链路 \(\varepsilon_{i,j}\in\mathcal{E}\) 将分组的所有比特串行化所需的时间。它取决于分组大小 \(L_s\) 和链路容量 \(r_{\varepsilon_{i,j}}\),并由 \[ d_{\varepsilon_{i,j},s}^{\text{tran}}=L_s/r_{\varepsilon_{i,j}} \] 给出。传播时延 \(D_{\varepsilon_{i,j}}^{\text{prop}}\) 是信号穿过链路 \(\varepsilon_{i,j}\in\mathcal{E}\) 所需的时间,并假定对该链路中任意流 \(s\in\mathcal{S}\) 而言随时间保持恒定。
transmission delay 与 propagation delay 区分清楚;串行化、分组大小、链路容量、公式 \(L_s/r_{\varepsilon_{i,j}}\) 已保留;“constant for any flow ... in that link in time”译为随时间恒定,含义准确。未发现明显问题。
In this section, we analyze how 5G impacts TAS scheduling performance. First, we define the E2E delay for a packet of an arbitrary flow and study how the 5G delay component impacts it. Then, we formalize the constraint for the transmission window of the DC flow in TSN switches. Next, we introduce the concept of offset between the network cycles of the MS and SL switches, and derive the conditions required to ensure deterministic communication. Finally, we analyze how this offset interacts with the 5G delay component, and evaluate how different TAS parameter configurations influence the scheduling performance across various scenarios.
在本节中,我们分析 5G 如何影响 TAS 调度性能。首先,我们定义任意流的一个分组的 E2E 时延,并研究 5G 时延组成部分如何影响该时延。然后,我们形式化 TSN 交换机中 DC 流传输窗口的约束。接下来,我们引入 MS 与 SL 交换机的网络周期之间的偏移概念,并推导确保确定性通信所需的条件。最后,我们分析该偏移如何与 5G 时延组成部分相互作用,并评估不同 TAS 参数配置如何在各种场景中影响调度性能。
本段为章节路线说明;E2E、TAS、TSN、DC、MS、SL 等缩写保留;“offset between the network cycles”译为“网络周期之间的偏移”;因果与顺序连接词 First/Then/Next/Finally 均保留。未发现明显问题。
The set of flows 𝒮 \mathcal{S} traverses a sequence of network nodes to reach their destination, as illustrated in Fig. 3. The E2E packet transmission delay d s E2E d_{s}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}} for the flow s ∈ 𝒮 s\in\mathcal{S} along this path is computed as the sum of delays at each network node plus the transmission delays on each link: d s E2E = ∑ i ∈ ℐ (d i, s que,in + d i, s proc + d i, s que,out) + ∑ e ∈ ℰ (d e, s tran + D e prop). d_{s}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}}\hskip-1.42271pt=\hskip-2.84544pt\sum_{i\in\mathcal{I}}\left(d_{i,s}^{\text{que,in}}\hskip-2.84544pt+\hskip-1.42271ptd_{i,s}^{\text{proc}}\hskip-1.42271pt+\hskip-1.42271ptd_{i,s}^{\text{que,out}}\right)\hskip-1.42271pt+\sum_{e\in\mathcal{E}}\left(d_{e,s}^{\text{tran}}\hskip-2.84544pt+\hskip-1.42271ptD_{e}^{\text{prop}}\right). (2) The 5G delay d s 5G d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}} is defined as the sum of node processing and queuing delays, plus link transmission in the 5G domain: d s 5G = ∑ j ∈ ℐ 5G (d j, s que,in + d j, s proc + d j, s que,out) + ∑ k ∈ ℰ 5G (d k, s tran + D k prop). d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}=\hskip-1.42271pt\sum_{j\in\mathcal{I^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}}}\hskip-2.84544pt\left(d_{j,s}^{\text{que,in}}\hskip-1.42271pt+\hskip-1.42271ptd_{j,s}^{\text{proc}}\hskip-1.42271pt+\hskip-1.42271ptd_{j,s}^{\text{que,out}}\right)\hskip-0.85355pt+\hskip-2.84544pt\sum_{k\in\mathcal{E^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}}}\hskip-2.84544pt\left(d_{k,s}^{\text{tran}}\hskip-1.42271pt+\hskip-1.42271ptD_{k}^{\text{prop}}\right). (3) To assess the impact of 5G in combination with the TAS scheduling, we consider the packet delay between the MS and SL output ports, d s MS, SL d_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}, and compute it as follows: d s MS, SL = ∑ ε ⊂ ℰ TSN (d ε, s tran + D ε prop) + d s 5G + d SL, s que,in + d SL proc + d SL, s que,out. d_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}=\hskip-2.84544pt\sum_{\varepsilon\subset\mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}\hskip-5.69046pt\left(d_{\varepsilon,s}^{\text{tran}}\hskip 0.0pt+\hskip-1.42271ptD_{\varepsilon}^{\text{prop}}\hskip-2.84544pt\hskip 2.84544pt\right)+d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,in}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}^{\text{proc}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,out}}\hskip-1.42271pt. (4) For convenience, we also consider the packet delay between the MS output port and the SL switch processing, d ~ s MS, SL \widetilde{d}_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}, that is, excluding the SL output queuing delay, d SL, s que,out d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,out}}, as it is influenced by the TAS configuration: d ~ s MS, SL = ∑ ε ⊂ ℰ TSN (d ε, s tran + D ε prop) + d s 5G + d SL, s que,in + d SL proc. \widetilde{d}_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}=\sum_{\varepsilon\subset\mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}\left(d_{\varepsilon,s}^{\text{tran}}\hskip-1.42271pt+D_{\varepsilon}^{\text{prop}}\right)+d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,in}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}^{\text{proc}}\hskip-1.42271pt. (5) In this work, we rely on empirical delay measurements for our analysis. Therefore, our model has to consider the synchronization error that inherently affects the delay measurement between separate TSN nodes, i.e., Δ i, j \Delta_{i,j}, ∀ i, j ∈ ℐ TSN \forall i,j\in\mathcal{I^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}. Hence, the empirical measurement of the packet delay between the MS and the SL output ports, d s emp d_{s}^{\text{emp}}, could be expressed as in Eq. (6), where Δ MS, SL \Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}} refers to the synchronization error between MS and SL. d s emp = d s MS, SL + Δ MS, SL. d_{s}^{\text{emp}}=d_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}+\Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}. (6) The value of Δ MS, SL \Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}} is assumed to take positive or negative values, as clocks may be ahead or behind each other at any instant. A higher | Δ MS, SL | |\Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}| may cause the measurements to become unreliable, as it distorts the temporal correspondence between events. In this way, the E2E latency from Eq. (2) is also affected by the synchronization error. Thus, its empirical measurements can be written as d s E2Emp d_{s}^{\text{E2Emp}} in Eq. (7). d s E2Emp = d MS, s que,in + d MS proc + d MS, s que,out + d s emp. d_{s}^{\text{E2Emp}}=d_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},s}^{\text{que,in}}+d_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{proc}}+d_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},s}^{\text{que,out}}+d_{s}^{\text{emp}}. (7) Similarly, the empirical measurement of the packet delay between the MS output port and the SL switch processing, from now on Zero-Wait-at-SL (ZWSL) empirical delay, d ~ s emp \widetilde{d}_{s}^{\text{emp}}, could be expressed as in Eq. (8). d ~ s emp = d ~ s MS, SL + Δ MS, SL. \widetilde{d}_{s}^{\text{emp}}=\widetilde{d}_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}+\Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}. (8) Observation –. The 5G system delay, d s 5G d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}, is significantly larger than the transmission delays over wired links, d ε i, j, s tran d_{\varepsilon_{i,j},s}^{\text{tran}}, ∀ ε i, j ∈ ℰ \forall\varepsilon_{i,j}\in\mathcal{E} \ { ε gNB, UE } \{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB},\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}}}\}, ∀ i, j ∈ ℐ \forall i,j\in\mathcal{I}; the propagation delays, D ε i, j prop D_{\varepsilon_{i,j}}^{\text{prop}}, ∀ ε i, j ∈ ℰ \forall\varepsilon_{i,j}\in\mathcal{E}, ∀ i, j ∈ ℐ \forall i,j\in\mathcal{I}; and processing delays in the TSN switches, d i, s proc, ∀ i ∈ ℐ TSN d_{i,s}^{\text{proc}},\forall i\in\mathcal{I^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}. On the one hand, transmission delays over wired links are typically within the microsecond range. For example, a 200 Bytes packet, assuming 42 Bytes of overhead, has a transmission delay of 1.9 μ \mu s in 1 Gbps links. Similarly, processing delays in TSN switches are typically also in the microsecond range [ 24 ]. On the other hand, 5G system delay is in the range from milliseconds to a few tens of milliseconds [ 11 ]. This delay and jitter dominance will be corroborated experimentally in Section VI.
流集合 \(\mathcal{S}\) 会穿越一系列网络节点以到达其目的地,如图 3 所示。沿该路径,流 \(s\in\mathcal{S}\) 的 E2E 分组传输时延 \(d_s^{\text{E2E}}\) 计算为每个网络节点处的时延之和加上每条链路上的传输时延: \[ d_s^{\text{E2E}} = \sum_{i\in\mathcal{I}} \left(d_{i,s}^{\text{que,in}}+d_{i,s}^{\text{proc}}+d_{i,s}^{\text{que,out}}\right) + \sum_{e\in\mathcal{E}} \left(d_{e,s}^{\text{tran}}+D_e^{\text{prop}}\right). \tag{2} \] 5G 时延 \(d_s^{\text{5G}}\) 定义为 5G 域中的节点处理时延和排队时延,加上链路传输时延之和: \[ d_s^{\text{5G}} = \sum_{j\in\mathcal{I}^{\text{5G}}} \left(d_{j,s}^{\text{que,in}}+d_{j,s}^{\text{proc}}+d_{j,s}^{\text{que,out}}\right) + \sum_{k\in\mathcal{E}^{\text{5G}}} \left(d_{k,s}^{\text{tran}}+D_k^{\text{prop}}\right). \tag{3} \] 为了评估 5G 与 TAS 调度结合时的影响,我们考虑 MS 与 SL 输出端口之间的分组时延 \(d_s^{\text{MS},\text{SL}}\),并按如下方式计算: \[ d_s^{\text{MS},\text{SL}} = \sum_{\varepsilon\subset\mathcal{E}^{\text{TSN}}} \left(d_{\varepsilon,s}^{\text{tran}}+D_{\varepsilon}^{\text{prop}}\right) + d_s^{\text{5G}} + d_{\text{SL},s}^{\text{que,in}} + d_{\text{SL}}^{\text{proc}} + d_{\text{SL},s}^{\text{que,out}}. \tag{4} \] 为方便起见,我们还考虑 MS 输出端口与 SL 交换机处理之间的分组时延 \(\widetilde{d}_s^{\text{MS},\text{SL}}\),即排除 SL 输出排队时延 \(d_{\text{SL},s}^{\text{que,out}}\),因为它会受到 TAS 配置的影响: \[ \widetilde{d}_s^{\text{MS},\text{SL}} = \sum_{\varepsilon\subset\mathcal{E}^{\text{TSN}}} \left(d_{\varepsilon,s}^{\text{tran}}+D_{\varepsilon}^{\text{prop}}\right) + d_s^{\text{5G}} + d_{\text{SL},s}^{\text{que,in}} + d_{\text{SL}}^{\text{proc}}. \tag{5} \] 在本文中,我们依赖经验时延测量进行分析。因此,我们的模型必须考虑同步误差,该误差会内在地影响不同 TSN 节点之间的时延测量,即 \(\Delta_{i,j}\),\(\forall i,j\in\mathcal{I}^{\text{TSN}}\)。因此,MS 与 SL 输出端口之间的分组时延的经验测量值 \(d_s^{\text{emp}}\) 可如式(6)表示,其中 \(\Delta_{\text{MS},\text{SL}}\) 指 MS 与 SL 之间的同步误差: \[ d_s^{\text{emp}}=d_s^{\text{MS},\text{SL}}+\Delta_{\text{MS},\text{SL}}. \tag{6} \] \(\Delta_{\text{MS},\text{SL}}\) 的值假定可以取正值或负值,因为时钟在任意时刻都可能相对于彼此前进或滞后。较大的 \(|\Delta_{\text{MS},\text{SL}}|\) 可能导致测量变得不可靠,因为它会扭曲事件之间的时间对应关系。这样,式(2)中的 E2E 时延也会受到同步误差影响。因此,其经验测量值可写为式(7)中的 \(d_s^{\text{E2Emp}}\): \[ d_s^{\text{E2Emp}} = d_{\text{MS},s}^{\text{que,in}} + d_{\text{MS}}^{\text{proc}} + d_{\text{MS},s}^{\text{que,out}} + d_s^{\text{emp}}. \tag{7} \] 类似地,MS 输出端口与 SL 交换机处理之间的分组时延的经验测量值,从现在起称为 Zero-Wait-at-SL(ZWSL)经验时延 \(\widetilde{d}_s^{\text{emp}}\),可如式(8)表示: \[ \widetilde{d}_s^{\text{emp}} = \widetilde{d}_s^{\text{MS},\text{SL}} + \Delta_{\text{MS},\text{SL}}. \tag{8} \] 观察:5G 系统时延 \(d_s^{\text{5G}}\) 显著大于有线链路上的传输时延 \(d_{\varepsilon_{i,j},s}^{\text{tran}}\),\(\forall \varepsilon_{i,j}\in\mathcal{E}\setminus\{\varepsilon_{\text{gNB},\text{UE}}\}\),\(\forall i,j\in\mathcal{I}\);也显著大于传播时延 \(D_{\varepsilon_{i,j}}^{\text{prop}}\),\(\forall \varepsilon_{i,j}\in\mathcal{E}\),\(\forall i,j\in\mathcal{I}\);并且显著大于 TSN 交换机中的处理时延 \(d_{i,s}^{\text{proc}}\),\(\forall i\in\mathcal{I}^{\text{TSN}}\)。一方面,有线链路上的传输时延通常处于微秒量级。例如,假设有 42 Bytes 的开销,一个 200 Bytes 分组在 1 Gbps 链路中的传输时延为 \(1.9\,\mu s\)。类似地,TSN 交换机中的处理时延通常也处于微秒量级 [24]。另一方面,5G 系统时延处于从毫秒到几十毫秒的范围 [11]。这种时延和抖动的主导性将在第 VI 节中通过实验得到佐证。
本段包含多个公式和定义,已逐项保留式(2)至式(8)、E2E、5G、MS、SL、ZWSL、经验测量、同步误差等关键术语;\(\Delta_{\text{MS},\text{SL}}\) 可正可负及其可靠性影响逻辑完整;“between the MS output port and the SL switch processing”译为“MS 输出端口与 SL 交换机处理之间”准确。风险点:输入中式(3)的集合 LaTeX 存在疑似 OCR/抽取瑕疵(\(\mathcal{I^{5G}}\)、\(\mathcal{E^{5G}}\)),译文按常规数学记法规范为 \(\mathcal{I}^{\text{5G}}\)、\(\mathcal{E}^{\text{5G}}\);式(4)(5)中的 \(\sum_{\varepsilon\subset\mathcal{E}^{\text{TSN}}}\) 原文使用 subset 符号,语义可能本应为链路属于集合,需人工确认。另,“200 Bytes packet, assuming 42 Bytes of overhead”中 200 Bytes 是否包含开销上下文不完全明确,但 1.9 μs 数字已保留。
As a consequence of this observation, the 5G system delay, and its associated jitter, play a prominent role in Eq. (4)-(8), and therefore in the TAS configuration of the TSN switches. Since our analysis targets the DC flow, the formulation presented from this point onward assumes s = DC s=\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}.
作为这一观察结果的后果,5G 系统时延及其相关抖动在式 (4)-(8) 中起着显著作用,因此也在 TSN 交换机的 TAS 配置中起着显著作用。由于我们的分析以 DC 流为目标,从这一点往后给出的公式表述假设 \(s=\text{DC}\)。
术语“5G system delay”译为“5G 系统时延”,“associated jitter”译为“相关抖动”,“TAS configuration”译为“TAS 配置”,与上下文一致;式号 (4)-(8) 保留;\(s=\text{DC}\) 保留。未发现明显问题。
The transmission window duration W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} for flow DC ∈ 𝒮 \text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}\in\mathcal{S} at TSN switch i ∈ ℐ TSN i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} must satisfy two conditions: it must be strictly shorter than the network cycle T i nc T_{i}^{\text{nc}} and equal or greater than the cumulative transmission time of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets through the output port. These constraints are formalized in Eq. (9), where j ∈ ℐ j\in\mathcal{I} is the next network node after switch i i. N DC ⋅ d ε i, j, DC tran ≤ W i, DC < T i nc. N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\cdot d_{\varepsilon_{i,j},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{tran}}\;\leq W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}<T_{i}^{\text{nc}}. (9) Violating these bounds can lead to performance degradation. If W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is too short, not all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets can be transmitted within a single network cycle. The remaining packets accumulate and are deferred to subsequent network cycles, introducing additional delays that are multiples of T i nc T_{i}^{\text{nc}}. On the other hand, if W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} exceeds the network cycle duration, it monopolizes the schedule, preventing other flows s ∈ 𝒮 ∖ { DC } s\in\mathcal{S}\setminus\{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}\} from being scheduled during that network cycle.
对于 TSN 交换机 \(i\in\mathcal{I}^{\text{TSN}}\) 上的流 \(\text{DC}\in\mathcal{S}\),其传输窗口持续时间 \(W_{i,\text{DC}}\) 必须满足两个条件:它必须严格短于网络周期 \(T_i^{\text{nc}}\),并且必须大于或等于 \(N_{\text{DC}}\) 个分组通过输出端口的累计传输时间。这些约束在式 (9) 中形式化表示,其中 \(j\in\mathcal{I}\) 是交换机 \(i\) 之后的下一个网络节点。 \[ N_{\text{DC}}\cdot d_{\varepsilon_{i,j},\text{DC}}^{\text{tran}}\leq W_{i,\text{DC}}<T_i^{\text{nc}}. \tag{9} \] 违反这些边界可能导致性能退化。如果 \(W_{i,\text{DC}}\) 过短,则并非所有 \(N_{\text{DC}}\) 个分组都能在单个网络周期内传输。剩余分组会累积,并被推迟到后续网络周期,从而引入额外时延,这些额外时延是 \(T_i^{\text{nc}}\) 的倍数。另一方面,如果 \(W_{i,\text{DC}}\) 超过网络周期持续时间,它会独占调度,从而阻止其他流 \(s\in\mathcal{S}\setminus\{\text{DC}\}\) 在该网络周期期间被调度。
“strictly shorter than”已译为“严格短于”;“equal or greater than”已译为“大于或等于”;公式不等号方向和严格小于号保留;\(j\) 的定义、\(N_{\text{DC}}\)、\(T_i^{\text{nc}}\) 等符号保留。需注意原文“equal or greater than”语法应为“equal to or greater than”,但含义明确。未发现明显问题。
We consider identical TAS scheduling configurations at both MS and SL switches, i.e., T MS nc = T SL nc T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}=T_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}^{\text{nc}} and W MS, DC = W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Under this assumption, let us define the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} as the time difference between the start of the network cycle at the MS and SL. This offset must be configured to ensure all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets, generated within a single application cycle, arrive at the output queue of the SL and are transmitted through its egress port before the corresponding transmission window closes.
我们考虑 MS 和 SL 两个交换机采用相同的 TAS 调度配置,即 \(T_{\text{MS}}^{\text{nc}}=T_{\text{SL}}^{\text{nc}}\) 且 \(W_{\text{MS},\text{DC}}=W_{\text{SL},\text{DC}}\)。在这一假设下,我们将偏移量 \(\delta_{\text{DC}}\) 定义为 MS 和 SL 处网络周期开始时间之间的时间差。必须配置该偏移量,以确保在单个应用周期内生成的所有 \(N_{\text{DC}}\) 个分组到达 SL 的输出队列,并在对应的传输窗口关闭之前通过其出口端口传输。
MS、SL、TAS、DC 等缩写保留;“offset”译为“偏移量”;“application cycle”译为“应用周期”;“egress port”译为“出口端口”。公式等式保留准确。未发现明显问题。
Since all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets are sent as a burst from the MS into the 5G system, it is essential to characterize the delay experienced by these packets in the 5G system to establish a value for the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Assuming that the 5G system capacity is generally lower than the capacity of a wired link [ 11 ], the 5G segment constitutes a bottleneck in the 5G - TSN network, where packets experience increasing queuing delays. The first packet in the burst, if no retransmission is required, may traverse the 5G network with minimal delay, i.e., min (d DC 5G) \min(d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}), while each subsequent packet must wait for the transmission of the previous packets. Consequently, delay accumulates across the burst, such that the last packet tends to experience the highest latency, i.e., max (d DC 5G) \max(d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}), which already includes the cumulative queuing delay of the entire burst. Consequently, the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be set to at least max (d ~ DC emp) \text{max}(\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}) to guarantee the availability of packets at the SL output port queue to be transmitted on time. This leads to the condition in Eq. (10). δ DC ≥ max (d ~ DC emp). \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\text{max}(\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}). (10) Since d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} is random by nature, it is necessary to characterize its behavior statistically. In this work, we define a statistical upper bound based on a given percentile p ∈ [ 0, 1) p\in[0,1) of the CDF F d ~ DC emp (⋅) F_{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}}(\cdot) of the ZWSL empirical delay. Specifically, we denote this bound as D ^ DC, p emp = F d ~ DC emp − 1 (p) \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}}=F_{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}}^{-1}(p), which corresponds to the p -th p\text{-th} percentile of the delay distribution. A higher value of p p increases the confidence d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} will remain below D ^ DC, p emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}} [ 25 ]. For instance, setting p = 0.999 p=0.999 yields an upper bound such that 99.9% of packets experience delays below this value. Accordingly, we set the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} as in Eq. (11), ensuring that at least p ⋅ 100 p\cdot 100 % of packets have been queued before the transmission window in the SL closes. δ DC ≥ D ^ DC,p emp. \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC},p}}^{\text{emp}}. (11) An additional parameter of interest is the time instant at which an initial transmission window opens at the SL for transmitting packets of the DC flow. We denote this instant as the network cycle offset δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, formally defined as follows: δ DC ′ = { δ DC, if δ DC < T i nc. δ DC mod T i nc, otherwise. \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\begin{cases}\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},&\text{if }\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}<T_{i}^{\text{nc}}.\\ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\bmod T_{i}^{\text{nc}},&\text{otherwise}.\end{cases} (12) The network cycle offset δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime} depends on the configured offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and the network cycle duration T i nc T_{i}^{\text{nc}}. When δ DC < T i nc \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~<~T_{i}^{\text{nc}}, it holds that δ DC ′ = δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}~=~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the transmission window opens exactly at the configured offset. Conversely, if δ DC ≥ T i nc \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\geq~T_{i}^{\text{nc}}, the initial transmission opportunity may occur before the configured offset, and the effective opening time is given by δ DC ′ = δ DC mod T i nc ∈ [ 0, T i nc) \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\bmod T_{i}^{\text{nc}}\in[0,T_{i}^{\text{nc}}).
由于所有 \(N_{\text{DC}}\) 个分组都作为一个突发流从 MS 发送到 5G 系统中,因此,为偏移量 \(\delta_{\text{DC}}\) 确定一个取值,有必要刻画这些分组在 5G 系统中经历的时延。假设 5G 系统容量通常低于有线链路的容量 [11],则 5G 段构成 5G-TSN 网络中的瓶颈,在该瓶颈处,分组会经历不断增加的排队时延。如果不需要重传,突发流中的第一个分组可能以最小时延穿越 5G 网络,即 \(\min(d_{\text{DC}}^{\text{5G}})\),而每一个后续分组都必须等待前面分组的传输。因此,时延会在整个突发流内累积,使得最后一个分组往往经历最高时延,即 \(\max(d_{\text{DC}}^{\text{5G}})\),该值已经包含整个突发流的累计排队时延。因此,偏移量 \(\delta_{\text{DC}}\) 必须至少设置为 \(\max(\widetilde{d}_{\text{DC}}^{\text{emp}})\),以保证分组在 SL 输出端口队列中可用,并能够按时传输。这得到式 (10) 中的条件。 \[ \delta_{\text{DC}}\geq \max(\widetilde{d}_{\text{DC}}^{\text{emp}}). \tag{10} \] 由于 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 本质上是随机的,因此有必要从统计上刻画其行为。在本文中,我们基于 ZWSL 经验时延的 CDF \(F_{\widetilde{d}_{\text{DC}}^{\text{emp}}}(\cdot)\) 的给定百分位 \(p\in[0,1)\),定义一个统计上界。具体而言,我们将该上界记为 \(\hat{D}_{\text{DC},p}^{\text{emp}}=F_{\widetilde{d}_{\text{DC}}^{\text{emp}}}^{-1}(p)\),它对应于时延分布的第 \(p\) 百分位。较高的 \(p\) 值会提高 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 保持低于 \(\hat{D}_{\text{DC},p}^{\text{emp}}\) 的置信度 [25]。例如,设置 \(p=0.999\) 会得到这样一个上界,使得 99.9% 的分组经历低于该值的时延。相应地,我们按式 (11) 设置偏移量 \(\delta_{\text{DC}}\),以确保至少 \(p\cdot 100\%\) 的分组在 SL 中的传输窗口关闭之前已经入队。 \[ \delta_{\text{DC}}\geq \hat{D}_{\text{DC},p}^{\text{emp}}. \tag{11} \] 另一个值得关注的参数是 SL 处用于传输 DC 流分组的初始传输窗口打开的时间瞬间。我们将这一瞬间记为网络周期偏移量 \(\delta_{\text{DC}}^{\prime}\),形式化定义如下: \[ \delta_{\text{DC}}^{\prime}= \begin{cases} \delta_{\text{DC}}, & \text{if } \delta_{\text{DC}}<T_i^{\text{nc}},\\ \delta_{\text{DC}}\bmod T_i^{\text{nc}}, & \text{otherwise}. \end{cases} \tag{12} \] 网络周期偏移量 \(\delta_{\text{DC}}^{\prime}\) 取决于所配置的偏移量 \(\delta_{\text{DC}}\) 和网络周期持续时间 \(T_i^{\text{nc}}\)。当 \(\delta_{\text{DC}}<T_i^{\text{nc}}\) 时,有 \(\delta_{\text{DC}}^{\prime}=\delta_{\text{DC}}\),并且传输窗口恰好在所配置的偏移量处打开。相反,如果 \(\delta_{\text{DC}}\geq T_i^{\text{nc}}\),则初始传输机会可能发生在所配置的偏移量之前,而有效打开时间由 \(\delta_{\text{DC}}^{\prime}=\delta_{\text{DC}}\bmod T_i^{\text{nc}}\in[0,T_i^{\text{nc}})\) 给出。
本段公式和统计定义较多,已保留 \(\min\)、\(\max\)、CDF、逆 CDF、百分位、\(p\in[0,1)\)、\(p=0.999\)、99.9%、式 (10)-(12);“Consequently”连续出现两次,译文均体现因果;“ZWSL empirical delay”译为“ZWSL 经验时延”。风险点:原文将 \(p\in[0,1)\) 称为 “p-th percentile”,严格说 \(p=0.999\) 对应 99.9 百分位,中文按原意处理;公式 (11) 的输入文本中符号下标存在排版噪声,译文采用一致写法 \(\hat{D}_{\text{DC},p}^{\text{emp}}\)。
We consider deterministic transmission as the scenario in which the entire burst of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets in the same transmission window of a given network cycle at the MS are delivered and forwarded within a single transmission window at the SL switch. In this case, the E2E jitter remains bounded by the window size W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, thus enabling predictable communication.
我们将确定性传输视为这样一种场景:在 MS 处给定网络周期的同一个传输窗口中,包含 \(N_{\text{DC}}\) 个分组的整个突发流被交付,并在 SL 交换机处的单个传输窗口内被转发。在这种情况下,E2E 抖动仍由窗口大小 \(W_{i,\text{DC}}\) 约束,从而使可预测通信成为可能。
“deterministic transmission”译为“确定性传输”;“entire burst”译为“整个突发流”;“delivered and forwarded”译为“被交付,并……被转发”;E2E、\(W_{i,\text{DC}}\) 保留。未发现明显问题。
To determine if a deterministic transmission is possible, it is essential to examine the relationship between the 5G -induced delay and jitter and the following TAS parameters: (i) the network cycle offset δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, (ii) the network cycle duration T i nc T_{i}^{\text{nc}}, and (iii) the size of the transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}.
为了确定是否可能实现确定性传输,有必要考察 5G 引入的时延和抖动与以下 TAS 参数之间的关系:(i) 网络周期偏移量 \(\delta_{\text{DC}}^{\prime}\),(ii) 网络周期持续时间 \(T_i^{\text{nc}}\),以及 (iii) 传输窗口大小 \(W_{i,\text{DC}}\)。
“5G-induced delay and jitter”译为“5G 引入的时延和抖动”;三项 TAS 参数完整保留,编号、符号无遗漏。未发现明显问题。
Let us define the uncertainty interval t DC uni t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}} as the range of possible delays a packet from DC flow may experience when traversing the 5G - TSN network: t DC uni = [ min (d ~ DC emp), D ^ DC, p emp ]. t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}=\left[\min(\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}),\ \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}}\right]. (13) This interval is bounded by the minimum and maximum values of the per-packet d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. Note that we consider the p -th p\text{-th} percentile of the ZWSL empirical delay distribution as the maximum value of the uncertainty interval. Accordingly, we define the induced jitter of the 5G - TSN network, t DC jit t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}, as the difference between the limits of the uncertainty interval: t DC jit = max (t DC uni) − min (t DC uni). t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}). (14) To guarantee a deterministic transmission, two timing conditions must be satisfied between MS and SL:
我们将不确定性区间 \(t_{\text{DC}}^{\text{uni}}\) 定义为 DC 流中的一个分组在穿越 5G-TSN 网络时可能经历的时延范围: \[ t_{\text{DC}}^{\text{uni}}= \left[\min(\widetilde{d}_{\text{DC}}^{\text{emp}}),\ \hat{D}_{\text{DC},p}^{\text{emp}}\right]. \tag{13} \] 该区间由逐分组 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 的最小值和最大值界定。注意,我们将 ZWSL 经验时延分布的第 \(p\) 百分位视为不确定性区间的最大值。相应地,我们将 5G-TSN 网络的诱发抖动 \(t_{\text{DC}}^{\text{jit}}\) 定义为不确定性区间两个边界之间的差: \[ t_{\text{DC}}^{\text{jit}}= \max(t_{\text{DC}}^{\text{uni}})-\min(t_{\text{DC}}^{\text{uni}}). \tag{14} \] 为了保证确定性传输,MS 与 SL 之间必须满足两个时序条件:
“uncertainty interval”译为“不确定性区间”;“range of possible delays”译为“可能经历的时延范围”;式 (13)、式 (14) 保留。风险点:原文先说区间由逐分组 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 的最小值和最大值界定,但式 (13) 的上界实际使用第 \(p\) 百分位 \(\hat{D}_{\text{DC},p}^{\text{emp}}\),译文保留了这一潜在概念不一致,并通过“注意”句体现原文解释。
First Condition for Determinism: To ensure this one-to-one correspondence between the transmission windows at MS and SL, the start time of the transmission window at the SL switch, i.e., δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, must satisfy the two boundary conditions valid for any network cycle in Eq. (15) or, alternatively, those in Eq. (16). C1: max (t DC uni) ≤ δ DC ′, C2: δ DC ′ + W i, DC ≤ min (t DC uni) + T i nc. \begin{split}&\text{C1: }\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)\leq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\\ &\text{C2: }\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)+T_{i}^{\text{nc}}.\end{split} (15) The condition C1 indicates that the transmission window at the SL switch must start only after the last packet of the burst transmitted by the MS switch has arrived in the current network cycle, ensuring that all those packets are already available when the window opens. The condition C2 requires that the transmission window must close before the first packet served in a subsequent network cycle at the MS switch arrives at the SL switch in the next network cycle. C3: max (t DC uni) ≤ δ DC ′ + T i nc, C4: δ DC ′ + W i, DC ≤ min (t DC uni). \begin{split}&\text{C3: }\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)\leq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}},\\ &\text{C4: }\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right).\end{split} (16) The condition C3 stipulates that the transmission window at the SL switch can start only after the last packet of the burst transmitted by the MS switch has arrived in the previous network cycle. The condition C4 designates that the transmission window must close before the first packet served in a subsequent network cycle at the MS switch arrives at the SL switch in the current network cycle.
确定性的第一条件:为了确保 MS 和 SL 处传输窗口之间的这种一一对应关系,SL 交换机处传输窗口的开始时间,即 \(\delta_{\text{DC}}^{\prime}\),必须满足式 (15) 中对任意网络周期都有效的两个边界条件,或者也可以满足式 (16) 中的两个边界条件。 \[ \begin{split} &\text{C1: } \max(t_{\text{DC}}^{\text{uni}})\leq \delta_{\text{DC}}^{\prime},\\ &\text{C2: } \delta_{\text{DC}}^{\prime}+W_{i,\text{DC}}\leq \min(t_{\text{DC}}^{\text{uni}})+T_i^{\text{nc}}. \end{split} \tag{15} \] 条件 C1 表明,SL 交换机处的传输窗口必须仅在 MS 交换机传输的突发流的最后一个分组已经在当前网络周期中到达之后才开始,从而确保当窗口打开时所有这些分组都已经可用。条件 C2 要求传输窗口必须在 MS 交换机处后续网络周期中被服务的第一个分组于下一个网络周期到达 SL 交换机之前关闭。 \[ \begin{split} &\text{C3: } \max(t_{\text{DC}}^{\text{uni}})\leq \delta_{\text{DC}}^{\prime}+T_i^{\text{nc}},\\ &\text{C4: } \delta_{\text{DC}}^{\prime}+W_{i,\text{DC}}\leq \min(t_{\text{DC}}^{\text{uni}}). \end{split} \tag{16} \] 条件 C3 规定,SL 交换机处的传输窗口只能在 MS 交换机传输的突发流的最后一个分组已经在前一个网络周期中到达之后才开始。条件 C4 指明,传输窗口必须在 MS 交换机处后续网络周期中被服务的第一个分组于当前网络周期到达 SL 交换机之前关闭。
C1-C4 的不等式方向、\(\delta_{\text{DC}}^{\prime}\)、\(W_{i,\text{DC}}\)、\(T_i^{\text{nc}}\)、\(\min/\max\) 均保留;“or, alternatively”译为“或者也可以”,体现式 (15) 与式 (16) 的替代关系。风险点:C3/C4 对“previous/current network cycle”的描述较绕,译文严格按原文时序表达,建议结合图或上下文人工确认。
Either Eq. (15) or Eq. (16) ensures that all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets can be forwarded within a single transmission window. Otherwise, the burst will necessarily be split across multiple transmission windows, violating the determinism requirement. We call this effect Inter-Cycle Interference (ICI), where the packets scheduled in a network cycle may interfere with the ones scheduled in the next network cycle.
式 (15) 或式 (16) 中任意一个成立,都能确保所有 \(N_{\text{DC}}\) 个分组可以在单个传输窗口内被转发。否则,突发流必然会被拆分到多个传输窗口中,从而违反确定性要求。我们将这种效应称为跨周期干扰,即 Inter-Cycle Interference (ICI),其中,在一个网络周期中调度的分组可能会干扰下一个网络周期中调度的分组。
“Either Eq. (15) or Eq. (16)”译为“任意一个成立”;“necessarily be split”译为“必然会被拆分”;ICI 全称和缩写保留,并译为“跨周期干扰”。未发现明显问题。
As max (t DC uni) = D ^ DC, p emp \max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)=\ \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}}, in Eq. (15) and Eq. (16) the transmission window forwarding all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets at the SL switch is lower bounded by the p -th p\text{-th} percentile of the delay distribution of the ZWSL empirical delay, d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}, and hence by the p -th p\text{-th} percentile of 5G system delay distribution. As a relevant consequence, the packet empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} may increase in exchange for achieving deterministic transmission according to the p -th p\text{-th} percentile and the network cycle duration.
由于 \(\max(t_{\text{DC}}^{\text{uni}})=\hat{D}_{\text{DC},p}^{\text{emp}}\),在式 (15) 和式 (16) 中,SL 交换机处转发所有 \(N_{\text{DC}}\) 个分组的传输窗口以下述值为下界:ZWSL 经验时延 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 的时延分布的第 \(p\) 百分位,因此也以 5G 系统时延分布的第 \(p\) 百分位为下界。作为一个相关后果,为了根据第 \(p\) 百分位和网络周期持续时间实现确定性传输,分组经验时延 \(d_{\text{DC}}^{\text{emp}}\) 可能会相应增加。
保留 \(\max(t_{\text{DC}}^{\text{uni}})=\hat{D}_{\text{DC},p}^{\text{emp}}\)、式 (15)/(16)、\(N_{\text{DC}}\)、\(\widetilde{d}_{\text{DC}}^{\text{emp}}\)、\(d_{\text{DC}}^{\text{emp}}\)。风险点:原文 “transmission window ... is lower bounded by the p-th percentile” 表述略不直观,译文按“传输窗口以下述值为下界”处理;“may increase in exchange for achieving deterministic transmission”译为“为了……可能会相应增加”,建议人工确认是否应更强调“以增加经验时延为代价”。
Second Condition for Determinism: Directly comparing the upper and lower bounds for δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} isolated on one side of each of the inequalities, either in Eq. (15) or Eq. (16), leads to the additional condition in Eq. (17), which relates how the TAS parameters must be configured with respect to the 5G jitter to guarantee deterministic transmission. T i nc − W i, DC ≥ t DC jit. T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}. (17)
确定性的第二个条件:直接比较式(15)或式(16)中被单独置于各不等式一侧的 $\delta^{\prime}_{\mathrm{DC}}$ 的上界和下界,会得到式(17)中的附加条件;该条件关联了 TAS 参数必须如何相对于 5G 抖动进行配置,以保证确定性传输。$T_i^{\mathrm{nc}} - W_{i,\mathrm{DC}} \geq t_{\mathrm{DC}}^{\mathrm{jit}}$。(17)
术语方面,Determinism 译为“确定性”,TAS、DC 保留缩写;数字与公式编号(15)(16)(17)保留。公式方向为“大于等于”,未发现反向风险。原文中 LaTeX 提取含有 `glossaries` 标记,已按语义还原为 $\mathrm{DC}$。未发现明显问题。
Eq. (17) imposes a second fundamental condition on the interplay between the TAS configuration and the statistical behavior of the 5G system. It establishes that the 5G -induced jitter imposes a lower bound on the network cycle T i nc T_{i}^{\text{nc}}. Additionally, increasing the transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} not only requires larger network cycle T i nc T_{i}^{\text{nc}} as Eq. (17) shows, but it will also indirectly increase t DC jit t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}} due to the cumulative queuing effect on packets in the 5G system. Furthermore, Eq. (17) also imposes a limit on the link utilization for DC traffic, as additional transmission windows of DC traffic in the network cycle period would cause ICI and break the determinism.
式(17)对 TAS 配置与 5G 系统统计行为之间的相互作用施加了第二个基本条件。它表明,由 5G 引起的抖动对网络周期 $T_i^{\mathrm{nc}}$ 施加了一个下界。此外,增大传输窗口 $W_{i,\mathrm{DC}}$ 不仅如式(17)所示要求更大的网络周期 $T_i^{\mathrm{nc}}$,而且还会由于 5G 系统中数据包的累积排队效应而间接增大 $t_{\mathrm{DC}}^{\mathrm{jit}}$。进一步地,式(17)还对 DC 流量的链路利用率施加了限制,因为在网络周期时段内增加 DC 流量的传输窗口会导致 ICI,并破坏确定性。
术语方面,link utilization 译为“链路利用率”,cumulative queuing effect 译为“累积排队效应”,ICI 保留缩写。公式变量 $T_i^{\mathrm{nc}}$、$W_{i,\mathrm{DC}}$、$t_{\mathrm{DC}}^{\mathrm{jit}}$ 均保留。逻辑上保留了“不仅……而且……此外”的递进关系。未发现明显问题。
The conditions derived above provide a foundation for deterministic transmission. In the following subsection, we perform a detailed analysis of these conditions under different parameter configurations, identifying scenarios in which determinism is either achieved or violated to later be experimentally demonstrated in Section VI.
上文推导出的条件为确定性传输提供了基础。在以下小节中,我们将在不同参数配置下对这些条件进行详细分析,识别确定性能够实现或会被违反的场景,以便随后在第 VI 节中通过实验进行展示。
章节编号 Section VI 保留为“第 VI 节”。逻辑上,“to later be experimentally demonstrated”译为“以便随后……通过实验进行展示”,未省略因果目的。未发现明显问题。
The analysis of the impact of the empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}, largely dominated by the 5G system, on the coordinated operation of TAS mechanism in both the MS and SL switches is illustrated in Fig. 4, which shows the timing of data transmissions through the egress ports of the MS and SL switches interconnected via a 5G system. Each timeline is structured into consecutive network cycles, each of which contains a single transmission window allocated to the DC flow. The figure considers four distinct scenarios based on the relative timing between the transmission windows at the SL and the uncertainty interval t DC uni t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}} in Eq. (13). These scenarios are defined by specific conditions on the network parameters T i nc T_{i}^{\text{nc}}, W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the configured offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, which implicitly determines δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime} according to Eq. (12).
图 4 展示了对经验时延 $d_{\mathrm{DC}}^{\mathrm{emp}}$ 的影响分析,该经验时延在很大程度上由 5G 系统主导;分析对象是 MS 和 SL 两个交换机中 TAS 机制的协同运行。该图显示了通过 5G 系统互连的 MS 和 SL 交换机的出口端口上的数据传输时序。每条时间线都被组织为连续的网络周期,其中每个网络周期都包含一个分配给 DC 流的单一传输窗口。该图基于 SL 处传输窗口与式(13)中的不确定性区间 $t_{\mathrm{DC}}^{\mathrm{uni}}$ 之间的相对时序,考虑了四种不同场景。这些场景由网络参数 $T_i^{\mathrm{nc}}$、$W_{i,\mathrm{DC}}$ 以及所配置偏移 $\delta_{\mathrm{DC}}$ 上的特定条件定义;根据式(12),$\delta_{\mathrm{DC}}$ 隐式地决定 $\delta^{\prime}_{\mathrm{DC}}$。
术语方面,empirical delay 译为“经验时延”,uncertainty interval 译为“不确定性区间”,egress ports 译为“出口端口”。MS、SL、TAS、DC 保留缩写。图号和公式编号(4)(12)(13)准确保留。原文句子较长,已拆分但未改变逻辑。未发现明显问题。
Scenario 1: Deterministic transmission with early arrival. min (t DC uni) + T i nc − W i, DC ≥ δ DC ′ ≥ max (t DC uni). \min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})+T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}). (18) From the previous conditions C1 and C2 in Eq. (15), the lower bound δ DC ′ ≥ max (t DC uni) \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right), and the upper bound, δ DC ′ ≤ min (t DC uni) + T i nc − W i, DC \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)+T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, can be yielded for δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} in Eq. (18). With this, all packets from a given network cycle arrive at the SL before the initial transmission window opens. As a result, they can be transmitted entirely within that transmission window. This configuration ensures deterministic behavior in the 5G - TSN network, with packet jitter bounded by the duration of the transmission window, W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}.
场景 1:早到情况下的确定性传输。$\min(t_{\mathrm{DC}}^{\mathrm{uni}})+T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}} \geq \delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})$。(18)根据式(15)中先前的条件 C1 和 C2,可以为式(18)中的 $\delta^{\prime}_{\mathrm{DC}}$ 得到下界 $\delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})$,以及上界 $\delta^{\prime}_{\mathrm{DC}} \leq \min(t_{\mathrm{DC}}^{\mathrm{uni}})+T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}}$。在这种情况下,来自给定网络周期的所有数据包都会在初始传输窗口打开之前到达 SL。因此,它们可以完全在该传输窗口内被传输。该配置确保了 5G-TSN 网络中的确定性行为,并且数据包抖动由传输窗口的持续时间 $W_{i,\mathrm{DC}}$ 所界定。
公式不等式方向保留:左侧为上界,右侧为下界。C1、C2、式(15)(18)保留。early arrival 译为“早到”,initial transmission window 译为“初始传输窗口”。“bounded by”译为“由……所界定”,语义对应。未发现明显问题。
Scenario 2: Deterministic transmission with unused initial transmission window. min (t DC uni) − W i, DC ≥ δ DC ′ ≥ max (t DC uni) − T i nc. \begin{split}\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-T_{i}^{\text{nc}}.\end{split} (19) Now, from conditions C3 and C4 in Eq. (16), the lower bound δ DC ′ ≥ max (t DC uni) − T i nc \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)-T_{i}^{\text{nc}}, and the upper bound, δ DC ′ ≤ min (t DC uni) − W i, DC \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, can be yielded for δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} in Eq. (19). No packets arrive before the initial transmission window at SL closes, which therefore remains unused. However, all packets are available before the second transmission window opens, allowing their complete transmission. This results in higher minimum and maximum packet transmission delays compared to Scenario 1, increased by the waiting in the queue until the next network cycle. Nevertheless, the transmission remains deterministic, with bounded jitter.
场景 2:初始传输窗口未使用情况下的确定性传输。$\min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}} \geq \delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})-T_i^{\mathrm{nc}}$。(19)现在,根据式(16)中的条件 C3 和 C4,可以为式(19)中的 $\delta^{\prime}_{\mathrm{DC}}$ 得到下界 $\delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})-T_i^{\mathrm{nc}}$,以及上界 $\delta^{\prime}_{\mathrm{DC}} \leq \min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}}$。在 SL 处初始传输窗口关闭之前没有数据包到达,因此该窗口保持未使用。然而,所有数据包都会在第二个传输窗口打开之前可用,从而允许它们被完整传输。与场景 1 相比,这会导致更高的最小和最大数据包传输时延,增加量来自在队列中等待直到下一个网络周期。尽管如此,传输仍保持确定性,并具有有界抖动。
公式不等式方向与上下界解释一致。C3、C4、式(16)(19)保留。unused initial transmission window 译为“初始传输窗口未使用”,bounded jitter 译为“有界抖动”。“increased by the waiting in the queue”译为“增加量来自在队列中等待”,逻辑准确。未发现明显问题。
Scenario 3: Non-deterministic transmission with partial packet arrival. max (t DC uni) ≥ δ DC ′ ≥ min (t DC uni) − W i, DC. \max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})\geq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. (20) Some packets arrive in time to be transmitted during the initial transmission window at the SL, while others must wait for the second transmission window. This results in ICI, as defined in Section IV-D. Consequently, jitter increases to at least one full network cycle, thereby affecting packets scheduled in the next network cycle, and determinism is lost in the 5G - TSN network.
场景 3:部分数据包到达情况下的非确定性传输。$\max(t_{\mathrm{DC}}^{\mathrm{uni}}) \geq \delta^{\prime}_{\mathrm{DC}} \geq \min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}}$。(20)一些数据包及时到达,能够在 SL 处的初始传输窗口期间被传输,而另一些数据包必须等待第二个传输窗口。这会导致第 IV-D 节中定义的 ICI。因此,抖动至少增大到一个完整网络周期,从而影响在下一个网络周期中调度的数据包,并且 5G-TSN 网络中的确定性丧失。
partial packet arrival 译为“部分数据包到达”,non-deterministic transmission 译为“非确定性传输”。式(20)不等式方向保留。Section IV-D 译为“第 IV-D 节”。“at least one full network cycle”中的“至少”和“完整网络周期”已保留。未发现明显问题。
Scenario 4: Non-deterministic transmission with delayed arrival. δ DC ′ ≤ min { min (t DC uni) − W i, DC, max (t DC uni) − T i nc }. \begin{split}\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left\{\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\right.\left.\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-T_{i}^{\text{nc}}\right\}.\end{split} (21) This configuration represents the most adverse condition for the 5G - TSN network because Eq. (17) is not met. This means ICI is unavoidable. In this case, the second or subsequent transmission windows at SL may close before all packets have arrived, so some packets may be transmitted in the next network cycle, leading to the highest delays and jitter among all scenarios. We reflect the case where ICI is extended to a third transmission window due to the accumulation of packets at the SL ’s buffer between network cycles.
场景 4:延迟到达情况下的非确定性传输。$\delta^{\prime}_{\mathrm{DC}} \leq \min\{\min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}}, \max(t_{\mathrm{DC}}^{\mathrm{uni}})-T_i^{\mathrm{nc}}\}$。(21)该配置代表了 5G-TSN 网络的最不利条件,因为式(17)未被满足。这意味着 ICI 是不可避免的。在这种情况下,SL 处的第二个或后续传输窗口可能会在所有数据包到达之前关闭,因此一些数据包可能会在下一个网络周期中被传输,导致所有场景中最高的时延和抖动。我们反映了这样一种情况:由于网络周期之间数据包在 SL 缓冲区中的累积,ICI 被扩展到第三个传输窗口。
公式中的 $\min\{\cdot\}$ 结构保留,式(21)编号保留。delayed arrival 译为“延迟到达”,most adverse condition 译为“最不利条件”。最后一句 “We reflect the case...” 原文表达略不自然,可能依赖图示上下文;译为“我们反映了这样一种情况”较直译,但“reflect”具体含义可能为“展示/体现”。需人工确认图 4 语境。
In this section, we describe the implemented 5G - TSN testbed and the considered experimental setup.
在本节中,我们描述所实现的 5G-TSN 测试床以及所考虑的实验设置。
implemented testbed 译为“所实现的测试床”,experimental setup 译为“实验设置”。未发现明显问题。
To carry out our empirical analysis, we implemented the testbed depicted in Fig. 5. Its components are described below.
为了开展我们的经验分析,我们实现了图 5 所示的测试床。其组成部分说明如下。
empirical analysis 译为“经验分析”,testbed 译为“测试床”,图 5 编号保留。未发现明显问题。
5G System. The 5G network comprises a single gNB and a 5G core, both implemented on a PC with a 50 MHz PCIe Amarisoft Software Defined Radio (SDR) cards and an AMARI NW 600 license. The gNB operates in the n78 band with 30 kHz subcarrier spacing and a bandwidth of 50 MHz. Data transmission uses a Time Division Duplex (TDD) scheme with a pattern of four consecutive downlink slots, four uplink slots, and two flexible slots. Although our analysis focuses solely on downlink traffic, this configuration reserves resources for uplink, enabling a realistic testbed environment [ 26 ]. Two UEs are deployed, each consisting of a Quectel RM500Q-GL modem connected via USB to an Intel NUC 10 (i7-10710U, 16 GB RAM, 512 GB SSD) running Ubuntu 22.04. Experiments are conducted using one LABIFIX Faraday cage, with gNB antennas connected to the SDR via SMA connectors. Finally, although it is common to assign one DS-TT per UE [ 5 ], this proof of concept simplifies the setup by using a single DS-TT for both UEs. Similarly, we use a single NW-TT for simplicity’s sake.
5G 系统。该 5G 网络由单个 gNB 和一个 5G 核心网组成,二者均在一台 PC 上实现,该 PC 配备 50 MHz PCIe Amarisoft 软件定义无线电(SDR)卡以及 AMARI NW 600 许可证。gNB 工作在 n78 频段,子载波间隔为 30 kHz,带宽为 50 MHz。数据传输采用时分双工(TDD)方案,其模式为四个连续下行时隙、四个上行时隙和两个灵活时隙。尽管我们的分析仅关注下行流量,但该配置为上行保留资源,从而实现了一个现实的测试床环境 [26]。部署了两个 UE,每个 UE 均由一个 Quectel RM500Q-GL 调制解调器组成,该调制解调器通过 USB 连接到运行 Ubuntu 22.04 的 Intel NUC 10(i7-10710U、16 GB RAM、512 GB SSD)。实验使用一个 LABIFIX 法拉第笼进行,gNB 天线通过 SMA 连接器连接到 SDR。最后,尽管通常为每个 UE 分配一个 DS-TT [5],但该概念验证通过为两个 UE 使用单个 DS-TT 来简化设置。类似地,为了简化起见,我们使用单个 NW-TT。
术语 gNB、5G core、SDR、TDD、UE、DS-TT、NW-TT 均保留并给出必要中文;频段 n78、30 kHz、50 MHz、时隙数量、硬件型号与配置未发现数字遗漏。注意“Amarisoft SDR cards”原文有复数 cards,但上下文为一台 PC,译为“卡”可能需结合设备实际数量确认。其余未发现明显问题。
TSN Network. The TSN network is built using Safran’s WR-Z16 switches. One switch operates as the MS, another as the SL, and two additional switches act as TSN translators, i.e., NW-TT and DS-TT. The MS is directly connected to a Safran SecureSync 2400 server, which provides the GM clock to the SL for time synchronization. Since the 5G system operates in PTP TC mode (implemented in TSN translators [ 20 ]), an auxiliary WR-Z16 switch, also synchronized via a second SecureSync 2400, is used to distribute the 5G GM clock between the TSN translators. Each WR-Z16 switch is based on a Xilinx Zynq-7000 FPGA and a 1 GHz dual-core ARM Cortex-A9, enabling high switching rates and low processing delays under a Linux-based OS. The switches support IEEE 802.1Qbv TAS and VLANs, and include sixteen 1GbE Small Form-factor Pluggable (SFP) timing ports configurable as PTP MS or SL. Each egress port provides four priority hardware queues to separate the different traffic flows, with a maximum buffer size of 6.6 kB per queue. This limits the number of PCPs from 0 to 3, and also imposes a constraint on sustained throughput, as exceeding the draining capacity leads to packet drops. Additionally, timestamping probes on each port enables high-precision latency measurements between the output ports of the TSN nodes.
TSN 网络。TSN 网络使用 Safran 的 WR-Z16 交换机构建。一台交换机作为 MS 运行,另一台作为 SL 运行,另外两台交换机充当 TSN 转换器,即 NW-TT 和 DS-TT。MS 直接连接到一台 Safran SecureSync 2400 服务器,该服务器向 SL 提供 GM 时钟以进行时间同步。由于 5G 系统在 PTP TC 模式下运行(在 TSN 转换器中实现 [20]),因此使用一台辅助 WR-Z16 交换机在 TSN 转换器之间分发 5G GM 时钟,该辅助交换机也通过第二台 SecureSync 2400 进行同步。每台 WR-Z16 交换机均基于 Xilinx Zynq-7000 FPGA 和 1 GHz 双核 ARM Cortex-A9,能够在基于 Linux 的操作系统下实现高交换速率和低处理时延。交换机支持 IEEE 802.1Qbv TAS 和 VLAN,并包含十六个 1GbE 小型可插拔(SFP)定时端口,这些端口可配置为 PTP MS 或 SL。每个出口端口提供四个优先级硬件队列,用于分离不同流量流,每个队列的最大缓冲区大小为 6.6 kB。这将 PCP 的数量限制为从 0 到 3,并且还对持续吞吐量施加约束,因为超过排空能力会导致丢包。此外,每个端口上的时间戳探针能够在 TSN 节点的输出端口之间进行高精度时延测量。
MS、SL 在本文上下文中应分别为 Master/Slave 或主/从时钟相关角色,保留缩写避免误译;PTP TC、GM、NW-TT、DS-TT、SFP、PCP 均保留。数字“十六个 1GbE”“四个队列”“6.6 kB”准确。原文“limits the number of PCPs from 0 to 3”严格说是限制可用 PCP 取值范围为 0 到 3,译文已体现。未发现明显问题。
Testbed Clock Synchronization. Time synchronization between the TSN GM clock server and the MS is established via coaxial cables carrying two signals: a Pulse Per Second (PPS) pulse for absolute phase alignment and a 10 MHz reference for frequency synchronization through oscillator disciplining. Similarly, the auxiliary WR-Z16 switch is synchronized with the 5G GM clock server using the same coaxial interface, enabling accurate time distribution between the NW-TT and DS-TT to enable the TC mode [ 20 ]. In the testbed, the MS and SL communicate PTP packets over IPv4 using unicast User Datagram Protocol (UDP) and the E2E delay measurement mechanism. The PTP transmission rate is configured to 1 packet per second.
测试床时钟同步。TSN GM 时钟服务器与 MS 之间的时间同步通过承载两个信号的同轴电缆建立:一个用于绝对相位对齐的每秒脉冲(PPS)脉冲,以及一个用于通过振荡器驯服进行频率同步的 10 MHz 参考信号。类似地,辅助 WR-Z16 交换机使用相同的同轴接口与 5G GM 时钟服务器同步,从而能够在 NW-TT 和 DS-TT 之间进行准确的时间分发,以启用 TC 模式 [20]。在测试床中,MS 和 SL 使用单播用户数据报协议(UDP)通过 IPv4 通信 PTP 数据包,并采用 E2E 时延测量机制。PTP 传输速率配置为每秒 1 个数据包。
PPS、10 MHz、UDP、IPv4、E2E、PTP 传输速率等数字和缩写均保留。术语“oscillator disciplining”译为“振荡器驯服”是时间同步领域可接受译法,也可人工考虑译为“振荡器校准/约束”。未发现数字或逻辑问题。
End Devices and Testbed Connections. Two Ubuntu 22.04 LTS servers operate as packet generator with packETH tool and sink, respectively. All components in the testbed are interconnected using 1 Gbps optical fiber links, except for the connections between the NW-TT - gNB, and DS-TT - UEs, which use 1 Gbps RJ-45 Ethernet cables.
端设备与测试床连接。两台 Ubuntu 22.04 LTS 服务器分别作为使用 packETH 工具的数据包生成器和接收端运行。测试床中的所有组件均使用 1 Gbps 光纤链路互连,但 NW-TT - gNB 以及 DS-TT - UE 之间的连接除外,这些连接使用 1 Gbps RJ-45 以太网电缆。
packETH、Ubuntu 22.04 LTS、1 Gbps、RJ-45 均准确保留。原文“packet generator with packETH tool and sink”译为“数据包生成器和接收端”符合网络实验语境。未发现明显问题。
Network Traffic. At the 5G core network, two distinct Data Network Names (DNNs) are configured to create separate network slices for industrial traffic management. One carries both PTP and DC flows, while the other handles BE flow, enabling differentiated routing and resource allocation. The 5G network employs IP transport because the considered UE operates without Ethernet-based sessions. To support Layer 2 industrial automation traffic over IP, a Virtual Extensible LAN (VxLAN) -based tunneling mechanism is implemented [ 9 ], with two VxLANs configured accordingly: one transporting DC and PTP flows, and the other BE flow. Packets are tagged with PCP values reflecting the relative priority among the flows: PCP 3 for packets of the PTP flow, PCP 2 for DC flow packets, and PCP 0 for BE flow packets. Additionally, within the 5G network, 5QI values are assigned per flow’s packets, with 80 for PTP and DC traffic, and 9 for BE traffic.
网络流量。在 5G 核心网处,配置了两个不同的数据网络名称(DNN),以便为工业流量管理创建分离的网络切片。一个承载 PTP 和 DC 流,另一个处理 BE 流,从而实现差异化路由和资源分配。5G 网络采用 IP 传输,因为所考虑的 UE 在没有基于以太网的会话的情况下运行。为支持 IP 之上的二层工业自动化流量,实现了一种基于虚拟可扩展局域网(VxLAN)的隧道机制 [9],并相应配置了两个 VxLAN:一个传输 DC 和 PTP 流,另一个传输 BE 流。数据包被标记为反映各流之间相对优先级的 PCP 值:PTP 流的数据包使用 PCP 3,DC 流数据包使用 PCP 2,BE 流数据包使用 PCP 0。此外,在 5G 网络内部,按各流的数据包分配 5QI 值,其中 PTP 和 DC 流量为 80,BE 流量为 9。
DNN、PTP、DC、BE、IP、Layer 2、VxLAN、PCP、5QI 均保留。两个 DNN、两个 VxLAN、PCP 3/2/0、5QI 80/9 数字准确。原文“per flow’s packets”语法略别扭,译为“按各流的数据包分配”符合含义。未发现明显问题。
We evaluate the packet transmission delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} for the DC flow across five experimental scenarios. Each scenario analyzes a specific TAS configuration parameter to evaluate its effect on the TSN system’s ability to tolerate 5G -induced delay.
我们在五个实验场景中评估 DC 流的数据包传输时延 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。每个场景分析一个特定的 TAS 配置参数,以评估其对 TSN 系统容忍 5G 所引入时延的能力的影响。
原文公式包含 LaTeX/glossaries 转换残留,已规范为 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。DC、TAS、TSN、5G 均保留;“five experimental scenarios”译为“五个实验场景”。由于公式原文存在抽取冗余但可辨识,未发现明显问题。
Experiment 1: Delay Analysis of 5G Network. We analyze the effect of varying the traffic generation rate R DC gen R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}} on the delay and jitter of the 5G network to determine D ^ DC, p emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}} and, with it, the uncertainty interval t DC uni t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}. For that, we sweep R DC gen R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}} in 300 kbps increments from 350 kbps to 1.55 Mbps. For each R DC gen R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}, the transmission window W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is calculated based on the lower bound defined in Eq. (9), ensuring compliance with the WR-Z16’s buffer size limitation. This results in transmission windows at MS ranging from 10.5 μ \mu s to 46.5 μ \mu s. TAS is enabled at the MS, while at SL the output queue gate remains open 100% of the time. This is done this way to estimate the ZWSL empirical delay, d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. The network cycle is fixed at T MS nc = 30 T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}=30 ms.
实验 1:5G 网络的时延分析。我们分析改变流量生成速率 \(R_{\mathrm{DC}}^{\mathrm{gen}}\) 对 5G 网络时延和抖动的影响,以确定 \(\hat{D}_{\mathrm{DC},p}^{\mathrm{emp}}\),并由此确定不确定性区间 \(t_{\mathrm{DC}}^{\mathrm{uni}}\)。为此,我们以 300 kbps 为增量,将 \(R_{\mathrm{DC}}^{\mathrm{gen}}\) 从 350 kbps 扫描到 1.55 Mbps。对于每个 \(R_{\mathrm{DC}}^{\mathrm{gen}}\),传输窗口 \(W_{\mathrm{MS},\mathrm{DC}}\) 根据式 (9) 中定义的下界计算,以确保符合 WR-Z16 的缓冲区大小限制。这使得 MS 处的传输窗口范围从 10.5 \(\mu s\) 到 46.5 \(\mu s\)。TAS 在 MS 处启用,而在 SL 处,输出队列门始终保持 100% 开启。这样做是为了估计 ZWSL 经验时延 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)。网络周期固定为 \(T_{\mathrm{MS}}^{\mathrm{nc}}=30\) ms。
公式符号 \(R_{\mathrm{DC}}^{\mathrm{gen}}\)、\(\hat{D}_{\mathrm{DC},p}^{\mathrm{emp}}\)、\(t_{\mathrm{DC}}^{\mathrm{uni}}\)、\(W_{\mathrm{MS},\mathrm{DC}}\)、\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)、\(T_{\mathrm{MS}}^{\mathrm{nc}}\) 已从抽取残留规范化。数值 300 kbps、350 kbps、1.55 Mbps、10.5 \(\mu s\)、46.5 \(\mu s\)、100%、30 ms 准确。ZWSL 未展开,按原文保留。原文存在公式抽取噪声,状态建议人工复核公式排版。
Experiment 2: Delay Analysis based on Offset between transmission windows of MS and SL Switches. We analyze the effect on d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} of different temporal shifts between network cycles at MS and SL. TAS is similarly configured at both switches, with fixed transmission window W i, DC = 46.5 μ W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=46.5~\mu s and network cycle T i nc = 30 T_{i}^{\text{nc}}=30 ms, ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. We sweep offset δ DC = { 5, 10, 15, 20, 25, 30 } \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=\{5,10,15,20,25,30\} ms.
实验 2:基于 MS 和 SL 交换机传输窗口之间偏移的时延分析。我们分析 MS 和 SL 处网络周期之间不同时间偏移对 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 的影响。TAS 在两台交换机上以类似方式配置,其中传输窗口固定为 \(W_{i,\mathrm{DC}}=46.5~\mu s\),网络周期固定为 \(T_i^{\mathrm{nc}}=30\) ms,\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。我们扫描偏移 \(\delta_{\mathrm{DC}}=\{5,10,15,20,25,30\}\) ms。
公式 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)、\(W_{i,\mathrm{DC}}\)、\(T_i^{\mathrm{nc}}\)、\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)、\(\delta_{\mathrm{DC}}\) 已规范化。数值 46.5 \(\mu s\)、30 ms、集合 \{5,10,15,20,25,30\} ms 准确。原文标题中 “Offset between transmission windows” 与正文“network cycles”存在轻微表述差异,译文分别保留。未发现明显问题。
Experiment 3: Delay Analysis Based on Network Cycle. We study the influence of the network cycle on d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} with a constant δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} to analyze the scenarios described in Section IV-E. The network cycle is varied in the range of T i nc = { 6, 8, 10, 12.5, 15, 17.5, 20, 22.5 } T_{i}^{\text{nc}}=\{6,8,10,12.5,15,17.5,20,22.5\} ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. Transmission windows are set to W i, DC = { 9, 12, 15, 18, 22.5, 25.5, 30, 33 } W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~=~\{9,12,15,18,22.5,25.5,30,33\} μ \mu s, ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, respectively, to keep the injected data rate into the 5G - TSN network constant at 1.55 Mbps.
实验 3:基于网络周期的时延分析。我们在恒定 \(\delta_{\mathrm{DC}}\) 下研究网络周期对 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 的影响,以分析第 IV-E 节中描述的场景。网络周期在 \(T_i^{\mathrm{nc}}=\{6,8,10,12.5,15,17.5,20,22.5\}\) ms 的范围内变化,\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。传输窗口分别设置为 \(W_{i,\mathrm{DC}}=\{9,12,15,18,22.5,25.5,30,33\}\) \(\mu s\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\),以将注入到 5G-TSN 网络中的数据速率保持恒定为 1.55 Mbps。
公式和集合已规范化;网络周期集合与传输窗口集合一一对应,“respectively”译为“分别”。数值 6、8、10、12.5、15、17.5、20、22.5 ms,以及 9、12、15、18、22.5、25.5、30、33 \(\mu s\),1.55 Mbps 均准确。未发现明显问题。
Experiment 4: Delay Analysis considering Multiple Traffic flows with Same-Priority. We evaluate the packet transmission delay when multiple distinct flows share the same priority output queue. Firstly, TAS is enabled exclusively at the MS, while at the SL, the output queue gate remains open 100% of the time, as in Experiment 1 to obtain d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. The network cycle is fixed at T i nc = 30 ms T_{i}^{\text{nc}}=30~\text{ms} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and, to accommodate all the flows, transmission windows are set to W MS, DC = { 0.25, 0.5, 0.75, 1, 1.25, 1.5, 1.75 } W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=\{0.25,0.5,0.75,1,1.25,1.5,1.75\} ms, forwarding from 1 to 7 aggregated DC flows at source each and analyzing the delay distribution for one of them. Then, we also configure TAS at SL so that W MS, DC = W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} to characterize d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. The offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is constant according to previous experiments.
实验 4:考虑多个相同优先级流量流的时延分析。我们在多个不同流共享同一优先级输出队列时评估数据包传输时延。首先,TAS 仅在 MS 处启用,而在 SL 处,输出队列门始终保持 100% 开启,与实验 1 相同,以获得 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)。网络周期固定为 \(T_i^{\mathrm{nc}}=30~\mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。并且,为容纳所有流,传输窗口设置为 \(W_{\mathrm{MS},\mathrm{DC}}=\{0.25,0.5,0.75,1,1.25,1.5,1.75\}\) ms,在源端分别转发 1 到 7 个聚合 DC 流,并分析其中一个流的时延分布。随后,我们还在 SL 处配置 TAS,使得 \(W_{\mathrm{MS},\mathrm{DC}}=W_{\mathrm{SL},\mathrm{DC}}\),以表征 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。偏移 \(\delta_{\mathrm{DC}}\) 根据先前实验保持恒定。
公式 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)、\(T_i^{\mathrm{nc}}\)、\(W_{\mathrm{MS},\mathrm{DC}}\)、\(W_{\mathrm{SL},\mathrm{DC}}\)、\(d_{\mathrm{DC}}^{\mathrm{emp}}\)、\(\delta_{\mathrm{DC}}\) 已规范化。数值 100%、30 ms、窗口集合 0.25 到 1.75 ms、1 到 7 个聚合 DC 流均准确。原文“forwarding from 1 to 7 aggregated DC flows at source each”语法略不顺,译为“在源端分别转发 1 到 7 个聚合 DC 流”需结合表格或实验设置人工确认。
Experiment 5: Delay Analysis Based on BE Traffic Load. We sweep the BE packet generation rates R BE gen = R_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}^{\text{gen}}= {600, 650, 700, 750, 800, 850, 900, 950, 980} Mbps to analyze how the BE load affects the DC traffic d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} distribution. The network cycle is fixed to T i nc = 30 ms T_{i}^{\text{nc}}=30~\text{ms} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and the transmission window is set only at MS, with W MS, DC = W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 46.5 μ \mu s.
实验 5:基于 BE 流量负载的时延分析。我们扫描 BE 分组生成速率 \(R_{\text{BE}}^{\text{gen}}=\{600,650,700,750,800,850,900,950,980\}\) Mbps,以分析 BE 负载如何影响 DC 流量的 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 分布。网络周期固定为 \(T_i^{\text{nc}}=30~\text{ms}\),对所有 \(i\in\mathcal{I}^{\text{TSN}}\) 均如此;传输窗口仅设置在 MS 处,且 \(W_{\text{MS},\text{DC}}=46.5~\mu s\)。
术语 BE、DC、MS、TSN 保留为缩写;速率集合、30 ms、46.5 μs、\(\forall i\in\mathcal{I}^{\text{TSN}}\) 已保留。输入中公式含 LaTeX/glossaries 残留,已按可读公式整理,含义无明显风险。
Note the T i nc T_{i}^{\text{nc}} values, unlike the Cyclic-Synchronous applications in [ 5 ], have been adapted to the capabilities of our 5G - TSN experimental setup and, with it, the flow constraints to potentially avoid ICI at first and thus allow observable delay variation across experiments. The purpose of this work is not to replicate an exact industrial configuration but to analyze the interaction between 5G delay and jitter and TAS under a synchronized 5G - TSN network.
需要注意的是,与文献 [5] 中的 Cyclic-Synchronous 应用不同,\(T_i^{\text{nc}}\) 的取值已经根据我们的 5G-TSN 实验装置能力进行了调整,并且随之也调整了流约束,以便最初尽可能避免 ICI,从而允许在各个实验之间观察到时延变化。本文工作的目的并不是复现某一种精确的工业配置,而是在同步的 5G-TSN 网络下,分析 5G 时延和抖动与 TAS 之间的相互作用。
Cyclic-Synchronous、ICI、TAS 保留;“potentially avoid ICI at first” 译为“最初尽可能避免 ICI”,存在上下文依赖但逻辑一致。未发现明显问题。
Additionally, each run of the experiments has been executed for 33 minutes, discarding the samples captured during the first 3 minutes to ensure stable synchronization between TSN devices after clock locking. This time interval allows us to capture an average of 340,000 valid samples for a single DC flow.
此外,每次实验运行均执行 33 分钟,并丢弃前 3 分钟期间捕获的样本,以确保时钟锁定之后 TSN 设备之间实现稳定同步。该时间间隔使我们能够针对单个 DC 流平均捕获 340,000 个有效样本。
33 分钟、前 3 分钟、340,000 个样本均已保留;“after clock locking” 译为“时钟锁定之后”,术语无明显风险。未发现明显问题。
In our experiments, the following configurations have been applied to the testbed.
在我们的实验中,以下配置已应用于测试平台。
“testbed” 译为“测试平台”,符合实验系统语境。未发现明显问题。
Traffic Generation and Configuration. Focusing on each traffic flow type:
流量生成与配置。针对每一种流量流类型,重点如下:
“Traffic flow type” 译为“流量流类型”略显直译,但保留了类型划分含义。未发现明显问题。
• DC flow: In Experiments 1-3 and 5, we use a single instance of packETH to generate a DC flow with packet size fixed at L DC = 200 L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=200 Bytes. Despite T i nc T_{i}^{\text{nc}} being in the order of tens of milliseconds, DC packets are generated every 750 μ \mu s to prevent the queue at MS from emptying and therefore emulate a burst of packets within the same transmission window. Then, R DC gen ∝ W i, DC R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}\propto W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Our work focuses on TAS configurations so that DC flow has no particular application period, but is imposed by the opening of the queue at MS, thus T DC app = T i nc T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}=T_{i}^{\text{nc}}. In Experiment 4, we use multiple instances of packETH to generate multiple DC traffic flows, each with the same PCP value but different destination addresses for the disaggregation at SL to different output ports, measuring d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} for just the target DC flow. In this experiment, the packet size has been reduced to 100 Bytes and the generation rate of the target DC flow’s packets is lessened to one packet every 100 μ s 100~\mu s, while the background DC is set to packETH ’s maximum bitrate for interlacing. • BE flow: The packet size is fixed at L BE = 1500 L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}=1500 Bytes and generated at a constant rate of 30 Mbps for the Experiments 1-3. Experiment 4 has no BE traffic to avoid interference with DC traffic while Experiment 5 sweeps this rate from 600 Mbps to 980 Mbps.
• DC 流:在实验 1-3 和实验 5 中,我们使用单个 packETH 实例生成一个 DC 流,其分组大小固定为 \(L_{\text{DC}}=200\) Bytes。尽管 \(T_i^{\text{nc}}\) 处于几十毫秒量级,DC 分组仍每隔 \(750~\mu s\) 生成一次,以防止 MS 处的队列变空,并因此模拟同一传输窗口内的一组突发分组。于是,\(R_{\text{DC}}^{\text{gen}}\propto W_{i,\text{DC}}\)。我们的工作聚焦于 TAS 配置,因此 DC 流没有特定的应用周期,而是由 MS 处队列的开启来施加约束,因此 \(T_{\text{DC}}^{\text{app}}=T_i^{\text{nc}}\)。在实验 4 中,我们使用多个 packETH 实例生成多个 DC 流量流,每个流具有相同的 PCP 值,但具有不同的目的地址,以便在 SL 处将其解聚合到不同输出端口;其中仅测量目标 DC 流的 \(d_{\text{DC}}^{\text{emp}}\)。在该实验中,分组大小已减小到 100 Bytes,目标 DC 流分组的生成速率降低为每 \(100~\mu s\) 一个分组,而背景 DC 被设置为 packETH 的最大比特率以进行交织。• BE 流:分组大小固定为 \(L_{\text{BE}}=1500\) Bytes,并在实验 1-3 中以恒定的 30 Mbps 速率生成。实验 4 没有 BE 流量,以避免干扰 DC 流量;而实验 5 将该速率从 600 Mbps 扫描到 980 Mbps。
本段输入同时包含 DC flow 与 BE flow 两个项目,且后续 P087、P088 又分别重复出现,疑似 PDF/抽取导致的列表重复;但按要求未合并、未省略。所有数字、单位、公式、packETH、PCP、MS、SL 均已保留。由于存在段落抽取重复和列表边界异常,需人工复核。
DC flow: In Experiments 1-3 and 5, we use a single instance of packETH to generate a DC flow with packet size fixed at L DC = 200 L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=200 Bytes. Despite T i nc T_{i}^{\text{nc}} being in the order of tens of milliseconds, DC packets are generated every 750 μ \mu s to prevent the queue at MS from emptying and therefore emulate a burst of packets within the same transmission window. Then, R DC gen ∝ W i, DC R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}\propto W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Our work focuses on TAS configurations so that DC flow has no particular application period, but is imposed by the opening of the queue at MS, thus T DC app = T i nc T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}=T_{i}^{\text{nc}}. In Experiment 4, we use multiple instances of packETH to generate multiple DC traffic flows, each with the same PCP value but different destination addresses for the disaggregation at SL to different output ports, measuring d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} for just the target DC flow. In this experiment, the packet size has been reduced to 100 Bytes and the generation rate of the target DC flow’s packets is lessened to one packet every 100 μ s 100~\mu s, while the background DC is set to packETH ’s maximum bitrate for interlacing.
DC 流:在实验 1-3 和实验 5 中,我们使用单个 packETH 实例生成一个 DC 流,其分组大小固定为 \(L_{\text{DC}}=200\) Bytes。尽管 \(T_i^{\text{nc}}\) 处于几十毫秒量级,DC 分组仍每隔 \(750~\mu s\) 生成一次,以防止 MS 处的队列变空,并因此模拟同一传输窗口内的一组突发分组。于是,\(R_{\text{DC}}^{\text{gen}}\propto W_{i,\text{DC}}\)。我们的工作聚焦于 TAS 配置,因此 DC 流没有特定的应用周期,而是由 MS 处队列的开启来施加约束,因此 \(T_{\text{DC}}^{\text{app}}=T_i^{\text{nc}}\)。在实验 4 中,我们使用多个 packETH 实例生成多个 DC 流量流,每个流具有相同的 PCP 值,但具有不同的目的地址,以便在 SL 处将其解聚合到不同输出端口;其中仅测量目标 DC 流的 \(d_{\text{DC}}^{\text{emp}}\)。在该实验中,分组大小已减小到 100 Bytes,目标 DC 流分组的生成速率降低为每 \(100~\mu s\) 一个分组,而背景 DC 被设置为 packETH 的最大比特率以进行交织。
本段与 P086 中 DC flow 部分重复,疑似输入抽取重复;但作为独立输入段落已完整翻译。100 Bytes、每 100 μs、750 μs、\(R_{\text{DC}}^{\text{gen}}\propto W_{i,\text{DC}}\)、\(T_{\text{DC}}^{\text{app}}=T_i^{\text{nc}}\) 均已保留。由于存在重复抽取风险,需人工复核。
BE flow: The packet size is fixed at L BE = 1500 L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}=1500 Bytes and generated at a constant rate of 30 Mbps for the Experiments 1-3. Experiment 4 has no BE traffic to avoid interference with DC traffic while Experiment 5 sweeps this rate from 600 Mbps to 980 Mbps.
BE 流:分组大小固定为 \(L_{\text{BE}}=1500\) Bytes,并在实验 1-3 中以恒定的 30 Mbps 速率生成。实验 4 没有 BE 流量,以避免干扰 DC 流量;而实验 5 将该速率从 600 Mbps 扫描到 980 Mbps。
本段与 P086 中 BE flow 部分重复,疑似输入抽取重复;30 Mbps、600 Mbps 至 980 Mbps、1500 Bytes 均已保留。由于存在重复抽取风险,需人工复核。
TAS scheduling. We consider a single transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} reserved for DC traffic. The transmission window W i, BE W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} for BE traffic is obtained by subtracting the DC transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, the fixed 6.26 μ \mu s guard band T GB T^{\text{GB}} that precedes it, and the 160 ns W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} reserved for a single PTP message, from the total network cycle duration, T i nc T_{i}^{\text{nc}}.
TAS 调度。我们考虑为 DC 流量保留单个传输窗口 \(W_{i,\text{DC}}\),对所有 \(i\in\mathcal{I}^{\text{TSN}}\) 均如此。用于 BE 流量的传输窗口 \(W_{i,\text{BE}}\) 通过从总网络周期时长 \(T_i^{\text{nc}}\) 中减去 DC 传输窗口 \(W_{i,\text{DC}}\)、位于其之前的固定 \(6.26~\mu s\) 保护带 \(T^{\text{GB}}\),以及为单个 PTP 消息保留的 \(160~ns\) 的 \(W_{i,\text{PTP}}\) 而得到。
公式关系按原句顺序保留;6.26 μs、160 ns、PTP、保护带、\(T^{\text{GB}}\) 均已保留。“precedes it” 明确译为“位于其之前”。未发现明显问题。
Delay Measurement. The empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} and the ZWSL empirical delay d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} are measured at the output ports of the TSN switches MS and SL, as shown in Fig. 5 (green dots). Packet transmission delay is measured using WR-Z16 timestamp probes placed at the output ports of the TSN switches MS and SL. These probes extract the sequence number, which is embedded in the first 4 Bytes of the UDP payload, and log the departure timestamp to CSV files. Per-packet latency is calculated by matching sequence numbers from both switches and computing the timestamp difference. The proposed configuration achieves negligible packet loss.
时延测量。经验时延 \(d_{\text{DC}}^{\text{emp}}\) 和 ZWSL 经验时延 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 在 TSN 交换机 MS 和 SL 的输出端口处进行测量,如图 5 所示(绿色点)。分组传输时延使用放置在 TSN 交换机 MS 和 SL 输出端口处的 WR-Z16 时间戳探针进行测量。这些探针提取嵌入在 UDP 载荷前 4 Bytes 中的序列号,并将离开时间戳记录到 CSV 文件中。逐分组时延通过匹配两个交换机处的序列号并计算时间戳差值来获得。所提出的配置实现了可忽略不计的分组丢失。
\(d_{\text{DC}}^{\text{emp}}\)、\(\widetilde{d}_{\text{DC}}^{\text{emp}}\)、ZWSL、WR-Z16、UDP、CSV、MS、SL 均已保留;“negligible packet loss” 译为“可忽略不计的分组丢失”。未发现明显问题。
Data Capture. All experiments were run for at least 30 minutes as described in Section V-B, generating a sufficient number of samples to ensure statistically valid results. All datasets and scripts are made publicly available to foster reproducibility 1 1 1 The repository is publicly accessible at this link..
数据采集。所有实验均按照第 V-B 节所述至少运行 30 分钟,从而生成足够数量的样本,以确保结果在统计上有效。所有数据集和脚本均已公开提供,以促进可复现性。注 1:该代码仓库可通过此链接公开访问。
“1 1 1 The repository...”疑似脚注抽取重复,已按脚注含义处理;30 分钟、Section V-B、datasets/scripts、reproducibility 均已保留。存在链接内容缺失。
A summary of these experiments and their configurations can be found in Table II.
这些实验及其配置的概要可见表 II。
表号 Table II 已保留;语义直接,未发现明显问题。
In this section, we analyze the results of the performed experiments according to the equipment and the scenarios raised within the previous Section V.
在本节中,我们根据前一节第 V 节中提出的设备和场景,对已执行实验的结果进行分析。
“previous Section V”译为“前一节第 V 节”;equipment 与 scenarios 均已保留。未发现明显问题。
Prior to TAS -based experiments, we conducted an empirical comparison of latency and jitter between a standalone TSN network and its integration with 5G for a windowed DC flow. The size of the DC flow packets is 200 Bytes, and the TAS configuration used in both scenarios is W MS, DC = 46.5 W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~=~46.5 μ \mu s and T MS nc = T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}= 30 ms. While for TSN we obtained that max { d ~ DC emp } = 40.53 \max\{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\}=~40.53 μ \mu s and t DC jit = 29.54 t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=~29.54 μ \mu s (p = p= 1), in the 5G - TSN setup both rose to max { d ~ DC emp } = 18.41 \max\{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\}=~18.41 ms and t DC jit = 10.5 t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=~10.5 ms (p = p= 0.999). These results corroborate the observation in Section IV-A and make the characterization of d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} a key input to the wireless-aware TAS scheduling.
在基于 TAS 的实验之前,我们针对一个开窗 DC 流,对独立 TSN 网络以及其与 5G 集成后的网络之间的时延和抖动进行了经验比较。DC 流分组大小为 200 Bytes,并且两个场景中使用的 TAS 配置为 \(W_{\mathrm{MS},\mathrm{DC}} = 46.5~\mu s\) 和 \(T_{\mathrm{MS}}^{\mathrm{nc}} = 30~ms\)。对于 TSN,我们得到 \(\max\{\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\}=40.53~\mu s\) 和 \(t_{\mathrm{DC}}^{\mathrm{jit}}=29.54~\mu s\)(\(p=1\));而在 5G-TSN 设置中,二者分别上升到 \(\max\{\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\}=18.41~ms\) 和 \(t_{\mathrm{DC}}^{\mathrm{jit}}=10.5~ms\)(\(p=0.999\))。这些结果印证了第 IV-A 节中的观察,并使得对 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 的表征成为无线感知 TAS 调度的关键输入。
数字与单位已保留:200 Bytes、46.5 μs、30 ms、40.53 μs、29.54 μs、18.41 ms、10.5 ms、p=1、p=0.999。原文在 TSN 处使用 \(\widetilde{d}_{DC}^{emp}\),末句使用 \(d_{DC}^{emp}\),已分别保留。公式抽取含有 LaTeX/glossary 噪声,已按可读公式整理。
The resulting CDFs of the ZWSL empirical delay distribution, F d ~ DC emp (⋅) F_{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}}(\cdot), for the different transmission window sizes W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} are presented in Fig. 6. The results show that increasing W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} causes a moderate rightward shift in the CDF, indicating higher d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. This is because a larger transmission window in the MS allows more packets to be injected into the 5G system during each network cycle. As more packets enter the 5G system, they accumulate in the buffer before transmission over the radio interface, leading to increased queuing delays and consequently higher d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}, as stated in Section IV-C.
对于不同传输窗口大小 \(W_{\mathrm{MS},\mathrm{DC}}\),ZWSL 经验时延分布 \(F_{\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}}(\cdot)\) 所得到的 CDF 如图 6 所示。结果表明,增大 \(W_{\mathrm{MS},\mathrm{DC}}\) 会使 CDF 发生适度右移,这表示 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 更高。这是因为 MS 中更大的传输窗口允许在每个网络周期内将更多分组注入 5G 系统。随着更多分组进入 5G 系统,它们在通过无线接口传输之前会在缓冲区中累积,导致排队时延增加,并因此导致更高的 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\),如第 IV-C 节所述。
ZWSL、CDF、\(W_{\mathrm{MS},\mathrm{DC}}\)、\(\widetilde{d}_{DC}^{emp}\)、Fig. 6、Section IV-C 均已保留。因果链“窗口增大-注入更多分组-缓冲累积-排队时延增加”完整。未发现明显问题。
For the evaluated transmission windows, the distributions of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} show average delays between 6.39 ms and 7.21 ms, with a maximum observed delay of max { t DC uni } = 18.41 \max\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}~=~18.41 ms. The 99.9th percentile is just below 15 ms, so we set the upper bound for the 5G delay contribution as D ^ DC, 0.999 emp = 15 ms \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}=~15~\text{ms}. The observed minimum delay is min { t DC uni } = 4.5 \min\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}=4.5 ms. With this, the necessary condition for deterministic transmission in Eq. (17) is satisfied: T MS nc − W MS, DC ≈ 30 T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}-W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\approx 30 ms > t DC jit = 10.5 >t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=10.5 ms. These results are aligned with the latency results in [ 11 ] and bounds are considered in subsequent experiments.
对于所评估的传输窗口,\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 的分布显示平均时延介于 6.39 ms 和 7.21 ms 之间,观测到的最大时延为 \(\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}=18.41~ms\)。第 99.9 百分位略低于 15 ms,因此我们将 5G 时延贡献的上界设置为 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}=15~ms\)。观测到的最小时延为 \(\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}=4.5~ms\)。据此,式(17)中确定性传输的必要条件得到满足:\(T_{\mathrm{MS}}^{\mathrm{nc}}-W_{\mathrm{MS},\mathrm{DC}}\approx 30~ms > t_{\mathrm{DC}}^{\mathrm{jit}}=10.5~ms\)。这些结果与文献 [11] 中的时延结果一致,并且这些边界会在后续实验中予以考虑。
数字 6.39 ms、7.21 ms、18.41 ms、99.9th、15 ms、4.5 ms、30 ms、10.5 ms、[11] 已保留。原文不等式抽取为“30 ms > t...=10.5 ms”,已修正为可读形式。存在原文写“maximum observed delay of \(\max\{t_{DC}^{uni}\}\)”而非 \(\max\{\widetilde{d}\}\),已保留该符号。
Despite these results, it is important to note that the obtained 99.9th percentile of the delay, D ^ DC, 0.999 emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}, is not universal, as it depends on multiple factors such as the 5G configuration, the Signal-to-Interference-plus-Noise Ratio (SINR), the traffic load, etc. It must be estimated for any particular scenario and conditions where the 5G system is deployed. For example, the influence of the load is studied in the Experiments 4, 5.
尽管有这些结果,但需要注意的是,所获得的时延第 99.9 百分位 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\) 并不是通用值,因为它取决于多个因素,例如 5G 配置、信干噪比(Signal-to-Interference-plus-Noise Ratio, SINR)、业务负载等。对于部署 5G 系统的任何特定场景和条件,都必须对其进行估计。例如,负载的影响在实验 4 和实验 5 中进行了研究。
\(\hat{D}_{DC,0.999}^{emp}\)、99.9 百分位、5G configuration、SINR、traffic load、Experiments 4, 5 均已保留。未发现明显问题。
Fig. 7 uses a grouped bar chart representation. Each evaluated scenario corresponds to a specific offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the plot represents the set of transmission windows in the SL switch as one or more bars, one per the n n -th transmission window used for transmitting an arbitrary packet in that scenario. The x-axis enumerates the evaluated scenarios, while the y-axis shows the minimum packet-transmission empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} conditioned on the packet being transmitted in the n n -th transmission window. Furthermore, each bar is labeled with the probability that this case occurs. Note that the sum of the probabilities of all bars within the same evaluated scenario equals one, since they collectively cover all possible transmission outcomes for a specific offset configuration.
图 7 使用分组柱状图表示。每个被评估场景对应于一个特定偏移 \(\delta_{\mathrm{DC}}\),该图将 SL 交换机中的传输窗口集合表示为一个或多个柱,每个柱对应于该场景中用于传输任意分组的第 \(n\) 个传输窗口。x 轴枚举被评估的场景,而 y 轴显示在分组由第 \(n\) 个传输窗口传输这一条件下的最小分组传输经验时延 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。此外,每个柱都标注了该情况发生的概率。注意,同一被评估场景内所有柱的概率之和等于 1,因为它们共同覆盖了某一特定偏移配置下所有可能的传输结果。
Fig. 7、grouped bar chart、\(\delta_{DC}\)、SL switch、第 \(n\) 个传输窗口、x/y 轴含义、概率和为 1 的逻辑均已保留。原文“one per the n n-th”有抽取重复,已译为“第 \(n\) 个”。未发现明显问题。
Assuming that the necessary condition for achieving a deterministic transmission in Eq. (17) is met, as seen in Experiment 1, the next fundamental constraint to be satisfied is the boundary conditions in Eq. (15) or, alternatively, in Eq. (16). With this, the configured offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be at least the 99th percentile of the ZWSL empirical delay distribution that defines the upper bound of the uncertainty interval, this is D ^ DC, 0.999 emp = max { t DC uni } \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}=\max\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}. For network cycle offset δ DC ′ = δ DC > D ^ DC, 0.999 emp \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}>\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} (i.e., greater than 15 ms), 100% of packets are transmitted within a single transmission window, as evidenced by a single bar per case. These realizations correspond to the Scenario 1 depicted in Fig. 4. This indicates d DC emp ∈ [ δ DC − W i, DC, δ DC + W i, DC ] d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\in[\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}] ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} since δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} exceeds D ^ DC, 0.999 emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} and thus δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is statistically greater than the maximum delay of the 5G network, satisfying Eq. (10). As W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is scaled accordingly (see Section V-C), d DC emp = δ DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Additionally, larger offsets δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} thus lead to higher latencies.
假设如实验 1 所示,式(17)中实现确定性传输所需的必要条件已经满足,则下一个必须满足的基本约束是式(15)中的边界条件,或者等价地,是式(16)中的边界条件。据此,所配置的偏移 \(\delta_{\mathrm{DC}}\) 必须至少等于 ZWSL 经验时延分布的第 99 百分位,该百分位定义了不确定性区间的上界,即 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}=\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\)。对于网络周期偏移 \(\delta_{\mathrm{DC}}'=\delta_{\mathrm{DC}}>\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\)(即大于 15 ms),100% 的分组都在单个传输窗口内传输,这一点由每种情况下只有一个柱得到证明。这些实现对应于图 4 中描绘的场景 1。这表示 \(d_{\mathrm{DC}}^{\mathrm{emp}}\in[\delta_{\mathrm{DC}}-W_{i,\mathrm{DC}},\ \delta_{\mathrm{DC}}+W_{i,\mathrm{DC}}]\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\),因为 \(\delta_{\mathrm{DC}}\) 超过 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\),因而 \(\delta_{\mathrm{DC}}\) 在统计意义上大于 5G 网络的最大时延,从而满足式(10)。由于 \(W_{i,\mathrm{DC}}\) 会相应缩放(见第 V-C 节),因此 \(d_{\mathrm{DC}}^{\mathrm{emp}}=\delta_{\mathrm{DC}}\)。此外,更大的偏移 \(\delta_{\mathrm{DC}}\) 因而会导致更高的时延。
公式与引用 Eq. (17)、Eq. (15)、Eq. (16)、Eq. (10)、Experiment 1、Fig. 4、Scenario 1、Section V-C 均已保留。风险:原文写“99th percentile”但符号为 \(0.999\),与前文 99.9 百分位不一致,可能是原文笔误或抽取问题;已按文字译为“第 99 百分位”并保留 \(0.999\) 符号。另有 \(\hat{D}_{DC,0.999}^{emp}=\max\{t_{DC}^{uni}\}\) 与前文“第 99.9 百分位略低于 15 ms、最大值 18.41 ms”存在潜在逻辑冲突,需核对论文图表上下文。
When δ DC ′ = δ DC ≤ D ^ DC, 0.999 emp \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} (i.e., equal or lower than 15 ms) not all packets arrive in time to be scheduled within the transmission window in the same network cycle at SL and must therefore be deferred to the corresponding transmission window of the next network cycle. These realizations correspond to the Scenario 3 depicted in Fig. 4. The main consequence is that packets transmitted in the second transmission window incur an additional delay approximately equal to T i nc T_{i}^{\text{nc}}. As a result, the empirical delay distribution becomes bimodal, meaning that a subset of packets are transmitted with a delay shifted by T i nc T_{i}^{\text{nc}}, i.e., d DC emp ∈ [ δ DC + T i nc − W i, DC, δ DC + T i nc + W i, DC ] d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\in[\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}].
当 \(\delta_{\mathrm{DC}}'=\delta_{\mathrm{DC}}\leq\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\)(即等于或低于 15 ms)时,并非所有分组都能及时到达并在 SL 的同一网络周期内被调度到传输窗口中,因此它们必须被推迟到下一网络周期中相应的传输窗口。这些实现对应于图 4 中描绘的场景 3。主要后果是,在第二个传输窗口中传输的分组会产生一个约等于 \(T_i^{\mathrm{nc}}\) 的附加时延。因此,经验时延分布变为双峰分布,这意味着一部分分组以偏移了 \(T_i^{\mathrm{nc}}\) 的时延进行传输,即 \(d_{\mathrm{DC}}^{\mathrm{emp}}\in[\delta_{\mathrm{DC}}+T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}},\delta_{\mathrm{DC}}+T_i^{\mathrm{nc}}+W_{i,\mathrm{DC}}]\)。
\(\delta'_{DC}=\delta_{DC}\leq\hat{D}_{DC,0.999}^{emp}\)、15 ms、SL、下一网络周期、Scenario 3、Fig. 4、\(T_i^{nc}\)、双峰分布、区间公式均已保留。未发现明显问题。
The setting of the 99.9th percentile offset obtained from Experiment 1, i.e., δ DC ′ = δ DC = D ^ DC, 0.999 emp = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~=~{\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp }}}= 15 ms, is not enough to transmit all packets within the same transmission window due to the ICI effect, increasing then the probability of being transmitted in a second network cycle.
实验 1 得到的第 99.9 百分位偏移量设置,即 \(\delta'_{\mathrm{DC}}=\delta_{\mathrm{DC}}=\hat{D}^{\mathrm{emp}}_{\mathrm{DC},0.999}=15\ \mathrm{ms}\),由于 ICI 效应,并不足以在同一个传输窗口内传输所有数据包,因而会增加数据包在第二个网络周期中被传输的概率。
术语 ICI 保留;\(\delta'_{\mathrm{DC}}\)、\(\delta_{\mathrm{DC}}\)、\(\hat{D}^{\mathrm{emp}}_{\mathrm{DC},0.999}\) 与 15 ms 已保留;“second network cycle”译为“第二个网络周期”符合上下文。未发现明显问题。
In conclusion, the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be elected so that ICI effect does not occur and, at the same time, it is not excessively large to increase latencies, i.e., δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 20 ms. However, as stated in Section IV-D, this higher offset will unevitably increase the latency in exchange of guaranteeing the deterministic transmissions.
总之,必须选择偏移量 \(\delta_{\mathrm{DC}}\),使得 ICI 效应不会发生,同时它又不能过大以免增加时延,即 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)。然而,如第 IV-D 节所述,这一更高的偏移量将不可避免地以保证确定性传输为代价而增加时延。
原文 “in exchange of guaranteeing” 语义为“以保证确定性传输为交换/代价”,已保留因果与权衡关系;“unevitably” 应为 “inevitably” 的拼写错误,按语义译为“不可避免地”。未发现明显问题。
Fig. 8 uses the same grouped bar chart representation introduced in the previous experiment. Each evaluated scenario corresponds to a specific combination of the network cycle T i nc T_{i}^{\text{nc}} and the transmission window size W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. The represented realizations correspond to the Scenarios 2-4, illustrated in Fig. 4, where δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms according to previous Experiment 2. Some present severe ICI as packets are transmitted from SL across multiple transmission windows. As the network cycle T i nc T_{i}^{\text{nc}} decreases, the percentage of packets transmitted in the target transmission window also decreases. Consequently, the number of transmission windows where packets of the same burst can be transmitted increases. For clarity, some evaluated network cycles (i.e., T i nc ≥ 20 T_{i}^{\text{nc}}\geq 20 ms, Scenario 1 in Fig. 4) are not depicted in the Fig. 8 due to 100% of generated packets being transmitted within a single transmission window, i.e., with no ICI, as seen in Experiment 2.
图 8 使用了前一个实验中引入的相同分组柱状图表示方式。每个被评估的场景对应于网络周期 \(T_i^{\mathrm{nc}}\) 与传输窗口大小 \(W_{i,\mathrm{DC}}\) 的一个特定组合。所表示的实现对应于图 4 所示的场景 2-4,其中根据前述实验 2,\(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)。其中一些实现呈现出严重的 ICI,因为数据包从 SL 跨多个传输窗口被传输。随着网络周期 \(T_i^{\mathrm{nc}}\) 减小,在目标传输窗口中传输的数据包百分比也会降低。因此,同一突发中数据包可能被传输的传输窗口数量会增加。为清晰起见,某些被评估的网络周期,即 \(T_i^{\mathrm{nc}}\geq 20\ \mathrm{ms}\)、图 4 中的场景 1,未在图 8 中绘出,因为如实验 2 所示,100% 生成的数据包都在单个传输窗口内传输,也就是没有 ICI。
图号、场景编号、\(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)、\(T_i^{\mathrm{nc}}\geq 20\ \mathrm{ms}\) 均已保留;“realizations”按实验结果实例译为“实现”,可能也可译为“实验实现/样本实现”,但不影响技术含义。未发现明显问题。
On the one hand, most of the cases where T i nc < δ DC T_{i}^{\text{nc}}~<~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and T i nc < max { t DC uni } T_{i}^{\text{nc}}<\max\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} may see their transmissions split between network cycles. This depends directly on δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, as described in Eq. (12), e.g., δ DC ′ = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}= {7.5, 5} ms for T i nc = { 12.5, 15 } T_{i}^{\text{nc}}=\{12.5,~15\} ms, respectively, where δ DC ′ > min { t DC uni } − W i, DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}~>~\min\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\}~-~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} (Scenario 3 in Fig. 4). Nevertheless, the compliance with Eq. (17) implies that a δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} correction may solve this ICI and move on to Scenario 1. For the cases where T i nc = T_{i}^{\text{nc}}= {6, 8, 10} ms, the condition of Eq. (17) is not met, i.e., T i nc − W i, DC < t DC jit = 10.5 T_{i}^{\text{nc}}~-~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~<~t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=10.5 ms. This means that ICI effect is unavoidable. Moreover, given that δ DC ′ = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}= {2, 4, 0} ms, i.e., δ DC ′ < min { t DC uni } − W i, DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}<\min\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, these realizations fall under the Scenario 4 in Fig. 4. It results that minimum latency is equal to δ DC ′ + T i nc \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}+T_{i}^{\text{nc}} as δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime} is not enough to accomplish the transmission of any packet within the initial transmission window.
一方面,在 \(T_i^{\mathrm{nc}}<\delta_{\mathrm{DC}}\) 且 \(T_i^{\mathrm{nc}}<\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的大多数情况下,其传输可能会被拆分到多个网络周期之间。这直接取决于 \(\delta'_{\mathrm{DC}}\),如式 (12) 所述;例如,对于 \(T_i^{\mathrm{nc}}=\{12.5,15\}\ \mathrm{ms}\),分别有 \(\delta'_{\mathrm{DC}}=\{7.5,5\}\ \mathrm{ms}\),其中 \(\delta'_{\mathrm{DC}}>\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}-W_{i,\mathrm{DC}}\)(图 4 中的场景 3)。尽管如此,满足式 (17) 意味着对 \(\delta'_{\mathrm{DC}}\) 的修正可以解决该 ICI,并转入场景 1。对于 \(T_i^{\mathrm{nc}}=\{6,8,10\}\ \mathrm{ms}\) 的情况,式 (17) 的条件不满足,即 \(T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}}<t_{\mathrm{DC}}^{\mathrm{jit}}=10.5\ \mathrm{ms}\)。这意味着 ICI 效应不可避免。此外,鉴于 \(\delta'_{\mathrm{DC}}=\{2,4,0\}\ \mathrm{ms}\),即 \(\delta'_{\mathrm{DC}}<\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}-W_{i,\mathrm{DC}}\),这些实现属于图 4 中的场景 4。由此得到,最小时延等于 \(\delta'_{\mathrm{DC}}+T_i^{\mathrm{nc}}\),因为 \(\delta'_{\mathrm{DC}}\) 不足以在初始传输窗口内完成任何数据包的传输。
保留了所有条件、集合值、式 (12)、式 (17)、场景 3/4 和 \(t_{\mathrm{DC}}^{\mathrm{jit}}=10.5\ \mathrm{ms}\);原文 “It results that” 译为“由此得到”;公式上下文较密集但未见残缺。未发现明显问题。
On the other hand, when T i nc < δ DC T_{i}^{\text{nc}}<\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and T i nc > max { t DC uni } T_{i}^{\text{nc}}>\max\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, e.g., T i nc = 17.5 T_{i}^{\text{nc}}=17.5 ms, an initial transmission window opens at δ DC ′ = 2.5 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=2.5 ms, which is earlier than the transmission window originally scheduled at δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms (Scenario 2 in Fig. 4). While these early transmission windows may theoretically lead to ICI if packets arrive prematurely, no such interference was observed. This is due to min { t DC uni } − W i, DC ≥ δ DC ′ \min\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\}~-~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\geq~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, preventing any packet from being transmitted from SL before its planned transmission window. As a result, 100% of the packets are transmitted at δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms, consistent with the target scheduling.
另一方面,当 \(T_i^{\mathrm{nc}}<\delta_{\mathrm{DC}}\) 且 \(T_i^{\mathrm{nc}}>\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 时,例如 \(T_i^{\mathrm{nc}}=17.5\ \mathrm{ms}\),一个初始传输窗口会在 \(\delta'_{\mathrm{DC}}=2.5\ \mathrm{ms}\) 处打开,这早于原本在 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\) 处调度的传输窗口(图 4 中的场景 2)。虽然如果数据包过早到达,这些提前的传输窗口在理论上可能导致 ICI,但并未观察到这种干扰。这是因为 \(\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}-W_{i,\mathrm{DC}}\geq\delta'_{\mathrm{DC}}\),从而防止任何数据包在其计划传输窗口之前从 SL 被传输。因此,100% 的数据包都在 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\) 处传输,与目标调度一致。
条件 \(T_i^{\mathrm{nc}}<\delta_{\mathrm{DC}}\)、\(T_i^{\mathrm{nc}}>\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\) 和数值 17.5、2.5、20 ms 均已保留;“from SL”按原文译为“从 SL 被传输”。未发现明显问题。
To conclude, shorter network cycles T i nc T_{i}^{\text{nc}} may lead to ICI when the Eq. (17) is not met. Furthermore, those packets queued at SL before δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} suffer an empirical delay so that d DC emp < δ DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}<\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and d DC emp > δ DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}>\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. This occurs when the network cycle offset δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is not enough, taking into account the d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} distribution, as stated in Section IV-D. In addition, this produces ICI to the packets scheduled in the preceding and succeeding network cycles, potentially preventing them from meeting their constraints. Then, T i nc ≥ 17.5 T_{i}^{\text{nc}}\geq 17.5 ms. Nevertheless, considering a unique DC flow type, T i nc = T DC app = 30 T_{i}^{\text{nc}}=T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}=30 ms is kept for the Experiments 4-5.
作为结论,当式 (17) 不满足时,较短的网络周期 \(T_i^{\mathrm{nc}}\) 可能导致 ICI。此外,那些在 \(\delta'_{\mathrm{DC}}\) 之前于 SL 排队的数据包会承受一个经验时延,使得 \(d_{\mathrm{DC}}^{\mathrm{emp}}<\delta_{\mathrm{DC}}\) 以及 \(d_{\mathrm{DC}}^{\mathrm{emp}}>\delta_{\mathrm{DC}}\)。如第 IV-D 节所述,当考虑 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 分布时,网络周期偏移 \(\delta'_{\mathrm{DC}}\) 不足,就会发生这种情况。另外,这会对调度在前一网络周期和后一网络周期中的数据包产生 ICI,可能阻止它们满足其约束。因此,\(T_i^{\mathrm{nc}}\geq 17.5\ \mathrm{ms}\)。尽管如此,考虑到唯一的 DC 流类型,实验 4-5 仍保持 \(T_i^{\mathrm{nc}}=T_{\mathrm{DC}}^{\mathrm{app}}=30\ \mathrm{ms}\)。
原文同时写出 \(d_{\mathrm{DC}}^{\mathrm{emp}}<\delta_{\mathrm{DC}}\) 和 \(d_{\mathrm{DC}}^{\mathrm{emp}}>\delta_{\mathrm{DC}}\),看似表达“可能低于或高于偏移量”,但逻辑上不能对同一数据包同时成立;已按原式保留。该处存在潜在表述歧义,建议人工核对上下文。
In this experiment, target and background DC flows share the same transmission window. Two scenarios are carried out: one corresponding to the results shown in Fig. 9(a), where TAS is disabled at the SL, measuring the 5G network delays for target DC traffic; while Fig. 9(b) illustrates the case where TAS is enabled at SL.
在本实验中,目标 DC 流和背景 DC 流共享同一个传输窗口。进行了两个场景:一个对应于图 9(a) 所示的结果,其中 SL 处禁用 TAS,用于测量目标 DC 流量的 5G 网络时延;而图 9(b) 展示了 SL 处启用 TAS 的情况。
保留 TAS、SL、DC 与图 9(a)/9(b);“target and background DC flows”译为“目标 DC 流和背景 DC 流”。未发现明显问题。
Similarly to the results presented in Experiment 1, Fig. 9(a) shows the CDFs of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} shift rightward as the duration of the transmission window W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} increases. However, W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is now significantly larger, reaching up to 1.75 ms, in contrast to the few tens of microseconds of Experiment 1. As a consequence, significantly higher values of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} are observed. Although the minimum delay remains approximately min { t DC uni } = 4.5 \min\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}=4.5 ms, the average delays range from 10.27 ms to 17.79 ms. Additionally, the maximum observed value of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} exceeds 23 ms, while the 99.9th percentile in the worst-case configuration is D ^ DC, 0.999 emp = 22 ms \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}=22~\text{ms}. Consequently, t DC jit = 17.5 t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}~=~17.5 ms, which satisfies Eq. (17). These results underline the increased 5G queuing delays and jitter induced by the presence of multiple concurrent DC flows with the same priority in 5G downlink communications.
与实验 1 中给出的结果类似,图 9(a) 显示,随着传输窗口 \(W_{\mathrm{MS},\mathrm{DC}}\) 的持续时间增加,\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 的 CDF 会向右移动。然而,\(W_{\mathrm{MS},\mathrm{DC}}\) 现在显著更大,最高达到 1.75 ms,而实验 1 中仅为几十微秒。因此,观察到显著更高的 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 值。尽管最小时延仍约为 \(\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}=4.5\ \mathrm{ms}\),但平均时延范围为 10.27 ms 到 17.79 ms。此外,观察到的 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 最大值超过 23 ms,而最坏情况配置中的第 99.9 百分位为 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}=22\ \mathrm{ms}\)。因此,\(t_{\mathrm{DC}}^{\mathrm{jit}}=17.5\ \mathrm{ms}\),满足式 (17)。这些结果突出了在 5G 下行通信中,存在多个具有相同优先级的并发 DC 流所引入的更高 5G 排队时延和抖动。
CDF、\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)、\(W_{\mathrm{MS},\mathrm{DC}}\)、99.9 百分位、22 ms、23 ms、17.5 ms 均已保留;“few tens of microseconds”译为“几十微秒”。未发现明显问题。
Fig. 9(b) shows the CCDF corresponding to the scenario where the TAS mechanism is enabled at the SL, where d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} is evaluated with δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms, resulting from Experiment 2. When W i, DC ∈ [ 0.25, 0.75 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\in~\left[0.25,0.75\right] ms ∀ i ∈ ℐ TSN \forall~i~\in~\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, the measured delays are concentrated within the interval [ δ DC − W i, DC, δ DC ] [\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}] ∀ i ∈ ℐ TSN \forall i\in~\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, for those packets that arrive in time to be scheduled within the transmission window in the same network cycle at the SL. These latency values below δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} happen when a packet at the MS is transmitted at any time within the transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and, due to packet disaggregation at the output ports in SL, target DC packets waiting in the queue are quickly transmitted after δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Although some measures in W i, DC ∈ [ 0.25, 0.75 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\in\left[0.25,0.75\right] ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} are above δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 20 ms, they cannot be attributed to any effect as they are within the amount allowed by the defined 99.9th percentile. Nevertheless, when W i, DC ∈ [ 1, 1.25 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\in\left[1,1.25\right] ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, the measured delays are concentrated within the interval [ δ DC − W i, DC, δ DC + W i, DC ] [\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}] ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. This occurs when the packets arrive later than those 20 ms but find their gate open during W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the probability of this effect increases as the W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} gets higher. This means that W SL, DC > N DC ⋅ d ε MS, NW-TT, DC tran W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL},\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}>N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\cdot d_{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{tran}} was necessary to guarantee the deterministic transmission of certain target DC packets in exchange of reducing the bandwidth, although some jitter within W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} spreads across subsequent TSN nodes. Furthermore, this effect is highlighted in the cases of larger window sizes W i, DC ∈ [ 1.5, 1.75 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\in\left[1.5,1.75\right] ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} —and then, greater aggregated traffic loads—, where packets start suffering greater latencies than δ DC + W i, DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and not all packets arrive in time to be transmitted within the same network cycle. Consequently, some packets must be transmitted within the transmission window of the following network cycle, incurring an additional delay of T i nc = 30 T_{i}^{\text{nc}}=30 ms, i.e., δ DC + T i nc = 50 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}}=50 ms. This behavior causes the ICI effect.
图 9(b) 显示了 SL 处启用 TAS 机制的场景所对应的 CCDF,其中使用实验 2 得到的 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\) 来评估 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。当 \(W_{i,\mathrm{DC}}\in[0.25,0.75]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 时,对于那些及时到达、能够在 SL 的同一网络周期内被调度进传输窗口的数据包,测得的时延集中在区间 \([\delta_{\mathrm{DC}}-W_{i,\mathrm{DC}},\delta_{\mathrm{DC}}]\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 内。这些低于 \(\delta_{\mathrm{DC}}\) 的时延值出现在以下情况下:MS 处的数据包在传输窗口 \(W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 内的任意时刻被传输,并且由于 SL 输出端口处的数据包解聚合,队列中等待的目标 DC 数据包会在 \(\delta_{\mathrm{DC}}\) 之后被快速传输。虽然在 \(W_{i,\mathrm{DC}}\in[0.25,0.75]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的某些测量值高于 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\),但它们不能归因于任何效应,因为它们处在定义的第 99.9 百分位所允许的范围内。尽管如此,当 \(W_{i,\mathrm{DC}}\in[1,1.25]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 时,测得的时延集中在区间 \([\delta_{\mathrm{DC}}-W_{i,\mathrm{DC}},\delta_{\mathrm{DC}}+W_{i,\mathrm{DC}}]\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 内。这发生在数据包晚于那 20 ms 到达、但在 \(W_{\mathrm{SL},\mathrm{DC}}\) 期间发现其门处于打开状态时,并且随着 \(W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 变大,该效应的概率也会增加。这意味着,为了保证某些目标 DC 数据包的确定性传输,必须满足 \(W_{\mathrm{SL},\mathrm{DC}}>N_{\mathrm{DC}}\cdot d_{\varepsilon_{\mathrm{MS},\mathrm{NW\text{-}TT}},\mathrm{DC}}^{\mathrm{tran}}\),其代价是降低带宽,尽管 \(W_{i,\mathrm{DC}}\) 内的一些抖动会扩散到后续 TSN 节点。此外,在更大窗口大小 \(W_{i,\mathrm{DC}}\in[1.5,1.75]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的情况下,也就是聚合流量负载更大的情况下,这一效应更加突出;此时数据包开始承受大于 \(\delta_{\mathrm{DC}}+W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的时延,并且并非所有数据包都能及时到达以便在同一网络周期内传输。因此,一些数据包必须在下一个网络周期的传输窗口内传输,产生额外的 \(T_i^{\mathrm{nc}}=30\ \mathrm{ms}\) 时延,即 \(\delta_{\mathrm{DC}}+T_i^{\mathrm{nc}}=50\ \mathrm{ms}\)。这种行为导致 ICI 效应。
段落很长,已保留 CCDF、TAS、SL、MS、NW-TT、所有窗口区间、\(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)、\(T_i^{\mathrm{nc}}=30\ \mathrm{ms}\)、50 ms 以及不等式 \(W_{\mathrm{SL},\mathrm{DC}}>N_{\mathrm{DC}}\cdot d_{\varepsilon_{\mathrm{MS},\mathrm{NW\text{-}TT}},\mathrm{DC}}^{\mathrm{tran}}\);“packet disaggregation”译为“数据包解聚合”,可能需结合论文术语确认;公式下标较复杂但未见输入残缺。未发现明显问题。
In summary, in scenarios where multiple flows share the same priority, the solution for transmitting the packets of the DC flows in a single transmission window is to increase W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} accordingly. However, this approach inevitably leads to increased jitter, which may become significant and impact the performance of the corresponding industrial application. Thus, in the SL, the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} should be set according to the new percentile D ^ DC, 0.999 emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} measured, as well as the transmission window W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} should be resized to optimize bandwidth at the same time jitter is reduced.
总之,在多个流共享相同优先级的场景中,要在单个传输窗口内传输 DC 流的数据包,解决方案是相应地增加 \(W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。然而,这种方法不可避免地会导致抖动增加,而该抖动可能变得显著,并影响相应工业应用的性能。因此,在 SL 中,应根据新测得的百分位 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\) 来设置偏移量 \(\delta_{\mathrm{DC}}\),同时也应重新调整传输窗口 \(W_{\mathrm{SL},\mathrm{DC}}\) 的大小,以便在降低抖动的同时优化带宽。
保留了 \(W_{i,\mathrm{DC}}\)、\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)、\(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\)、\(\delta_{\mathrm{DC}}\)、\(W_{\mathrm{SL},\mathrm{DC}}\);“at the same time jitter is reduced”译为“在降低抖动的同时”。未发现明显问题。
The resulting CCDF of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} is depicted in Fig. 10, where a clear trend towards higher latencies can be seen as BE load is increased. For the cases R BE gen ∈ [ 600, 650 ] R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}\in[600,650] Mbps, we obtain similar behavior of latencies as in the case of Experiment 1, i.e., D ^ DC, 0.999 emp ≤ \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}\leq 15 ms, so that we can also set δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 20 ms, replicating Scenario 1 in Fig. 4. However, despite using the same TAS configuration of Experiment 1 with fixed W MS, DC = W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 46.5 μ \mu s, higher BE loads such as R BE gen ∈ [ 700, 750 ] R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}\in[700,750] Mbps clearly triggers latencies slightly over δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} such that few packets could not be transmitted until the next network cycle. In those cases, the offset should be rescaled up to, for example, δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 25 ms. Similarly, R BE gen = R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}= 800 Mbps is enough for increasing latencies over 50 ms (Scenario 4 in Fig. 4). Additionally, latencies for R BE gen ∈ [ 850, 980 ] R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}\in[850,980] Mbps highly increase up to 800 ms, which is quite far from the industrial constraints. These results highlight the limited isolation between DC and BE traffic in the 5G system. Although T GB T^{\text{GB}} prevents collisions in the TAS domain (Section III-C), the 5G system only provides relative prioritization via the 5QI configuration. Consequently, resources are still shared, and under high BE load, DC packets may experience increased queuing delays due to buffer contention. Hence, the latency and jitter of the DC flow are substantially increased by the BE load, and the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be reviewed again.
所得到的 \( \widetilde{d}_{\text{DC}}^{\text{emp}} \) 的 CCDF 如图 10 所示,其中可以看到,随着 BE 负载增加,时延明显呈现向更高数值移动的趋势。对于 \(R^{\text{gen}}_{\text{BE}}\in[600,650]\) Mbps 的情况,我们得到的时延行为与实验 1 的情况类似,即 \(\hat{D}_{\text{DC},0.999}^{\text{emp}}\leq 15\) ms,因此我们也可以设置 \(\delta_{\text{DC}}=20\) ms,从而复现图 4 中的场景 1。然而,尽管使用了与实验 1 相同的 TAS 配置,并固定 \(W_{\text{MS},\text{DC}}=46.5\ \mu s\),更高的 BE 负载,例如 \(R^{\text{gen}}_{\text{BE}}\in[700,750]\) Mbps,明显会触发略高于 \(\delta_{\text{DC}}\) 的时延,使得少量数据包无法在下一个网络周期之前完成传输。在这些情况下,偏移量应当重新按比例增大,例如增大到 \(\delta_{\text{DC}}=25\) ms。类似地,\(R^{\text{gen}}_{\text{BE}}=800\) Mbps 已足以使时延增加到超过 50 ms(图 4 中的场景 4)。此外,对于 \(R^{\text{gen}}_{\text{BE}}\in[850,980]\) Mbps,时延大幅增加至 800 ms,这已经相当远离工业约束。这些结果突出表明,在 5G 系统中,DC 流量与 BE 流量之间的隔离能力有限。虽然 \(T^{\text{GB}}\) 可以防止 TAS 域中的冲突(第 III-C 节),但 5G 系统仅通过 5QI 配置提供相对优先级。因此,资源仍然是共享的,并且在高 BE 负载下,由于缓冲区竞争,DC 数据包可能经历增加的排队时延。因此,DC 流的时延和抖动会被 BE 负载显著增大,并且必须再次重新审查偏移量 \(\delta_{\text{DC}}\)。
术语 CCDF、BE、DC、TAS、5QI、\(T^{\text{GB}}\)、\(\delta_{\text{DC}}\)、\(W_{\text{MS},\text{DC}}\) 已保留;数值区间、单位 Mbps、ms、\(\mu s\) 均已保留。原文公式存在 LaTeX 提取噪声,已按可识别形式整理;“until the next network cycle”语义可能涉及“直到下一个网络周期才可传输/在下一个网络周期前未能传输”的边界解释,需结合图 4 和调度上下文确认。
This section reviews existing work on 5G - TSN integration, with a specific focus on TAS scheduling. In the literature, TSN has been explored both as a fronthaul/backhaul solution within a 5G network and in scenarios where the 5G network acts as a TSN bridge. Regarding the latter, we analyze works that address TAS -based integration through architectural frameworks, simulation-based evaluations, and experimental testbeds. Finally, we compare our contributions with respect to the other works in each topic.
本节回顾关于 5G-TSN 集成的已有工作,并特别关注 TAS 调度。在文献中,TSN 既被作为 5G 网络内部的前传/回传解决方案进行探索,也被用于 5G 网络充当 TSN 网桥的场景。关于后一类情况,我们分析了通过体系结构框架、基于仿真的评估以及实验测试床来处理基于 TAS 的集成的工作。最后,我们将我们的贡献与每个主题下的其他工作进行比较。
术语 5G-TSN、TAS、TSN、前传/回传、TSN 网桥、测试床已准确保留。逻辑层次为“综述范围、两类场景、聚焦后一类、贡献比较”,未发现明显问题。
Some research efforts concentrate on the 5G fronthaul segment, which involves Ethernet-based low-latency transport solutions. Hisano et al. [ 27 ] propose the gate-shrunk TAS, a dynamic variant of TAS that adjusts gate states via special control packets to enhance bandwidth efficiency without degrading delay for machine-to-machine communications. Nakayama et al. [ 28 ] develop an autonomous TAS scheduling algorithm formulated as a boolean satisfiability problem that uses an FPGA-based solver for fast computation and flexible reconfiguration of the GCL in response to changing traffic. Shibata et al. [ 29 ] propose autonomous TAS techniques, named iTAS and GS-TAS, and adaptive compression for mobile fronthaul to efficiently manage low-latency and bursty IoT traffic, achieving deterministic delay and supporting fronthaul and backhaul in 5G and IoT networks.
一些研究工作集中于 5G 前传段,该段涉及基于以太网的低时延传输解决方案。Hisano 等人 [27] 提出了 gate-shrunk TAS,这是一种 TAS 的动态变体,它通过特殊控制数据包调整门状态,以在不降低机器到机器通信时延性能的情况下提高带宽效率。Nakayama 等人 [28] 开发了一种自主 TAS 调度算法,该算法被表述为布尔可满足性问题,并使用基于 FPGA 的求解器进行快速计算,以及在流量变化时对 GCL 进行灵活重配置。Shibata 等人 [29] 提出了名为 iTAS 和 GS-TAS 的自主 TAS 技术,并提出了用于移动前传的自适应压缩,以高效管理低时延且突发性的 IoT 流量,实现确定性时延,并支持 5G 和 IoT 网络中的前传与回传。
gate-shrunk TAS、FPGA、GCL、iTAS、GS-TAS、IoT 等术语和模型名已保留;引用编号 [27]-[29] 未遗漏。句中“autonomous TAS scheduling algorithm”译为“自主 TAS 调度算法”,“boolean satisfiability problem”译为“布尔可满足性问题”,未发现明显问题。
Although these studies provide valuable TAS -based solutions for deterministic low-latency fronthaul transport, they are not sufficient to ensure E2E determinism in networks composed of both TSN nodes and 5G, joined as a TSN bridge.
尽管这些研究为确定性低时延前传传输提供了有价值的基于 TAS 的解决方案,但它们不足以确保由 TSN 节点和作为 TSN 网桥接入的 5G 共同组成的网络中的端到端确定性。
E2E 译为“端到端”;“joined as a TSN bridge”按上下文译为“作为 TSN 网桥接入”,可能也可理解为“以 TSN 网桥形式连接”,但不影响主要逻辑。未发现明显问题。
From an architectural perspective, it is well established that the 5G system behaves as a TSN logical switch, as discussed in [ 30 ] [ 31 ]. Several works address time synchronization [ 32 ] and 5G - TSN QoS mapping [ 33 ] as key functions for this logical switch model. Comprehensive surveys and architectural frameworks have laid the foundation for understanding the role of TAS in 5G - TSN networks. Satka et al. [ 34 ] provide an in-depth study that, while covering synchronization, delay, and security in 5G - TSN systems, identifies TAS as a critical yet underexplored component in achieving E2E determinism. Egger et al. [ 25 ] highlight the incompatibilities between TAS ’s deterministic assumptions and the stochastic nature of wireless 5G links, advocating for a new “wireless-aware TSN engineering” paradigm to adapt TAS mechanisms for future 5G and 6th Generation (6G) systems. Islam [ 35 ] applies graph neural networks combined with deep reinforcement learning for incremental joint TAS and radio resource scheduling, illustrating the benefits of AI-driven optimization in complex integrated networks. Nazari et al. [ 36 ] develop the incremental joint scheduling and routing algorithm, emphasizing precise TAS gate control and routing within centralized TSN network configuration to minimize delay and packet delay variation.
从体系结构角度看,正如 [30] [31] 所讨论的,5G 系统作为 TSN 逻辑交换机运行这一点已经得到充分确认。若干工作将时间同步 [32] 和 5G-TSN QoS 映射 [33] 作为该逻辑交换机模型的关键功能来处理。全面的综述和体系结构框架已经为理解 TAS 在 5G-TSN 网络中的作用奠定了基础。Satka 等人 [34] 提供了一项深入研究,该研究虽然覆盖了 5G-TSN 系统中的同步、时延和安全,但也将 TAS 识别为实现端到端确定性时一个关键但尚未得到充分探索的组成部分。Egger 等人 [25] 强调了 TAS 的确定性假设与无线 5G 链路随机性之间的不兼容性,并主张采用一种新的“无线感知 TSN 工程”范式,以便为未来的 5G 和第六代(6G)系统适配 TAS 机制。Islam [35] 将图神经网络与深度强化学习结合起来,用于增量式联合 TAS 和无线资源调度,说明了 AI 驱动优化在复杂集成网络中的收益。Nazari 等人 [36] 开发了增量式联合调度与路由算法,强调在集中式 TSN 网络配置中进行精确的 TAS 门控控制和路由,以最小化时延和数据包时延变化。
术语 TSN logical switch、QoS mapping、E2E determinism、wireless-aware TSN engineering、6G、graph neural networks、deep reinforcement learning、packet delay variation 已准确处理;引用编号完整。最后一句涉及“centralized TSN network configuration”,译为“集中式 TSN 网络配置”,未发现明显问题。
While these contributions offer valuable architectural and conceptual perspectives on TAS integration in 5G - TSN networks, they lack empirical validation and do not specifically examine the impact of jitter on network performance.
虽然这些贡献为 5G-TSN 网络中的 TAS 集成提供了有价值的体系结构视角和概念性视角,但它们缺乏经验验证,并且没有专门考察抖动对网络性能的影响。
“empirical validation”译为“经验验证”,也可译为“实证验证”;“jitter”译为“抖动”。逻辑清晰,未发现明显问题。
Several studies have relied on simulation to evaluate and improve TAS scheduling, routing, and performance in 5G - TSN integrated networks. Li et al. [ 37 ] propose a fault-tolerant TAS scheduling algorithm based on redundant scheduling and priority adjustment to reduce complexity and improve robustness against timing faults, offering a scalable baseline for 5G - TSN integration. Wang et al. [ 38 ] propose the Balanced and Urgency First Scheduling (B-UFS) heuristic algorithm to ensure deterministic E2E delay for periodic time-critical flows. It introduces a pseudo-cyclic queuing and forwarding model for uncertain arrivals, a uniform resource metric, and a scheduling strategy that balances urgency and load across time and space to efficiently manage resources across the network. Debnath et al. [ 33 ] present 5G TQ, an open-source framework that enables 5G - TSN integration through a TSN -to- 5G QoS mapping algorithm. It implements a QoS -aware priority scheduler within the 5G MAC layer and evaluates Radio Access Network (RAN) -level scheduling strategies using ns-3, demonstrating improvements in delay and reliability for industrial traffic. Ginthör et al. [ 39 ] propose a constraint programming–based framework for optimizing E2E flow scheduling in 5G - TSN networks by modeling domain-specific constraints and a unified performance objective. Simulations on industrial topologies demonstrate improved schedulability and reduced delay compared to separate 5G and TSN scheduling approaches. Chen et al. [ 40 ] explore the use of 5G as a TSN bridge, integrating TAS to support time-triggered flows across TSN and 5G domains. It proposes a dynamic scheduling mechanism that allocates time slices to critical services, ensuring deterministic delay and jitter. However, the study abstracts away the wireless characteristics of 5G, focusing solely on its role as a deterministic forwarding bridge rather than analyzing radio-layer variability. Shih et al. [ 41 ] propose a TAS scheduling method based on constraint satisfaction that incorporates the variable residence time of the 5G logical bridge to preserve E2E determinism. The approach models wireless timing uncertainty and introduces a robustness margin into the scheduling constraints to balance schedulability and reliability. Fontalvo-Hernández et al. [ 42 ] analyze the feasibility of integrating 5G traffic into TSN schedules governed by TAS, focusing on jitter mitigation at the 5G - TSN boundary. It evaluates the hold-and-forward buffering mechanism proposed in 3GPP standards, which equalizes packet residence time in 5G to make flows compatible with TAS schedules. Using OMNeT++ simulations, the study quantifies the trade-off between jitter reduction and increased E2E delay introduced by buffering.
若干研究依赖仿真来评估和改进 5G-TSN 集成网络中的 TAS 调度、路由和性能。Li 等人 [37] 提出了一种基于冗余调度和优先级调整的容错 TAS 调度算法,以降低复杂度并提高对定时故障的鲁棒性,为 5G-TSN 集成提供了一个可扩展的基线。Wang 等人 [38] 提出了 Balanced and Urgency First Scheduling(B-UFS)启发式算法,以确保周期性时间关键流的确定性端到端时延。该算法针对不确定到达引入了伪循环排队与转发模型、统一资源度量,以及一种在时间和空间上平衡紧迫性与负载的调度策略,从而在整个网络中高效管理资源。Debnath 等人 [33] 提出了 5G TQ,这是一个开源框架,它通过 TSN 到 5G 的 QoS 映射算法实现 5G-TSN 集成。该框架在 5G MAC 层中实现了 QoS 感知优先级调度器,并使用 ns-3 评估无线接入网(RAN)级调度策略,展示了工业流量在时延和可靠性方面的改进。Ginthör 等人 [39] 提出了一种基于约束规划的框架,通过建模特定域约束和统一性能目标来优化 5G-TSN 网络中的端到端流调度。工业拓扑上的仿真表明,与分离的 5G 和 TSN 调度方法相比,该方法提高了可调度性并降低了时延。Chen 等人 [40] 探索了将 5G 用作 TSN 网桥的方式,集成 TAS 以支持跨 TSN 域和 5G 域的时间触发流。该研究提出了一种动态调度机制,为关键服务分配时间片,确保确定性时延和抖动。然而,该研究抽象掉了 5G 的无线特性,仅关注其作为确定性转发网桥的角色,而不是分析无线层变异性。Shih 等人 [41] 提出了一种基于约束满足的 TAS 调度方法,该方法纳入 5G 逻辑网桥的可变驻留时间,以保持端到端确定性。该方法对无线定时不确定性进行建模,并在调度约束中引入鲁棒性裕量,以平衡可调度性和可靠性。Fontalvo-Hernández 等人 [42] 分析了将 5G 流量集成到由 TAS 管控的 TSN 调度中的可行性,重点关注 5G-TSN 边界处的抖动缓解。该研究评估了 3GPP 标准中提出的保持并转发缓冲机制,该机制对 5G 中的数据包驻留时间进行均衡,使流能够与 TAS 调度兼容。通过 OMNeT++ 仿真,该研究量化了缓冲所引入的抖动降低与端到端时延增加之间的权衡。
引用 [37]-[42]、B-UFS、5G TQ、MAC、RAN、ns-3、3GPP、OMNeT++ 等术语和工具名已保留;“pseudo-cyclic queuing and forwarding”译为“伪循环排队与转发”,“hold-and-forward buffering mechanism”译为“保持并转发缓冲机制”。段落较长且涉及多个工作,逻辑关系已逐句对应,未发现明显问题。
While these simulation-based studies provide valuable insights into TAS scheduling and jitter mitigation, they lack practical guidelines for configuring TAS to handle 5G delay variability, and do not validate their proposals in real environments. For instance, although the promising approach of the hold-and-forward buffer jitter mitigation mechanism for TAS presented by Fontalvo-Hernández et al. [ 42 ] and the complete 5G - TSN architecture proposed by Debnath et al. [ 33 ], both lack commercial 5G and TSN equipment validation. Our work fills this gap by using a functional testbed to empirically analyze jitter impact and derive robust TAS configurations for 5G - TSN networks.
虽然这些基于仿真的研究为 TAS 调度和抖动缓解提供了有价值的见解,但它们缺乏用于配置 TAS 以处理 5G 时延变异性的实践指南,并且没有在真实环境中验证其方案。例如,尽管 Fontalvo-Hernández 等人 [42] 提出的面向 TAS 的保持并转发缓冲抖动缓解机制是一种有前景的方法,并且 Debnath 等人 [33] 提出了完整的 5G-TSN 体系结构,但二者都缺乏使用商用 5G 和 TSN 设备进行的验证。我们的工作通过使用功能性测试床,对抖动影响进行实证分析,并为 5G-TSN 网络推导鲁棒 TAS 配置,从而填补了这一空白。
“delay variability”译为“时延变异性”,“commercial 5G and TSN equipment validation”译为“使用商用 5G 和 TSN 设备进行的验证”。原文第二句语法略不完整或存在并列结构不顺,译文已按上下文补足主谓关系;需人工确认是否与作者原意完全一致。
Experimental validations complement theoretical and simulation results, providing practical insights into TAS scheduling for 5G - TSN networks. Jayabal et al. [ 43 ] design a contention-free Carrier Sense Multiple Access (CSMA) Medium Access Control (MAC) with transmission gating to minimize collisions and achieve low delay in 5G - TSN scenarios. Agustí-Torra et al. [ 44 ] aim to study architectural challenges and interoperability aspects in an emulated 5G - TSN testbed. Aijaz et al. [ 45 ] build a 5G - TSN testbed using commercial TSN and 5G devices to transmit traffic via IEEE 802.1Qbv TAS. It evaluates E2E delay and jitter by scheduling packets over a near product-grade 5G system under varying traffic and network conditions. The analysis offers a useful initial view of the impact of 5G integration on TAS performance and outlines resource allocation strategies, though a more in-depth exploration remains open for future work.
实验验证补充了理论结果和仿真结果,为 5G-TSN 网络中的 TAS 调度提供了实践见解。Jayabal 等人 [43] 设计了一种带有传输门控的无竞争载波侦听多路访问(CSMA)介质访问控制(MAC),以在 5G-TSN 场景中最小化冲突并实现低时延。Agustí-Torra 等人 [44] 旨在于一个仿真的 5G-TSN 测试床中研究体系结构挑战和互操作性方面的问题。Aijaz 等人 [45] 使用商用 TSN 和 5G 设备构建了一个 5G-TSN 测试床,通过 IEEE 802.1Qbv TAS 传输流量。该工作通过在不同流量和网络条件下,在接近产品级的 5G 系统上调度数据包,评估端到端时延和抖动。该分析对 5G 集成对 TAS 性能的影响提供了有用的初步视角,并概述了资源分配策略,不过更深入的探索仍留待未来工作开展。
CSMA、MAC、IEEE 802.1Qbv TAS、E2E、测试床等术语已保留;“contention-free”译为“无竞争”,“near product-grade”译为“接近产品级”。“emulated 5G-TSN testbed”译为“仿真的 5G-TSN 测试床”,可能也可译为“仿真/仿真化测试床”,未发现明显问题。
Recently, we investigated in [ 6 ] the impact of 5G network-induced delay and jitter on the performance of IEEE 802.1Qbv scheduling in integrated 5G - TSN networks. This study involved an empirical analysis based on a real-world testbed, which included IEEE 802.1Qbv-enabled switches, TSN translators, and a commercial 5G system. We focused on evaluating how the integration of 5G affects the deterministic behavior of IEEE 802.1Qbv scheduling, developed an experimental setup combining TSN and 5G technologies, and identified key configuration parameters to optimize IEEE 802.1Qbv performance within a 5G - TSN environment. However, neither in this nor in other empirical work are the conditions for deterministic communications defined, nor are the critical scenarios evaluated.
最近,我们在 [6] 中研究了 5G 网络引入的时延和抖动对集成 5G-TSN 网络中 IEEE 802.1Qbv 调度性能的影响。该研究包括一项基于真实世界测试床的实证分析,该测试床包含支持 IEEE 802.1Qbv 的交换机、TSN 转换器以及一个商用 5G 系统。我们重点评估了 5G 集成如何影响 IEEE 802.1Qbv 调度的确定性行为,开发了一个结合 TSN 和 5G 技术的实验设置,并识别了在 5G-TSN 环境中优化 IEEE 802.1Qbv 性能的关键配置参数。然而,无论是在这项工作中,还是在其他实证工作中,都没有定义确定性通信的条件,也没有评估关键场景。
IEEE 802.1Qbv、5G-TSN、TSN translators、commercial 5G system 等术语已保留;“neither in this nor in other empirical work”译为“无论是在这项工作中,还是在其他实证工作中”,逻辑准确。未发现明显问题。
Although these works are characterized by also conducting an empirical testbed-based evaluation of a 5G - TSN network with real traffic, they differ in scope and depth. Agustí-Torra et al. [ 44 ] focus on preliminary design and implementation of the testbed without delving into the evaluation of the feasibility of combining for different TAS configurations. In the case of Aijaz et al. [ 45 ], the enwindowed traffic from a single TSN switch is examined through the 5G system, focusing solely on delay performance rather than assessing a full TAS configuration. Similarly, Jayabal et al. [ 43 ] aim to enhance wireless TSN MAC coordination without integrating or characterizing real 5G latency behavior. In contrast, our work focuses on characterizing this delay for a specific TAS configuration in order to determine the required offset between TSN nodes in the downlink for deterministic operation.
尽管这些工作也以基于实证测试床、使用真实流量对 5G-TSN 网络进行评估为特征,但它们在范围和深度上有所不同。Agustí-Torra 等人 [44] 侧重于测试床的初步设计和实现,而没有深入评估针对不同 TAS 配置进行组合的可行性。对于 Aijaz 等人 [45],其研究考察了来自单个 TSN 交换机、经过窗口化处理的流量在 5G 系统中的表现,只关注时延性能,而不是评估完整的 TAS 配置。类似地,Jayabal 等人 [43] 旨在增强无线 TSN MAC 协调,而没有集成或刻画真实的 5G 时延行为。相比之下,我们的工作侧重于针对特定 TAS 配置刻画这种时延,以确定下行链路中 TSN 节点之间为了实现确定性运行所需的偏移量。
术语 TAS、TSN、MAC、5G-TSN、downlink 已按领域习惯保留或译为“下行链路”。“enwindowed traffic”译为“经过窗口化处理的流量”,该词较少见,可能需结合全文确认是否指受 TAS 门控窗口约束的流量。“combining for different TAS configurations”原文表达略不顺,译为“针对不同 TAS 配置进行组合的可行性”,存在轻微语义风险。
In this work, we have characterized how 5G -induced delay and jitter affect the coordinated operation of IEEE 802.1Qbv TAS in integrated 5G - TSN networks, with the objective of determining the timing conditions required to preserve deterministic transmission. We consider deterministic transmission as the scenario in which all packets of the same application cycle are forwarded within a single transmission window at both TSN switches adjacent to the 5G segment, ensuring bounded jitter not exceeding the transmission window.
在本工作中,我们刻画了由 5G 引入的时延和抖动如何影响集成 5G-TSN 网络中 IEEE 802.1Qbv TAS 的协调运行,目标是确定保持确定性传输所需的时序条件。我们将确定性传输视为这样一种场景:同一应用周期的所有数据包在与 5G 段相邻的两个 TSN 交换机处,都在单个传输窗口内被转发,从而确保有界抖动不超过该传输窗口。
IEEE 802.1Qbv TAS、5G-induced delay and jitter、application cycle、transmission window 等术语翻译一致。逻辑上保留了“目标是确定所需时序条件”和“同一应用周期数据包在两个相邻 TSN 交换机均落入单个传输窗口”的定义关系。数字、引用、公式无缺失。未发现明显问题。
To enable deterministic transmission, a temporal offset must be introduced between the network cycles of the TSN switches enclosing the 5G segment, dimensioned from a high-percentile bound of the 5G empirical delay. In addition, four timing constraints must be satisfied to ensure that all packets from the same application cycle are confined within a single transmission window. We also revealed another fundamental condition: the difference between the network cycle duration and the configured transmission window must be strictly larger than the 5G jitter, establishing how TAS parameters must be configured with respect to 5G delay to avoid ICI. These conditions were validated using a commercial 5G - TSN testbed under realistic equipment-induced delay variability. Furthermore, our experiments showed that multiple delay-critical flows sharing the same priority increase 5G queuing delays and jitter, requiring larger offsets and transmission windows to maintain application cycle confinement. The presence of best effort traffic further broadens the 5G delay distribution, even with TAS correctly configured, demonstrating that flow concurrency, traffic load, and 5G queuing dynamics must be explicitly considered to preserve the deterministic transmission.
为了实现确定性传输,必须在包围 5G 段的 TSN 交换机的网络周期之间引入一个时间偏移量,并且该偏移量应根据 5G 实证时延的高百分位上界来确定。此外,必须满足四个时序约束,以确保来自同一应用周期的所有数据包都被限制在单个传输窗口内。我们还揭示了另一个基本条件:网络周期时长与所配置传输窗口之间的差值必须严格大于 5G 抖动,这确立了 TAS 参数必须如何相对于 5G 时延进行配置,以避免 ICI。这些条件已在商用 5G-TSN 测试床上、在现实设备引入的时延变异性下得到验证。此外,我们的实验表明,多个共享相同优先级的时延关键型流会增加 5G 排队时延和抖动,因此需要更大的偏移量和传输窗口来维持应用周期约束。尽管 TAS 已正确配置,尽力而为流量的存在仍会进一步拓宽 5G 时延分布,这表明必须显式考虑流并发性、流量负载和 5G 排队动态,以保持确定性传输。
“high-percentile bound”译为“高百分位上界”,“strictly larger than”译为“严格大于”,逻辑和不等式含义保留。ICI 未展开,按原文保留缩写。最后一句 “preserve the deterministic transmission” 中定冠词未单独体现,但语义完整。无公式残缺;“四个时序约束”未列出属于原段未展开,不是翻译遗漏。未发现明显问题。
Our results call for investigating jitter-mitigation techniques, such as the hold-and-forward buffering mechanism, to alleviate the ICI effect and achieve near-full link utilization under realistic 5G delay variability. In addition, the performance of the 5G - TSN network can be further enhanced by leveraging uRLLC -oriented latency reduction features such as configured grants, mini-slot scheduling, 5G network slicing, or upcoming 6G systems. Our findings also motivate the design of adaptive algorithms capable of dynamically adjusting the offset and TAS parameters based on real-time traffic load, empirical 5G delay distribution, and radio channel conditions. Finally, future work could analyze how to guarantee determinism under isochronous traffic.
我们的结果要求进一步研究抖动缓解技术,例如保持并转发缓冲机制,以减轻 ICI 效应,并在现实 5G 时延变异性下实现接近满链路利用率。此外,可以通过利用面向 uRLLC 的时延降低特性,进一步提升 5G-TSN 网络的性能,例如配置授权、微时隙调度、5G 网络切片,或即将出现的 6G 系统。我们的发现还推动了自适应算法的设计,这类算法能够基于实时流量负载、实证 5G 时延分布和无线信道条件,动态调整偏移量和 TAS 参数。最后,未来工作可以分析如何在等时流量下保证确定性。
“hold-and-forward buffering mechanism”译为“保持并转发缓冲机制”,可能也可译为“保持-转发缓冲机制”,需按全文术语统一。uRLLC、configured grants、mini-slot scheduling、network slicing 等术语保留准确;“configured grants”译为“配置授权”符合蜂窝通信常见译法。数字、引用、公式无缺失。未发现明显问题。
中文逐段译稿
工业物联网(Industrial Internet of Things, IIoT)使紧密集成的网络物理系统(Cyber-Physical Systems, CPSs)成为可能,而这些系统对于现代工业 4.0 中的制造自动化至关重要。这些系统需要确定性、低时延通信,以保证在动态工业环境中的安全且可预测的运行 [1]。在要求最严苛的 IIoT 应用中,包括互联机器人与自主系统(Connected Robotics and Autonomous Systems, CRAS),例如自主移动机器人(Autonomous Mobile Robots, AMRs)、无人机以及智能代理。这些系统依赖于感知、计算和执行之间的精确协调,并且对通信时延和抖动高度敏感 [2]。
术语 IIoT、CPSs、CRAS、AMRs 均已保留并给出中文;“deterministic, low-latency communication”译为“确定性、低时延通信”符合 TSN 语境;引用 [1]、[2] 未遗漏。未发现明显问题。
为满足这些需求,时间敏感网络(Time-Sensitive Networking, TSN)标准定义了一些机制,使有线以太网基础设施上的确定性通信成为可能 [3]。TSN 的关键组件之一是 IEEE 802.1Qbv 时间感知整形器(Time-Aware Shaper, TAS),它在 TSN 交换机的输出端口处运行。TAS 通过周期性地打开和关闭门控来强制执行对传输介质的调度访问,这些门控控制来自不同流量队列的数据包的出端口发送。通过精确确定每个队列被允许发送的时间,TAS 为选定的流量类别确保有界时延和低抖动。这种确定性行为对于支持需要有保证通信性能的时间关键型 IIoT 应用至关重要 [4]。然而,TSN 对有线基础设施的依赖限制了移动性和灵活性,尤其是在复杂工业场景中。
IEEE 802.1Qbv、TAS、TSN 等缩写保留完整;“egress”译为“出端口发送”以贴合交换机队列语境;“bounded delay”译为“有界时延”;转折 “Nevertheless” 已译出。未发现明显问题。
为克服这些限制,第五代(5th Generation, 5G)移动网络提供移动性、灵活性、广域覆盖以及超可靠低时延通信(ultra-Reliable and Low-Latency Communications, uRLLC)能力,这些能力已经激发了将 5G 与 TSN 集成用于工业场景的显著兴趣 [5]。在这一范式中,机器人和生产线设备等工业终端设备通过 5G 系统以无线方式接入网络。5G 网络提供对有线 TSN 骨干网的访问,该骨干网由连接到边缘计算平台的 TSN 交换机构成,而这些边缘计算平台承载 IIoT 控制功能。这种集成旨在将 5G 的移动性和覆盖能力与 TSN 的确定性结合起来。然而,5G 的随机性特征,即无线段和核心网段中的可变时延,会破坏 TAS 所要求的严格时序。这种可变性对实现端到端(End-to-End, E2E)确定性通信构成挑战。
uRLLC、E2E、TAS 等缩写已保留;“radio and core segments”译为“无线段和核心网段”;“stochastic nature”译为“随机性特征”准确;因果与转折关系完整。未发现明显问题。
为应对这些挑战,必须仔细调整 TAS 配置,以维持跨 TSN 交换机的同步传输。特别是,这些配置必须补偿 5G 系统引入的时延可变性,同时避免过度缓冲、额外时延或带宽效率低下。确保传输窗口的正确对齐,对于保持时间敏感型 IIoT 应用所要求的确定性保证至关重要。
“TAS configurations”译为“TAS 配置”;“transmission windows”译为“传输窗口”;“bandwidth inefficiencies”译为“带宽效率低下”。逻辑上包含补偿与避免副作用两个并列要求,未遗漏。未发现明显问题。
文献综述。5G-TSN 集成已经引起了大量研究兴趣。已有工作探索了 5G 作为逻辑 TSN 交换机发挥作用的架构,并提出了用于域间时间同步和服务质量(Quality of Service, QoS)映射的解决方案。仿真研究也评估了 TAS 调度和抖动缓解;然而,这些研究通常依赖理想化的无线模型。尽管此类研究推进了对 5G-TSN 集成的理解,但在调整 TAS 参数以补偿真实 5G 时延和抖动动态方面,关键挑战仍然存在。特别是,在商用 5G 条件下仍缺乏实验验证。对于感兴趣的读者,第 VII 节提供了详细的文献综述。
“Literature Review”按论文小标题译为“文献综述”;QoS、TAS 保留;“commercial 5G conditions”译为“商用 5G 条件”;“Section VII”译为“第 VII 节”。未发现明显问题。
贡献。本文分析了 5G 引入的时延和抖动对集成 5G-TSN 网络中 IEEE 802.1Qbv TAS 运行的影响,重点关注 TAS 调度参数的配置,以适配一个时延关键型流量流。主要贡献如下:
“Contributions”译为“贡献”;“5G-induced delay and jitter”译为“5G 引入的时延和抖动”;“delay-critical traffic flow”译为“时延关键型流量流”。该段以冒号引出后续贡献,结构保留。未发现明显问题。
C1 我们对通过 5G 网络互连的、相邻且启用 TAS 的 TSN 交换机之间数据包传输所涉及的时延组成部分进行了详细分析。该分析刻画了 5G 引入的时延和抖动如何与 TAS 参数相互作用,并量化了它们对 E2E 时延性能的影响。C2 基于这一分析,我们识别了在 5G-TSN 网络中能够实现确定性通信的条件。我们深入研究了由不同 TAS 参数配置产生的各种结果场景,并提供了一般性配置指南,以确保确定性行为。C3 我们实现了一个实验测试床,将商用专用 5G 网络与启用 TAS 的 TSN 交换机集成在一起,从而能够在真实条件下对 TAS 配置进行现实世界评估。该测试床用于在具有代表性的网络场景下评估 5G 时延和抖动对特定 TAS 设置的影响。
C1、C2、C3 编号保留;“adjacent TAS-enabled TSN switches interconnected via a 5G network”已译出相邻、启用 TAS、经 5G 互连三层限定;“commercial private 5G network”译为“商用专用 5G 网络”。该段包含多个贡献条目但输入本身为一个段落,按要求未拆分。未发现明显问题。
我们对通过 5G 网络互连的、相邻且启用 TAS 的 TSN 交换机之间数据包传输所涉及的时延组成部分进行了详细分析。该分析刻画了 5G 引入的时延和抖动如何与 TAS 参数相互作用,并量化了它们对 E2E 时延性能的影响。
该段内容与 P007 中 C1 基本重复,按输入段落独立翻译;E2E、TAS 保留;“delay components”译为“时延组成部分”。未发现明显问题。
基于这一分析,我们识别了在 5G-TSN 网络中能够实现确定性通信的条件。我们深入研究了由不同 TAS 参数配置产生的各种结果场景,并提供了一般性配置指南,以确保确定性行为。
该段内容与 P007 中 C2 基本重复,按输入段落独立翻译;“resulting scenarios”译为“各种结果场景”较直译但保留原有限定。未发现明显问题。
我们实现了一个实验测试床,将商用专用 5G 网络与启用 TAS 的 TSN 交换机集成在一起,从而能够在真实条件下对 TAS 配置进行现实世界评估。该测试床用于在具有代表性的网络场景下评估 5G 时延和抖动对特定 TAS 设置的影响。
该段内容与 P007 中 C3 基本重复,按输入段落独立翻译;“real-world evaluation”译为“现实世界评估”;“representative network scenarios”译为“具有代表性的网络场景”。未发现明显问题。
本文建立在我们先前的会议论文工作 [6] 之上,该工作提出了一个基于测试床的、关于集成 5G-TSN 环境中 TAS 调度的初步研究。在这个扩展版本中,我们对 5G 引入的时延和抖动对 TAS 运行的影响,提供了更全面的理论分析和实验分析。我们识别并刻画了由不同 TAS 参数配置所产生的关键场景。此外,我们推导出通用配置指南,并形式化地确立了在 5G-TSN 网络中保证确定性端到端(E2E)性能所需的条件。
术语 TAS、5G-TSN、E2E 保留并补充中文含义;“5G-induced delay and jitter”译为“5G 引入的时延和抖动”准确;“formally establish”译为“形式化地确立”无明显遗漏。未发现明显问题。
我们的结果表明,要保证有界时延和有界抖动,需要基于观测到的最大 5G 时延来配置 TSN 交换机之间的 TAS 传输窗口偏移量,而该最大时延使用高百分位时延指标进行估计。虽然增大这一偏移量有助于吸收时延变化性,但它也会增加端到端(E2E)时延。此外,如果该偏移量变得过大,它可能导致 TSN 交换机的传输窗口之间发生失配,从而违反确定性行为。另外,为确保数据包总是到达其被分配的传输窗口内,TAS 周期时长应当大于 5G 引入的峰峰值抖动与传输窗口持续时间之和。最后,我们看到,具有相同优先级的额外业务流也可能增加 5G 时延和抖动。类似地,如果 5G 网络在不同业务类型之间缺乏适当隔离,则较低优先级的业务流也可能促成时延和抖动劣化。此类情形需要重新计算 TAS 参数。
“bounded latency and jitter”译为“有界时延和有界抖动”;“high-percentile delay metric”译为“高百分位时延指标”;“peak-to-peak jitter”译为“峰峰值抖动”,术语风险较低。逻辑上保留了偏移量增大既吸收变化性又增加 E2E 时延、过大则导致窗口失配的转折关系。未发现明显问题。
论文结构。本文组织如下:第 II 节介绍工业 5G-TSN 网络和 TAS 的背景。第 III 节给出系统模型。第 IV 节分析 5G 时延和抖动对 TAS 的影响。第 V 节描述测试床和实验设置。第 VI 节报告性能结果。第 VII 节回顾相关工作。第 VIII 节概述主要结论和未来工作。
章节编号、主题顺序和 TAS 等缩写均与原段一致;“Paper Outline”译为“论文结构”符合论文语境。未发现明显问题。
本节概述工业 4.0 中的 5G-TSN 网络。首先,我们介绍主要网络段以及工业应用的关键特征。然后,我们讨论 QoS 业务管理和 TAS 机制。最后,我们强调用于确定性通信的时间同步。
“Industry 4.0”译为“工业 4.0”;“network segments”译为“网络段”;QoS、TAS 保留。逻辑顺序完整。未发现明显问题。
如图 1 所示,在基于 5G-TSN 的工业网络中定义了三个连接段 [5]:
“connectivity segments”译为“连接段”;引用 [5] 和图 1 保留。该段引出后续列表,未发现明显问题。
• 边缘/云机房:集中由制造执行系统(MES)处理的管理任务,例如监测、数据收集和分析。控制功能传统上由可编程逻辑控制器(PLC)执行,这些控制器可以运行在专用硬件或通用服务器上,即虚拟化 PLC(vPLC)。这一层还可以包括一个网络设备,用于提供 TSN Grand Master(GM)时钟参考,该参考通常来源于全球导航卫星系统(GNSS)[7],以便在整个网络中分发。• 5G 系统:根据第三代合作伙伴计划(3GPP)TS 23.501(v19.0.0)[8],5G 系统作为一个或多个虚拟 TSN 交换机集成到 TSN 网络中,其中用户面功能(UPF)和用户设备(UE)充当端点。UE 以无线方式连接到下一代 Node B(gNB)。TSN 转换器,具体而言是位于 UPF 中的网络侧转换器(NW-TT)以及位于 UE 中的设备侧转换器(DS-TT),通过适配业务格式和 QoS 信息,并支持同步信息的传输,来支撑 TSN 域与 5G 域之间的集成。• 生产线:每条生产线包括现场设备(FD),例如传感器和执行器,并包括用于分布式控制的本地 PLC。FD 向集中式 PLC 报告运行数据,从而支持分层决策。每条生产线连接到一个 TSN Slave(SL)交换机,该交换机通过 5G 系统从 TSN Master(MS)交换机接收时钟信号,并将同步重新分发给该生产线内的 FD。
该段在输入中包含三个项目符号合并文本,且 P017-P019 又分别重复拆分这些项目,可能源自 PDF 抽取重复;按要求仍为 P016 输出一个小节。术语 MES、PLC、vPLC、GM、GNSS、3GPP TS 23.501 v19.0.0、UPF、UE、gNB、NW-TT、DS-TT、FD、SL、MS 均保留。存在列表抽取/重复上下文风险,但翻译内容未发现明显术语或数字错误。
边缘/云机房:集中由制造执行系统(MES)处理的管理任务,例如监测、数据收集和分析。控制功能传统上由可编程逻辑控制器(PLC)执行,这些控制器可以运行在专用硬件或通用服务器上,即虚拟化 PLC(vPLC)。这一层还可以包括一个网络设备,用于提供 TSN Grand Master(GM)时钟参考,该参考通常来源于全球导航卫星系统(GNSS)[7],以便在整个网络中分发。
与 P016 中第一项内容重复,应是输入抽取将列表整体和列表项分别保留导致;引用 [7]、缩写和逻辑关系完整。因存在重复抽取上下文风险,需人工确认是否保留。
5G 系统:根据第三代合作伙伴计划(3GPP)TS 23.501(v19.0.0)[8],5G 系统作为一个或多个虚拟 TSN 交换机集成到 TSN 网络中,其中用户面功能(UPF)和用户设备(UE)充当端点。UE 以无线方式连接到下一代 Node B(gNB)。TSN 转换器,具体而言是位于 UPF 中的网络侧转换器(NW-TT)以及位于 UE 中的设备侧转换器(DS-TT),通过适配业务格式和 QoS 信息,并支持同步信息的传输,来支撑 TSN 域与 5G 域之间的集成。
与 P016 中第二项内容重复,应是输入抽取重复;标准号 3GPP TS 23.501、版本 v19.0.0、引用 [8] 均保留。NW-TT、DS-TT 位置关系分别对应 UPF 和 UE,未发现明显问题。因重复抽取风险,需人工确认。
生产线:每条生产线包括现场设备(FD),例如传感器和执行器,并包括用于分布式控制的本地 PLC。FD 向集中式 PLC 报告运行数据,从而支持分层决策。每条生产线连接到一个 TSN Slave(SL)交换机,该交换机通过 5G 系统从 TSN Master(MS)交换机接收时钟信号,并将同步重新分发给该生产线内的 FD。
与 P016 中第三项内容重复,应是输入抽取重复;FD、PLC、SL、MS 缩写保留。逻辑上保留了现场设备上报数据、生产线交换机接收并重新分发同步的关系。因重复抽取风险,需人工确认。
工业网络流量主要对时延敏感,其端到端(E2E)时延需求范围从数百微秒到几十毫秒 [9]。虽然还存在其他流量类型,例如网络控制、移动机器人和视频流,但 TAS 可以应用于循环同步应用,这类应用需要高度可预测的时序,以确保可靠通信 [5, 10]。
“hundreds of microseconds to few tens of milliseconds”译为“数百微秒到几十毫秒”,保留数量级;“Cyclic-Synchronous applications”译为“循环同步应用”,术语可能也可译为“周期同步应用”,但语义可接受。引用 [9]、[5, 10] 保留。未发现明显问题。
循环同步(Cyclic-Synchronous)应用由运行在独立周期上的设备之间的周期性通信构成,其中同步是在中间网络节点处强制执行,而不是在终端设备处强制执行。每个设备以其自身的速率进行采样和更新,从而允许有界抖动以及一定的时序变化。尽管端到端(E2E)分组传输时延必须保持在可预测的界限之内,但偶发的变化是可以容忍的。因此,抖动被约束在时延界限之内 [10]。这类流量通常用于控制器到 I/O 的交换、周期性传感器轮询,以及对监控系统的更新。示例包括 PLC 到执行器的响应命令、对监控与数据采集(SCADA)系统的图形更新,以及常规诊断数据或历史数据库数据传输。
术语 Cyclic-Synchronous 译为“循环同步”,E2E、PLC、SCADA 已保留并解释;数字和引用 [10] 保留;“jitter is constrained to the latency bound”译为“抖动被约束在时延界限之内”,语义可能依赖上下文但未发现明显错译。
此外,另一类时间敏感型工业应用与循环同步应用共存,即等时(Isochronous)应用。尽管二者都要求在 5G-TSN 网络中进行严格的时延和抖动分析,但我们的工作面向一般的循环同步应用,并评估其调度的可行性,因为等时应用的严格要求目前无法得到满足,而且这些要求显著超出了现有 5G 部署的时延能力 [11]。
Isochronous 译为“等时”并保留英文;“both of them”对应二者;因果关系“as”已体现;引用 [11] 保留。未发现明显问题。
TSN 网络中的流量优先级划分依赖于 IEEE 802.1Q 虚拟局域网(VLAN)标签中定义的 3 比特优先级代码点(Priority Code Point, PCP)字段,该字段最多允许八个优先级等级 [3]。这些等级能够根据 QoS 需求进行区分:较高的取值(即 PCP 4-7)通常分配给关键流量,而较低的取值(即 PCP 0-3)用于时间敏感性较低的数据或尽力而为数据 [5]。
3-bit、八个优先级、PCP 4-7、PCP 0-3 和引用 [3][5] 均保留;QoS 保留为常用缩写;“best-effort”译为“尽力而为”。未发现明显问题。
在 5G 网络中,如 3GPP TS 23.501 [8] 所规定,QoS 通过 QoS 流 ID(QoS Flow ID, QFI)针对每个流进行管理,并与标准化的 5G QoS 标识符(5G QoS Identifier, 5QI)相关联。每个 5QI 定义关键性能特征,例如优先级等级、时延容忍度和分组错误率,这些特征决定了整个 5G 系统中对流量的处理方式 [12]。
QFI、5QI、3GPP TS 23.501、引用 [8][12] 均保留;“packet error rate”译为“分组错误率”,符合通信语境。未发现明显问题。
TSN 通过基于 PCP 的优先级划分来实施 QoS,而 5G 则采用由 5QI 驱动的流控制来区分流量。TSN 流量类别与 5G QoS 流之间的映射仍然是一个活跃的研究主题,这主要是由于 TSN 中基于 PCP 的优先级划分与 5G 中基于 5QI 的框架之间存在语义差异。如 [9] 所示,一种可行方法是在 UE 和 UPF 处根据以太网帧的 PCP 字段对其进行分类,并使用分组过滤器将它们与适当的 5G QoS 流关联起来。
PCP、5QI、QoS、UE、UPF 和引用 [9] 均保留;“semantic differences”译为“语义差异”;逻辑关系完整。未发现明显问题。
IEEE 802.1Qbv 是一项 TSN 标准,它规定了 TAS 机制;该机制能够根据 QoS 需求,在 TSN 交换机的出口端口处对第 2 层帧进行时间感知调度 [13, 14, 15]。TAS 利用 IEEE 802.1Q 报头中的 PCP 字段,将分组分类到八个先进先出(First-In First-Out, FIFO)队列之一。在每个出口端口处,这些队列被赋予优先级,以确保较高优先级流量先于较低优先级流量传输。
IEEE 802.1Qbv、TAS、Layer 2、PCP、FIFO 和引用 [13,14,15] 均保留;“egress ports”译为“出口端口”;优先级逻辑无遗漏。未发现明显问题。
每个出口端口由一个门控控制列表(Gate Control List, GCL)控制,该列表定义了一个由时钟参考支配的、按时间触发的传输调度,该调度被划分为多个传输窗口。在每个传输窗口期间,允许一个或多个队列进行传输,具体取决于其关联门的二进制状态。每个队列都有自己的门,而 GCL 指定每个门处于打开或关闭状态的时间区间。当多个门同时打开时,传输顺序通常遵循队列优先级,尽管确切行为可能取决于交换机实现。
GCL、传输窗口、二进制门状态、打开/关闭区间均完整保留;“clock reference”译为“时钟参考”,可接受;最后一句保留了实现相关的不确定性。未发现明显问题。
TAS 调度围绕周期性网络周期组织,以支持确定性通信。一个网络周期由一个固定时长的时间间隔构成,该时间间隔包含由 GCL 定义的一组特定传输窗口的一个完整实例 [16]。网络周期的持续时间通常被选择为与所涉及的应用周期对齐,而应用周期被定义为消息交换发生的周期。通常通过将网络周期持续时间选择为所涉及应用周期的最大公约数来实现这种对齐。关于 TAS 的更多信息,请参见 [4]。
“network cycles”“application cycles”均译为周期相关概念,存在中文重复但语义忠实;“greatest common divisor”译为“最大公约数”;引用 [16][4] 保留。未发现明显问题。
时间同步在 5G-TSN 网络中至关重要,用于支持 IIoT 应用的确定性需求。在典型 TSN 架构中,如第 II-A 节所定义,TSN MS 交换机通过精确时间协议(Precision Time Protocol, PTP)或广义精确时间协议(generalized Precision Time Protocol, gPTP)消息,将 GM 时钟分发给多个 TSN SL 交换机,其中每个 TSN SL 交换机都部署在不同的生产线上。接收到这些消息后,每个 TSN SL 交换机会估计其本地时钟与 TSN MS 交换机参考时钟之间的时间差,即所谓的时钟偏移,并相应地调整其本地时间 [17]。
IIoT、TSN MS、GM、PTP、gPTP、TSN SL、clock offset 和引用 [17] 均保留;“as defined in Section II-A”的修饰对象可能涉及整句架构说明,译文已放在典型架构描述中。未发现明显问题。
根据 3GPP TS 23.501 [8] 中定义的架构,TSN 转换器,具体而言即 NW-TT 和 DS-TT,使 GM 时钟能够跨越 5G 系统传播到 TSN 域,从而维持通过 5G 互连的 TSN 交换机之间的时钟一致性(见图 1)。一种被广泛采用的、用于在 5G 上传播同步的配置是 IEEE 1588 [18, 19, 20] 中定义的透明时钟(Transparent Clock, TC)模式;在该模式下,同步消息会被转发,同时 correctionField 被更新以反映每个中间节点内的驻留时间,而原始时间戳保持不变。与边界时钟(Boundary Clock, BC)模式不同,在 BC 模式中每个节点都会终止并重新生成同步消息;TC 模式通过累积驻留时间来保持单一时序域。NW-TT 和 DS-TT 测量 5G 系统内的驻留时间,并通过 correctionField 将该时延包含在转发后的消息中。该操作符合 IEEE 1588-2019,并能够在 TSN 端点处实现准确的时钟校正。更多信息请参见 [17, 21, 18, 20, 19]。
3GPP TS 23.501、NW-TT、DS-TT、GM、IEEE 1588、TC、BC、correctionField、IEEE 1588-2019 和所有引用均保留;“residence time”译为“驻留时间”;“forwarded messages with the correctionField”原文表达略不自然,译文按技术含义处理。未发现明显问题。
5G-TSN 网络内不同设备的时钟可能会出现不一致,从而使设备无法准确地更新其时钟。3GPP TS 22.104 [22] 规定,为了使 5G 系统能够支持时间关键型工业应用,必须保证最大时钟漂移贡献为 900 ns。与此一致,[20] 中的工作通过实证方式量化得到最大峰峰值同步误差为 500 ns,这显著低于该要求。
术语“clock drift contribution”译为“时钟漂移贡献”,“peak-to-peak synchronization error”译为“峰峰值同步误差”;900 ns、500 ns 和引用 [22]、[20] 保留正确。逻辑上“低于要求”指误差小于最大允许漂移贡献,未发现明显问题。
本节介绍网络模型和流量模型。随后我们描述 TAS 模型,接着描述系统中不同的时延来源。表 I 汇总了全文使用的关键数学符号。
TAS、表 I、network/traffic models 均已保留或准确翻译;段落为章节引导,无公式风险。未发现明显问题。
符号约定。我们使用花体字母(例如 𝒳,\(\mathcal{X}\))表示集合。小写字母(例如 \(y\))表示随机变量,而大写字母(例如 \(Y\))表示常量参数。二元变量使用大写无衬线字体排版(例如 𝖷,\(\mathsf{X}\))。下标表示某个参数适用于给定集合中的特定元素;例如,\(z_{i,j}\) 指的是与元素 \(i \in \mathcal{I}\) 和 \(j \in \mathcal{J}\) 对应的参数 \(z\)。上标提供描述性注释,例如 \(z^{\text{desc}}\) 表示带有描述符“desc”的变量 \(z\)。此外,\(f_x(\cdot)\) 和 \(F_x(\cdot)\) 分别表示随机变量 \(x\) 的概率密度函数(Probability Density Function, PDF)和累积分布函数(Cumulative Distribution Function, CDF)。最后,字母 \(\hat{Z}\) 表示 \(F_x(\cdot)\) 的统计上界。
输入中存在 OCR/抽取重复,如“y y”“Y Y”“z z”等,译文按数学含义合并呈现;PDF/CDF、\(\hat{Z}\)、\(f_x(\cdot)\)、\(F_x(\cdot)\) 保留。由于“\(\hat{Z}\) denotes the statistical upper bound of \(F_x(\cdot)\)”中变量 \(Z\) 与 \(x\) 的关系缺少上下文,但公式本身可译。未发现明显问题。
我们考虑一个由 \(\mathcal{I}\) 表示的网络节点集合,其包括:(i)两个 TSN 交换机,分别表示为主交换机 MS 和从交换机 SL;(ii)两个 TSN 转换器,其中一个是网络侧转换器,表示为 NW-TT,另一个是设备侧转换器,表示为 DS-TT;(iii)一个表示为 UE 的 5G UE;以及(iv)一个 5G gNB 和一个 UPF,分别表示为 gNB 和 UPF。每条通信链路由 \(\varepsilon\) 表示,所有这类链路的集合由 \(\mathcal{E}\) 表示。节点 \(i\) 与 \(j\) 之间的一条特定链路表示为 \(\varepsilon_{i,j} \in \mathcal{E}\),其中 \(i,j \in \mathcal{I}\)。拓扑由以下顺序链路定义:\(\mathcal{E} \equiv \{\varepsilon_{\text{MS},\text{NW-TT}}, \varepsilon_{\text{NW-TT},\text{UPF}}, \varepsilon_{\text{UPF},\text{gNB}}, \varepsilon_{\text{gNB},\text{UE}}, \varepsilon_{\text{UE},\text{DS-TT}}, \varepsilon_{\text{DS-TT},\text{SL}}\}\)。我们将对应于 5G 系统的节点子集定义为 \(\mathcal{I}^{\text{5G}} \equiv \{\text{UE}, \text{gNB}, \text{UPF}, \text{NW-TT}, \text{DS-TT}\}\)。类似地,虚拟 5G 系统链路集合 \(\mathcal{E}^{\text{5G}} \subset \mathcal{E}\) 包含连接 5G 系统节点的物理链路子集,即 \(\mathcal{E}^{\text{5G}} \equiv \{\varepsilon_{\text{NW-TT},\text{UPF}}, \varepsilon_{\text{UPF},\text{gNB}}, \varepsilon_{\text{gNB},\text{UE}}, \varepsilon_{\text{UE},\text{DS-TT}}\}\)。最后,我们将 TSN 交换机子集定义为 \(\mathcal{I}^{\text{TSN}} \subset \mathcal{I}\),即 \(\mathcal{I}^{\text{TSN}} \equiv \{\text{MS}, \text{SL}\}\),它们通过链路集合 \(\mathcal{E}^{\text{TSN}} \subset \mathcal{E}\) 经由 5G 系统互连;该集合包含通向 5G 网桥边界 NW-TT 和 DS-TT 的物理链路子集,即 \(\mathcal{E}^{\text{TSN}} \equiv \{\varepsilon_{\text{MS},\text{NW-TT}}, \varepsilon_{\text{DS-TT},\text{SL}}\}\)。
原文 LaTeX 中混有 glossaries 抽取噪声,译文已恢复为可读公式;节点集合、链路集合、5G/TSN 子集和所有链路方向均逐项保留。原文末尾 “respectively” 指代稍不清晰,但不影响集合定义。未发现明显问题。
令 \(\mathcal{S}\) 表示穿越所考虑的 5G-TSN 网络的流量流集合。具体而言,\(\mathcal{S}\) 包括:
“traffic flows”译为“流量流”,\(\mathcal{S}\) 保留;该段引出列表,内容依赖后续段落。未发现明显问题。
• 一个由循环同步应用生成的下行时延关键型(Delay-Critical, DC)流,如第 II-B 节所述。我们假设下行方向的一个 DC 流是一组分组,这些分组共享位于边缘/云机房(Edge/Cloud Room)的源,例如 PLC,并且以同一生产线中的任一设备作为目的地,例如执行器;这些设备通常由一个公共交换机服务,即 SL 交换机。在每个应用周期中,其周期时长为 \(T_{\text{DC}}^{\text{app}}\),PLC 生成一批 \(N_{\text{DC}}\) 个恒定大小为 \(L_{\text{DC}}\) 的分组,从而得到平均数据速率 \(R_{\text{DC}}^{\text{gen}} = N_{\text{DC}} \cdot L_{\text{DC}} / T_{\text{DC}}^{\text{app}}\),这是在处理生产状态之后传送给所有这些执行器的响应 [23]。此外,分组必须在满足 E2E 时延约束 \(d_{\text{DC}}^{\text{E2E}} \leq D_{\text{DC}}\) 的条件下穿越 5G-TSN 网络。假设这些分组属于单个应用,则它们彼此之间共享相同的定时约束。• 一个下行尽力而为型(Best-Effort, BE)流,由不要求严格定时保证的分组组成。我们假设恒定大小为 \(L_{\text{BE}}\) 的分组以恒定数据速率 \(R_{\text{BE}}^{\text{gen}}\) 生成。• 上行和下行 PTP 流被认为用于支持 TSN 交换机之间的时钟同步。按照 PTP 标准定义,这些消息的交换周期性发生,其应用周期 \(T_{\text{PTP}}^{\text{app}}\) 显著大于 \(T_{\text{DC}}^{\text{app}}\),即 \(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\)。
该输入段落实际包含三个项目符号内容,并且后续 P037-P039 又分别重复这些项目;按要求仍作为 P036 单独完整翻译。公式 \(R_{\text{DC}}^{\text{gen}}\)、\(d_{\text{DC}}^{\text{E2E}} \leq D_{\text{DC}}\)、\(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\) 保留;“as a response delivered...” 的修饰关系可能依赖原文排版,但译文按 PLC 生成批量分组作为响应处理。由于段落抽取疑似列表合并且与 P037-P039 重复,需人工复核。
一个由循环同步应用生成的下行时延关键型(Delay-Critical, DC)流,如第 II-B 节所述。我们假设下行方向的一个 DC 流是一组分组,这些分组共享位于边缘/云机房的源,例如 PLC,并且以同一生产线中的任一设备作为目的地,例如执行器;这些设备通常由一个公共交换机服务,即 SL 交换机。在每个应用周期中,其周期时长为 \(T_{\text{DC}}^{\text{app}}\),PLC 生成一批 \(N_{\text{DC}}\) 个恒定大小为 \(L_{\text{DC}}\) 的分组,从而得到平均数据速率 \(R_{\text{DC}}^{\text{gen}} = N_{\text{DC}} \cdot L_{\text{DC}} / T_{\text{DC}}^{\text{app}}\),这是在处理生产状态之后传送给所有这些执行器的响应 [23]。此外,分组必须在满足 E2E 时延约束 \(d_{\text{DC}}^{\text{E2E}} \leq D_{\text{DC}}\) 的条件下穿越 5G-TSN 网络。假设这些分组属于单个应用,则它们彼此之间共享相同的定时约束。
DC、PLC、SL、E2E 及公式均保留;该段与 P036 的第一项重复,可能是 PDF 列表抽取造成。未见数字或公式错误,但重复上下文需注意。
一个下行尽力而为型(Best-Effort, BE)流,由不要求严格定时保证的分组组成。我们假设恒定大小为 \(L_{\text{BE}}\) 的分组以恒定数据速率 \(R_{\text{BE}}^{\text{gen}}\) 生成。
BE、\(L_{\text{BE}}\)、\(R_{\text{BE}}^{\text{gen}}\) 保留;该段与 P036 的第二项重复,未发现明显问题。
上行和下行 PTP 流被认为用于支持 TSN 交换机之间的时钟同步。按照 PTP 标准定义,这些消息的交换周期性发生,其应用周期 \(T_{\text{PTP}}^{\text{app}}\) 显著大于 \(T_{\text{DC}}^{\text{app}}\),即 \(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\)。
PTP、TSN、上下行方向、应用周期关系均保留;该段与 P036 的第三项重复。未发现明显问题。
PTP 流被分配最高优先级,其后依次是 DC 流和 BE 流,并且这一点在 5G 域和 TSN 域中保持一致。因此,为了进行 TSN 调度,PTP 和 DC 分组被分配更高的 PCP 值,并且它们被映射到具有更低 5QI 指数的 5G QoS 流,这表示更严格的 QoS 处理。BE 分组被映射到优先级最低、5QI 指数更高的类别。
优先级顺序 PTP > DC > BE、PCP 值更高、5QI 指数更低代表更严格 QoS 处理均准确保留;5G QoS、TSN 调度术语未遗漏。未发现明显问题。
在每个 TSN 交换机 \(i \in \mathcal{I}^{\text{TSN}}\) 处,每个出端口都关联一个集合 \(\mathcal{Q}_{i}\),该集合最多包含八个输出队列。我们假设每个队列 \(q \in \mathcal{Q}_{i}\) 与一个业务流 \(s \in \mathcal{S}\) 之间存在一一映射,因此在本文中允许 \(q\) 与 \(s\) 互换使用。此外,我们假设 GCL 在每个出端口的八个队列之间强制执行互斥的门打开,保证在任意给定时刻只允许一个队列进行传输。
术语 GCL、TSN、egress port、output queue 已保留/准确转译;“up to eight”译为“最多八个”;“one-to-one mapping”和“interchangeability”逻辑未遗漏;互斥门打开的约束表达清楚。未发现明显问题。
因此,交换机 \(i \in \mathcal{I}^{\text{TSN}}\) 处队列 \(q \in \mathcal{Q}_{i}\) 的 GCL 配置由式(1)形式化表示。二元变量 \(\mathsf{G}_{i,q}(t)\) 表示该门是打开(1)还是关闭(0)。这些门以周期 \(T_{i}^{\text{nc}}\) 周期性运行,该周期称为网络周期。在网络周期 \(n=0\) 中,门打开和关闭的时刻 \(T_{i,q}^{\text{open}}\) 与 \(T_{i,q}^{\text{closed}}\) 定义传输窗口时长 \(W_{i,q}=T_{i,q}^{\text{closed}}-T_{i,q}^{\text{open}}\)。 \[ \mathsf{G}_{i,q}(t)= \begin{cases} 1, & nT_{i}^{\text{nc}}+T_{i,q}^{\text{open}}<t\leq nT_{i}^{\text{nc}}+T_{i,q}^{\text{closed}},\\ & \forall n\in\mathbb{N}\cup\{0\}.\\ 0, & \text{otherwise}. \end{cases} \tag{1} \]
二元变量、网络周期、开闭时刻、窗口时长均准确保留;不等式左开右闭 \(<t\leq\) 未误译;\(\forall n\in\mathbb{N}\cup\{0\}\) 已保留。公式来自输入文本,格式重排但含义未改变。未发现明显问题。
DC 流周期 \(T_{\text{DC}}^{\text{app}}\) 通常从数百微秒到几十毫秒不等,而 PTP 同步消息大约每 \(T_{\text{PTP}}^{\text{app}}\approx 1\,\text{s}\) 生成一次。鉴于条件 \(T_{\text{PTP}}^{\text{app}} \gg T_{\text{DC}}^{\text{app}}\),我们将网络周期的持续时间视为 \(T_{i}^{\text{nc}}=T_{\text{DC}}^{\text{app}}\),\(\forall i\in\mathcal{I}^{\text{TSN}}\),因为 DC 流是本文工作的主要目标。
“several hundreds of microseconds up to a few tens of milliseconds”译为“数百微秒到几十毫秒”;PTP 周期约 1 秒保留;远大于关系 \(\gg\) 与 \(T_i^{\text{nc}}=T_{\text{DC}}^{\text{app}}\) 未遗漏。未发现明显问题。
每个网络周期包含三个互不重叠的传输窗口(见图 2):用于 DC 业务的 \(W_{i,\text{DC}}\)、用于 PTP 同步消息的 \(W_{i,\text{PTP}}\),以及用于 BE 业务的 \(W_{i,\text{BE}}\),其后跟随一个固定保护带 \(T^{\text{GB}}\),以避免对 DC 业务造成干扰。因此, \[ T_{i}^{\text{nc}}=W_{i,\text{DC}}+W_{i,\text{PTP}}+W_{i,\text{BE}}+T^{\text{GB}},\quad \forall i\in\mathcal{I}^{\text{TSN}}. \] 我们认为,由于同步消息频率较低,\(W_{i,\text{PTP}}\) 只占 \(T_{i}^{\text{nc}}\) 的一个可忽略的比例,小 100 到 1000 倍,即 \(W_{i,\text{PTP}}\ll W_{i,\text{DC}}\) 且 \(W_{i,\text{PTP}}\ll W_{i,\text{BE}}\)。因此,并且为了便于阅读,后续方程中省略 \(W_{i,\text{PTP}}\),同时隐含假设它被调度在 \(W_{i,\text{DC}}\) 之后立即执行。关于 PTP 规划的进一步细节,见文献 [21]。
三个窗口、固定保护带、周期求和公式均保留;“100 to 1000 times smaller”译为“小 100 到 1000 倍”,语义较直译但中文略生硬;PTP 窗口在后续公式省略但隐含紧随 DC 窗口的逻辑已保留。未发现公式风险。
最后,在 MS 处,假定属于 DC 流的每一批 \(N_{\text{DC}}\) 个分组在每个网络周期开始时均可用。
MS、DC、\(N_{\text{DC}}\) 保留;“each batch”和“at the start of every network cycle”未遗漏。未发现明显问题。
对于穿越节点 \(i \in \mathcal{I}\) 的流 \(s \in \mathcal{S}\) 中的每个分组,总时延由五个组成部分构成:输入排队时延、处理时延、输出排队时延、传输时延和传播时延。这些组成部分可见于图 3。
五类 delay 的顺序与含义保持一致;“packet of flow”译为“流中的每个分组”;节点集合 \(\mathcal{I}\) 和流集合 \(\mathcal{S}\) 已保留。未发现明显问题。
输入排队时延 \(d_{i,s}^{\text{que,in}}\) 是分组到达节点 \(i\) 与其开始处理之间的时间间隔。处理时延 \(d_{i,s}^{\text{proc}}\) 对应于节点 \(i\) 解析分组头并确定转发动作所需的时间。输出排队时延 \(d_{i,s}^{\text{que,out}}\) 指从节点 \(i\) 处理结束到分组被传输到下一跳之间的时延。
三个时延定义准确;“parse the packet header”和“determine the forwarding action”均已翻译;“until the packet is transmitted to the next hop”未误译为到达下一跳。未发现明显问题。
传输时延 \(d_{\varepsilon_{i,j},s}^{\text{tran}}\) 对应于通过链路 \(\varepsilon_{i,j}\in\mathcal{E}\) 将分组的所有比特串行化所需的时间。它取决于分组大小 \(L_s\) 和链路容量 \(r_{\varepsilon_{i,j}}\),并由 \[ d_{\varepsilon_{i,j},s}^{\text{tran}}=L_s/r_{\varepsilon_{i,j}} \] 给出。传播时延 \(D_{\varepsilon_{i,j}}^{\text{prop}}\) 是信号穿过链路 \(\varepsilon_{i,j}\in\mathcal{E}\) 所需的时间,并假定对该链路中任意流 \(s\in\mathcal{S}\) 而言随时间保持恒定。
transmission delay 与 propagation delay 区分清楚;串行化、分组大小、链路容量、公式 \(L_s/r_{\varepsilon_{i,j}}\) 已保留;“constant for any flow ... in that link in time”译为随时间恒定,含义准确。未发现明显问题。
在本节中,我们分析 5G 如何影响 TAS 调度性能。首先,我们定义任意流的一个分组的 E2E 时延,并研究 5G 时延组成部分如何影响该时延。然后,我们形式化 TSN 交换机中 DC 流传输窗口的约束。接下来,我们引入 MS 与 SL 交换机的网络周期之间的偏移概念,并推导确保确定性通信所需的条件。最后,我们分析该偏移如何与 5G 时延组成部分相互作用,并评估不同 TAS 参数配置如何在各种场景中影响调度性能。
本段为章节路线说明;E2E、TAS、TSN、DC、MS、SL 等缩写保留;“offset between the network cycles”译为“网络周期之间的偏移”;因果与顺序连接词 First/Then/Next/Finally 均保留。未发现明显问题。
流集合 \(\mathcal{S}\) 会穿越一系列网络节点以到达其目的地,如图 3 所示。沿该路径,流 \(s\in\mathcal{S}\) 的 E2E 分组传输时延 \(d_s^{\text{E2E}}\) 计算为每个网络节点处的时延之和加上每条链路上的传输时延: \[ d_s^{\text{E2E}} = \sum_{i\in\mathcal{I}} \left(d_{i,s}^{\text{que,in}}+d_{i,s}^{\text{proc}}+d_{i,s}^{\text{que,out}}\right) + \sum_{e\in\mathcal{E}} \left(d_{e,s}^{\text{tran}}+D_e^{\text{prop}}\right). \tag{2} \] 5G 时延 \(d_s^{\text{5G}}\) 定义为 5G 域中的节点处理时延和排队时延,加上链路传输时延之和: \[ d_s^{\text{5G}} = \sum_{j\in\mathcal{I}^{\text{5G}}} \left(d_{j,s}^{\text{que,in}}+d_{j,s}^{\text{proc}}+d_{j,s}^{\text{que,out}}\right) + \sum_{k\in\mathcal{E}^{\text{5G}}} \left(d_{k,s}^{\text{tran}}+D_k^{\text{prop}}\right). \tag{3} \] 为了评估 5G 与 TAS 调度结合时的影响,我们考虑 MS 与 SL 输出端口之间的分组时延 \(d_s^{\text{MS},\text{SL}}\),并按如下方式计算: \[ d_s^{\text{MS},\text{SL}} = \sum_{\varepsilon\subset\mathcal{E}^{\text{TSN}}} \left(d_{\varepsilon,s}^{\text{tran}}+D_{\varepsilon}^{\text{prop}}\right) + d_s^{\text{5G}} + d_{\text{SL},s}^{\text{que,in}} + d_{\text{SL}}^{\text{proc}} + d_{\text{SL},s}^{\text{que,out}}. \tag{4} \] 为方便起见,我们还考虑 MS 输出端口与 SL 交换机处理之间的分组时延 \(\widetilde{d}_s^{\text{MS},\text{SL}}\),即排除 SL 输出排队时延 \(d_{\text{SL},s}^{\text{que,out}}\),因为它会受到 TAS 配置的影响: \[ \widetilde{d}_s^{\text{MS},\text{SL}} = \sum_{\varepsilon\subset\mathcal{E}^{\text{TSN}}} \left(d_{\varepsilon,s}^{\text{tran}}+D_{\varepsilon}^{\text{prop}}\right) + d_s^{\text{5G}} + d_{\text{SL},s}^{\text{que,in}} + d_{\text{SL}}^{\text{proc}}. \tag{5} \] 在本文中,我们依赖经验时延测量进行分析。因此,我们的模型必须考虑同步误差,该误差会内在地影响不同 TSN 节点之间的时延测量,即 \(\Delta_{i,j}\),\(\forall i,j\in\mathcal{I}^{\text{TSN}}\)。因此,MS 与 SL 输出端口之间的分组时延的经验测量值 \(d_s^{\text{emp}}\) 可如式(6)表示,其中 \(\Delta_{\text{MS},\text{SL}}\) 指 MS 与 SL 之间的同步误差: \[ d_s^{\text{emp}}=d_s^{\text{MS},\text{SL}}+\Delta_{\text{MS},\text{SL}}. \tag{6} \] \(\Delta_{\text{MS},\text{SL}}\) 的值假定可以取正值或负值,因为时钟在任意时刻都可能相对于彼此前进或滞后。较大的 \(|\Delta_{\text{MS},\text{SL}}|\) 可能导致测量变得不可靠,因为它会扭曲事件之间的时间对应关系。这样,式(2)中的 E2E 时延也会受到同步误差影响。因此,其经验测量值可写为式(7)中的 \(d_s^{\text{E2Emp}}\): \[ d_s^{\text{E2Emp}} = d_{\text{MS},s}^{\text{que,in}} + d_{\text{MS}}^{\text{proc}} + d_{\text{MS},s}^{\text{que,out}} + d_s^{\text{emp}}. \tag{7} \] 类似地,MS 输出端口与 SL 交换机处理之间的分组时延的经验测量值,从现在起称为 Zero-Wait-at-SL(ZWSL)经验时延 \(\widetilde{d}_s^{\text{emp}}\),可如式(8)表示: \[ \widetilde{d}_s^{\text{emp}} = \widetilde{d}_s^{\text{MS},\text{SL}} + \Delta_{\text{MS},\text{SL}}. \tag{8} \] 观察:5G 系统时延 \(d_s^{\text{5G}}\) 显著大于有线链路上的传输时延 \(d_{\varepsilon_{i,j},s}^{\text{tran}}\),\(\forall \varepsilon_{i,j}\in\mathcal{E}\setminus\{\varepsilon_{\text{gNB},\text{UE}}\}\),\(\forall i,j\in\mathcal{I}\);也显著大于传播时延 \(D_{\varepsilon_{i,j}}^{\text{prop}}\),\(\forall \varepsilon_{i,j}\in\mathcal{E}\),\(\forall i,j\in\mathcal{I}\);并且显著大于 TSN 交换机中的处理时延 \(d_{i,s}^{\text{proc}}\),\(\forall i\in\mathcal{I}^{\text{TSN}}\)。一方面,有线链路上的传输时延通常处于微秒量级。例如,假设有 42 Bytes 的开销,一个 200 Bytes 分组在 1 Gbps 链路中的传输时延为 \(1.9\,\mu s\)。类似地,TSN 交换机中的处理时延通常也处于微秒量级 [24]。另一方面,5G 系统时延处于从毫秒到几十毫秒的范围 [11]。这种时延和抖动的主导性将在第 VI 节中通过实验得到佐证。
本段包含多个公式和定义,已逐项保留式(2)至式(8)、E2E、5G、MS、SL、ZWSL、经验测量、同步误差等关键术语;\(\Delta_{\text{MS},\text{SL}}\) 可正可负及其可靠性影响逻辑完整;“between the MS output port and the SL switch processing”译为“MS 输出端口与 SL 交换机处理之间”准确。风险点:输入中式(3)的集合 LaTeX 存在疑似 OCR/抽取瑕疵(\(\mathcal{I^{5G}}\)、\(\mathcal{E^{5G}}\)),译文按常规数学记法规范为 \(\mathcal{I}^{\text{5G}}\)、\(\mathcal{E}^{\text{5G}}\);式(4)(5)中的 \(\sum_{\varepsilon\subset\mathcal{E}^{\text{TSN}}}\) 原文使用 subset 符号,语义可能本应为链路属于集合,需人工确认。另,“200 Bytes packet, assuming 42 Bytes of overhead”中 200 Bytes 是否包含开销上下文不完全明确,但 1.9 μs 数字已保留。
作为这一观察结果的后果,5G 系统时延及其相关抖动在式 (4)-(8) 中起着显著作用,因此也在 TSN 交换机的 TAS 配置中起着显著作用。由于我们的分析以 DC 流为目标,从这一点往后给出的公式表述假设 \(s=\text{DC}\)。
术语“5G system delay”译为“5G 系统时延”,“associated jitter”译为“相关抖动”,“TAS configuration”译为“TAS 配置”,与上下文一致;式号 (4)-(8) 保留;\(s=\text{DC}\) 保留。未发现明显问题。
对于 TSN 交换机 \(i\in\mathcal{I}^{\text{TSN}}\) 上的流 \(\text{DC}\in\mathcal{S}\),其传输窗口持续时间 \(W_{i,\text{DC}}\) 必须满足两个条件:它必须严格短于网络周期 \(T_i^{\text{nc}}\),并且必须大于或等于 \(N_{\text{DC}}\) 个分组通过输出端口的累计传输时间。这些约束在式 (9) 中形式化表示,其中 \(j\in\mathcal{I}\) 是交换机 \(i\) 之后的下一个网络节点。 \[ N_{\text{DC}}\cdot d_{\varepsilon_{i,j},\text{DC}}^{\text{tran}}\leq W_{i,\text{DC}}<T_i^{\text{nc}}. \tag{9} \] 违反这些边界可能导致性能退化。如果 \(W_{i,\text{DC}}\) 过短,则并非所有 \(N_{\text{DC}}\) 个分组都能在单个网络周期内传输。剩余分组会累积,并被推迟到后续网络周期,从而引入额外时延,这些额外时延是 \(T_i^{\text{nc}}\) 的倍数。另一方面,如果 \(W_{i,\text{DC}}\) 超过网络周期持续时间,它会独占调度,从而阻止其他流 \(s\in\mathcal{S}\setminus\{\text{DC}\}\) 在该网络周期期间被调度。
“strictly shorter than”已译为“严格短于”;“equal or greater than”已译为“大于或等于”;公式不等号方向和严格小于号保留;\(j\) 的定义、\(N_{\text{DC}}\)、\(T_i^{\text{nc}}\) 等符号保留。需注意原文“equal or greater than”语法应为“equal to or greater than”,但含义明确。未发现明显问题。
我们考虑 MS 和 SL 两个交换机采用相同的 TAS 调度配置,即 \(T_{\text{MS}}^{\text{nc}}=T_{\text{SL}}^{\text{nc}}\) 且 \(W_{\text{MS},\text{DC}}=W_{\text{SL},\text{DC}}\)。在这一假设下,我们将偏移量 \(\delta_{\text{DC}}\) 定义为 MS 和 SL 处网络周期开始时间之间的时间差。必须配置该偏移量,以确保在单个应用周期内生成的所有 \(N_{\text{DC}}\) 个分组到达 SL 的输出队列,并在对应的传输窗口关闭之前通过其出口端口传输。
MS、SL、TAS、DC 等缩写保留;“offset”译为“偏移量”;“application cycle”译为“应用周期”;“egress port”译为“出口端口”。公式等式保留准确。未发现明显问题。
由于所有 \(N_{\text{DC}}\) 个分组都作为一个突发流从 MS 发送到 5G 系统中,因此,为偏移量 \(\delta_{\text{DC}}\) 确定一个取值,有必要刻画这些分组在 5G 系统中经历的时延。假设 5G 系统容量通常低于有线链路的容量 [11],则 5G 段构成 5G-TSN 网络中的瓶颈,在该瓶颈处,分组会经历不断增加的排队时延。如果不需要重传,突发流中的第一个分组可能以最小时延穿越 5G 网络,即 \(\min(d_{\text{DC}}^{\text{5G}})\),而每一个后续分组都必须等待前面分组的传输。因此,时延会在整个突发流内累积,使得最后一个分组往往经历最高时延,即 \(\max(d_{\text{DC}}^{\text{5G}})\),该值已经包含整个突发流的累计排队时延。因此,偏移量 \(\delta_{\text{DC}}\) 必须至少设置为 \(\max(\widetilde{d}_{\text{DC}}^{\text{emp}})\),以保证分组在 SL 输出端口队列中可用,并能够按时传输。这得到式 (10) 中的条件。 \[ \delta_{\text{DC}}\geq \max(\widetilde{d}_{\text{DC}}^{\text{emp}}). \tag{10} \] 由于 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 本质上是随机的,因此有必要从统计上刻画其行为。在本文中,我们基于 ZWSL 经验时延的 CDF \(F_{\widetilde{d}_{\text{DC}}^{\text{emp}}}(\cdot)\) 的给定百分位 \(p\in[0,1)\),定义一个统计上界。具体而言,我们将该上界记为 \(\hat{D}_{\text{DC},p}^{\text{emp}}=F_{\widetilde{d}_{\text{DC}}^{\text{emp}}}^{-1}(p)\),它对应于时延分布的第 \(p\) 百分位。较高的 \(p\) 值会提高 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 保持低于 \(\hat{D}_{\text{DC},p}^{\text{emp}}\) 的置信度 [25]。例如,设置 \(p=0.999\) 会得到这样一个上界,使得 99.9% 的分组经历低于该值的时延。相应地,我们按式 (11) 设置偏移量 \(\delta_{\text{DC}}\),以确保至少 \(p\cdot 100\%\) 的分组在 SL 中的传输窗口关闭之前已经入队。 \[ \delta_{\text{DC}}\geq \hat{D}_{\text{DC},p}^{\text{emp}}. \tag{11} \] 另一个值得关注的参数是 SL 处用于传输 DC 流分组的初始传输窗口打开的时间瞬间。我们将这一瞬间记为网络周期偏移量 \(\delta_{\text{DC}}^{\prime}\),形式化定义如下: \[ \delta_{\text{DC}}^{\prime}= \begin{cases} \delta_{\text{DC}}, & \text{if } \delta_{\text{DC}}<T_i^{\text{nc}},\\ \delta_{\text{DC}}\bmod T_i^{\text{nc}}, & \text{otherwise}. \end{cases} \tag{12} \] 网络周期偏移量 \(\delta_{\text{DC}}^{\prime}\) 取决于所配置的偏移量 \(\delta_{\text{DC}}\) 和网络周期持续时间 \(T_i^{\text{nc}}\)。当 \(\delta_{\text{DC}}<T_i^{\text{nc}}\) 时,有 \(\delta_{\text{DC}}^{\prime}=\delta_{\text{DC}}\),并且传输窗口恰好在所配置的偏移量处打开。相反,如果 \(\delta_{\text{DC}}\geq T_i^{\text{nc}}\),则初始传输机会可能发生在所配置的偏移量之前,而有效打开时间由 \(\delta_{\text{DC}}^{\prime}=\delta_{\text{DC}}\bmod T_i^{\text{nc}}\in[0,T_i^{\text{nc}})\) 给出。
本段公式和统计定义较多,已保留 \(\min\)、\(\max\)、CDF、逆 CDF、百分位、\(p\in[0,1)\)、\(p=0.999\)、99.9%、式 (10)-(12);“Consequently”连续出现两次,译文均体现因果;“ZWSL empirical delay”译为“ZWSL 经验时延”。风险点:原文将 \(p\in[0,1)\) 称为 “p-th percentile”,严格说 \(p=0.999\) 对应 99.9 百分位,中文按原意处理;公式 (11) 的输入文本中符号下标存在排版噪声,译文采用一致写法 \(\hat{D}_{\text{DC},p}^{\text{emp}}\)。
我们将确定性传输视为这样一种场景:在 MS 处给定网络周期的同一个传输窗口中,包含 \(N_{\text{DC}}\) 个分组的整个突发流被交付,并在 SL 交换机处的单个传输窗口内被转发。在这种情况下,E2E 抖动仍由窗口大小 \(W_{i,\text{DC}}\) 约束,从而使可预测通信成为可能。
“deterministic transmission”译为“确定性传输”;“entire burst”译为“整个突发流”;“delivered and forwarded”译为“被交付,并……被转发”;E2E、\(W_{i,\text{DC}}\) 保留。未发现明显问题。
为了确定是否可能实现确定性传输,有必要考察 5G 引入的时延和抖动与以下 TAS 参数之间的关系:(i) 网络周期偏移量 \(\delta_{\text{DC}}^{\prime}\),(ii) 网络周期持续时间 \(T_i^{\text{nc}}\),以及 (iii) 传输窗口大小 \(W_{i,\text{DC}}\)。
“5G-induced delay and jitter”译为“5G 引入的时延和抖动”;三项 TAS 参数完整保留,编号、符号无遗漏。未发现明显问题。
我们将不确定性区间 \(t_{\text{DC}}^{\text{uni}}\) 定义为 DC 流中的一个分组在穿越 5G-TSN 网络时可能经历的时延范围: \[ t_{\text{DC}}^{\text{uni}}= \left[\min(\widetilde{d}_{\text{DC}}^{\text{emp}}),\ \hat{D}_{\text{DC},p}^{\text{emp}}\right]. \tag{13} \] 该区间由逐分组 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 的最小值和最大值界定。注意,我们将 ZWSL 经验时延分布的第 \(p\) 百分位视为不确定性区间的最大值。相应地,我们将 5G-TSN 网络的诱发抖动 \(t_{\text{DC}}^{\text{jit}}\) 定义为不确定性区间两个边界之间的差: \[ t_{\text{DC}}^{\text{jit}}= \max(t_{\text{DC}}^{\text{uni}})-\min(t_{\text{DC}}^{\text{uni}}). \tag{14} \] 为了保证确定性传输,MS 与 SL 之间必须满足两个时序条件:
“uncertainty interval”译为“不确定性区间”;“range of possible delays”译为“可能经历的时延范围”;式 (13)、式 (14) 保留。风险点:原文先说区间由逐分组 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 的最小值和最大值界定,但式 (13) 的上界实际使用第 \(p\) 百分位 \(\hat{D}_{\text{DC},p}^{\text{emp}}\),译文保留了这一潜在概念不一致,并通过“注意”句体现原文解释。
确定性的第一条件:为了确保 MS 和 SL 处传输窗口之间的这种一一对应关系,SL 交换机处传输窗口的开始时间,即 \(\delta_{\text{DC}}^{\prime}\),必须满足式 (15) 中对任意网络周期都有效的两个边界条件,或者也可以满足式 (16) 中的两个边界条件。 \[ \begin{split} &\text{C1: } \max(t_{\text{DC}}^{\text{uni}})\leq \delta_{\text{DC}}^{\prime},\\ &\text{C2: } \delta_{\text{DC}}^{\prime}+W_{i,\text{DC}}\leq \min(t_{\text{DC}}^{\text{uni}})+T_i^{\text{nc}}. \end{split} \tag{15} \] 条件 C1 表明,SL 交换机处的传输窗口必须仅在 MS 交换机传输的突发流的最后一个分组已经在当前网络周期中到达之后才开始,从而确保当窗口打开时所有这些分组都已经可用。条件 C2 要求传输窗口必须在 MS 交换机处后续网络周期中被服务的第一个分组于下一个网络周期到达 SL 交换机之前关闭。 \[ \begin{split} &\text{C3: } \max(t_{\text{DC}}^{\text{uni}})\leq \delta_{\text{DC}}^{\prime}+T_i^{\text{nc}},\\ &\text{C4: } \delta_{\text{DC}}^{\prime}+W_{i,\text{DC}}\leq \min(t_{\text{DC}}^{\text{uni}}). \end{split} \tag{16} \] 条件 C3 规定,SL 交换机处的传输窗口只能在 MS 交换机传输的突发流的最后一个分组已经在前一个网络周期中到达之后才开始。条件 C4 指明,传输窗口必须在 MS 交换机处后续网络周期中被服务的第一个分组于当前网络周期到达 SL 交换机之前关闭。
C1-C4 的不等式方向、\(\delta_{\text{DC}}^{\prime}\)、\(W_{i,\text{DC}}\)、\(T_i^{\text{nc}}\)、\(\min/\max\) 均保留;“or, alternatively”译为“或者也可以”,体现式 (15) 与式 (16) 的替代关系。风险点:C3/C4 对“previous/current network cycle”的描述较绕,译文严格按原文时序表达,建议结合图或上下文人工确认。
式 (15) 或式 (16) 中任意一个成立,都能确保所有 \(N_{\text{DC}}\) 个分组可以在单个传输窗口内被转发。否则,突发流必然会被拆分到多个传输窗口中,从而违反确定性要求。我们将这种效应称为跨周期干扰,即 Inter-Cycle Interference (ICI),其中,在一个网络周期中调度的分组可能会干扰下一个网络周期中调度的分组。
“Either Eq. (15) or Eq. (16)”译为“任意一个成立”;“necessarily be split”译为“必然会被拆分”;ICI 全称和缩写保留,并译为“跨周期干扰”。未发现明显问题。
由于 \(\max(t_{\text{DC}}^{\text{uni}})=\hat{D}_{\text{DC},p}^{\text{emp}}\),在式 (15) 和式 (16) 中,SL 交换机处转发所有 \(N_{\text{DC}}\) 个分组的传输窗口以下述值为下界:ZWSL 经验时延 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 的时延分布的第 \(p\) 百分位,因此也以 5G 系统时延分布的第 \(p\) 百分位为下界。作为一个相关后果,为了根据第 \(p\) 百分位和网络周期持续时间实现确定性传输,分组经验时延 \(d_{\text{DC}}^{\text{emp}}\) 可能会相应增加。
保留 \(\max(t_{\text{DC}}^{\text{uni}})=\hat{D}_{\text{DC},p}^{\text{emp}}\)、式 (15)/(16)、\(N_{\text{DC}}\)、\(\widetilde{d}_{\text{DC}}^{\text{emp}}\)、\(d_{\text{DC}}^{\text{emp}}\)。风险点:原文 “transmission window ... is lower bounded by the p-th percentile” 表述略不直观,译文按“传输窗口以下述值为下界”处理;“may increase in exchange for achieving deterministic transmission”译为“为了……可能会相应增加”,建议人工确认是否应更强调“以增加经验时延为代价”。
确定性的第二个条件:直接比较式(15)或式(16)中被单独置于各不等式一侧的 $\delta^{\prime}_{\mathrm{DC}}$ 的上界和下界,会得到式(17)中的附加条件;该条件关联了 TAS 参数必须如何相对于 5G 抖动进行配置,以保证确定性传输。$T_i^{\mathrm{nc}} - W_{i,\mathrm{DC}} \geq t_{\mathrm{DC}}^{\mathrm{jit}}$。(17)
术语方面,Determinism 译为“确定性”,TAS、DC 保留缩写;数字与公式编号(15)(16)(17)保留。公式方向为“大于等于”,未发现反向风险。原文中 LaTeX 提取含有 `glossaries` 标记,已按语义还原为 $\mathrm{DC}$。未发现明显问题。
式(17)对 TAS 配置与 5G 系统统计行为之间的相互作用施加了第二个基本条件。它表明,由 5G 引起的抖动对网络周期 $T_i^{\mathrm{nc}}$ 施加了一个下界。此外,增大传输窗口 $W_{i,\mathrm{DC}}$ 不仅如式(17)所示要求更大的网络周期 $T_i^{\mathrm{nc}}$,而且还会由于 5G 系统中数据包的累积排队效应而间接增大 $t_{\mathrm{DC}}^{\mathrm{jit}}$。进一步地,式(17)还对 DC 流量的链路利用率施加了限制,因为在网络周期时段内增加 DC 流量的传输窗口会导致 ICI,并破坏确定性。
术语方面,link utilization 译为“链路利用率”,cumulative queuing effect 译为“累积排队效应”,ICI 保留缩写。公式变量 $T_i^{\mathrm{nc}}$、$W_{i,\mathrm{DC}}$、$t_{\mathrm{DC}}^{\mathrm{jit}}$ 均保留。逻辑上保留了“不仅……而且……此外”的递进关系。未发现明显问题。
上文推导出的条件为确定性传输提供了基础。在以下小节中,我们将在不同参数配置下对这些条件进行详细分析,识别确定性能够实现或会被违反的场景,以便随后在第 VI 节中通过实验进行展示。
章节编号 Section VI 保留为“第 VI 节”。逻辑上,“to later be experimentally demonstrated”译为“以便随后……通过实验进行展示”,未省略因果目的。未发现明显问题。
图 4 展示了对经验时延 $d_{\mathrm{DC}}^{\mathrm{emp}}$ 的影响分析,该经验时延在很大程度上由 5G 系统主导;分析对象是 MS 和 SL 两个交换机中 TAS 机制的协同运行。该图显示了通过 5G 系统互连的 MS 和 SL 交换机的出口端口上的数据传输时序。每条时间线都被组织为连续的网络周期,其中每个网络周期都包含一个分配给 DC 流的单一传输窗口。该图基于 SL 处传输窗口与式(13)中的不确定性区间 $t_{\mathrm{DC}}^{\mathrm{uni}}$ 之间的相对时序,考虑了四种不同场景。这些场景由网络参数 $T_i^{\mathrm{nc}}$、$W_{i,\mathrm{DC}}$ 以及所配置偏移 $\delta_{\mathrm{DC}}$ 上的特定条件定义;根据式(12),$\delta_{\mathrm{DC}}$ 隐式地决定 $\delta^{\prime}_{\mathrm{DC}}$。
术语方面,empirical delay 译为“经验时延”,uncertainty interval 译为“不确定性区间”,egress ports 译为“出口端口”。MS、SL、TAS、DC 保留缩写。图号和公式编号(4)(12)(13)准确保留。原文句子较长,已拆分但未改变逻辑。未发现明显问题。
场景 1:早到情况下的确定性传输。$\min(t_{\mathrm{DC}}^{\mathrm{uni}})+T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}} \geq \delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})$。(18)根据式(15)中先前的条件 C1 和 C2,可以为式(18)中的 $\delta^{\prime}_{\mathrm{DC}}$ 得到下界 $\delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})$,以及上界 $\delta^{\prime}_{\mathrm{DC}} \leq \min(t_{\mathrm{DC}}^{\mathrm{uni}})+T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}}$。在这种情况下,来自给定网络周期的所有数据包都会在初始传输窗口打开之前到达 SL。因此,它们可以完全在该传输窗口内被传输。该配置确保了 5G-TSN 网络中的确定性行为,并且数据包抖动由传输窗口的持续时间 $W_{i,\mathrm{DC}}$ 所界定。
公式不等式方向保留:左侧为上界,右侧为下界。C1、C2、式(15)(18)保留。early arrival 译为“早到”,initial transmission window 译为“初始传输窗口”。“bounded by”译为“由……所界定”,语义对应。未发现明显问题。
场景 2:初始传输窗口未使用情况下的确定性传输。$\min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}} \geq \delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})-T_i^{\mathrm{nc}}$。(19)现在,根据式(16)中的条件 C3 和 C4,可以为式(19)中的 $\delta^{\prime}_{\mathrm{DC}}$ 得到下界 $\delta^{\prime}_{\mathrm{DC}} \geq \max(t_{\mathrm{DC}}^{\mathrm{uni}})-T_i^{\mathrm{nc}}$,以及上界 $\delta^{\prime}_{\mathrm{DC}} \leq \min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}}$。在 SL 处初始传输窗口关闭之前没有数据包到达,因此该窗口保持未使用。然而,所有数据包都会在第二个传输窗口打开之前可用,从而允许它们被完整传输。与场景 1 相比,这会导致更高的最小和最大数据包传输时延,增加量来自在队列中等待直到下一个网络周期。尽管如此,传输仍保持确定性,并具有有界抖动。
公式不等式方向与上下界解释一致。C3、C4、式(16)(19)保留。unused initial transmission window 译为“初始传输窗口未使用”,bounded jitter 译为“有界抖动”。“increased by the waiting in the queue”译为“增加量来自在队列中等待”,逻辑准确。未发现明显问题。
场景 3:部分数据包到达情况下的非确定性传输。$\max(t_{\mathrm{DC}}^{\mathrm{uni}}) \geq \delta^{\prime}_{\mathrm{DC}} \geq \min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}}$。(20)一些数据包及时到达,能够在 SL 处的初始传输窗口期间被传输,而另一些数据包必须等待第二个传输窗口。这会导致第 IV-D 节中定义的 ICI。因此,抖动至少增大到一个完整网络周期,从而影响在下一个网络周期中调度的数据包,并且 5G-TSN 网络中的确定性丧失。
partial packet arrival 译为“部分数据包到达”,non-deterministic transmission 译为“非确定性传输”。式(20)不等式方向保留。Section IV-D 译为“第 IV-D 节”。“at least one full network cycle”中的“至少”和“完整网络周期”已保留。未发现明显问题。
场景 4:延迟到达情况下的非确定性传输。$\delta^{\prime}_{\mathrm{DC}} \leq \min\{\min(t_{\mathrm{DC}}^{\mathrm{uni}})-W_{i,\mathrm{DC}}, \max(t_{\mathrm{DC}}^{\mathrm{uni}})-T_i^{\mathrm{nc}}\}$。(21)该配置代表了 5G-TSN 网络的最不利条件,因为式(17)未被满足。这意味着 ICI 是不可避免的。在这种情况下,SL 处的第二个或后续传输窗口可能会在所有数据包到达之前关闭,因此一些数据包可能会在下一个网络周期中被传输,导致所有场景中最高的时延和抖动。我们反映了这样一种情况:由于网络周期之间数据包在 SL 缓冲区中的累积,ICI 被扩展到第三个传输窗口。
公式中的 $\min\{\cdot\}$ 结构保留,式(21)编号保留。delayed arrival 译为“延迟到达”,most adverse condition 译为“最不利条件”。最后一句 “We reflect the case...” 原文表达略不自然,可能依赖图示上下文;译为“我们反映了这样一种情况”较直译,但“reflect”具体含义可能为“展示/体现”。需人工确认图 4 语境。
在本节中,我们描述所实现的 5G-TSN 测试床以及所考虑的实验设置。
implemented testbed 译为“所实现的测试床”,experimental setup 译为“实验设置”。未发现明显问题。
为了开展我们的经验分析,我们实现了图 5 所示的测试床。其组成部分说明如下。
empirical analysis 译为“经验分析”,testbed 译为“测试床”,图 5 编号保留。未发现明显问题。
5G 系统。该 5G 网络由单个 gNB 和一个 5G 核心网组成,二者均在一台 PC 上实现,该 PC 配备 50 MHz PCIe Amarisoft 软件定义无线电(SDR)卡以及 AMARI NW 600 许可证。gNB 工作在 n78 频段,子载波间隔为 30 kHz,带宽为 50 MHz。数据传输采用时分双工(TDD)方案,其模式为四个连续下行时隙、四个上行时隙和两个灵活时隙。尽管我们的分析仅关注下行流量,但该配置为上行保留资源,从而实现了一个现实的测试床环境 [26]。部署了两个 UE,每个 UE 均由一个 Quectel RM500Q-GL 调制解调器组成,该调制解调器通过 USB 连接到运行 Ubuntu 22.04 的 Intel NUC 10(i7-10710U、16 GB RAM、512 GB SSD)。实验使用一个 LABIFIX 法拉第笼进行,gNB 天线通过 SMA 连接器连接到 SDR。最后,尽管通常为每个 UE 分配一个 DS-TT [5],但该概念验证通过为两个 UE 使用单个 DS-TT 来简化设置。类似地,为了简化起见,我们使用单个 NW-TT。
术语 gNB、5G core、SDR、TDD、UE、DS-TT、NW-TT 均保留并给出必要中文;频段 n78、30 kHz、50 MHz、时隙数量、硬件型号与配置未发现数字遗漏。注意“Amarisoft SDR cards”原文有复数 cards,但上下文为一台 PC,译为“卡”可能需结合设备实际数量确认。其余未发现明显问题。
TSN 网络。TSN 网络使用 Safran 的 WR-Z16 交换机构建。一台交换机作为 MS 运行,另一台作为 SL 运行,另外两台交换机充当 TSN 转换器,即 NW-TT 和 DS-TT。MS 直接连接到一台 Safran SecureSync 2400 服务器,该服务器向 SL 提供 GM 时钟以进行时间同步。由于 5G 系统在 PTP TC 模式下运行(在 TSN 转换器中实现 [20]),因此使用一台辅助 WR-Z16 交换机在 TSN 转换器之间分发 5G GM 时钟,该辅助交换机也通过第二台 SecureSync 2400 进行同步。每台 WR-Z16 交换机均基于 Xilinx Zynq-7000 FPGA 和 1 GHz 双核 ARM Cortex-A9,能够在基于 Linux 的操作系统下实现高交换速率和低处理时延。交换机支持 IEEE 802.1Qbv TAS 和 VLAN,并包含十六个 1GbE 小型可插拔(SFP)定时端口,这些端口可配置为 PTP MS 或 SL。每个出口端口提供四个优先级硬件队列,用于分离不同流量流,每个队列的最大缓冲区大小为 6.6 kB。这将 PCP 的数量限制为从 0 到 3,并且还对持续吞吐量施加约束,因为超过排空能力会导致丢包。此外,每个端口上的时间戳探针能够在 TSN 节点的输出端口之间进行高精度时延测量。
MS、SL 在本文上下文中应分别为 Master/Slave 或主/从时钟相关角色,保留缩写避免误译;PTP TC、GM、NW-TT、DS-TT、SFP、PCP 均保留。数字“十六个 1GbE”“四个队列”“6.6 kB”准确。原文“limits the number of PCPs from 0 to 3”严格说是限制可用 PCP 取值范围为 0 到 3,译文已体现。未发现明显问题。
测试床时钟同步。TSN GM 时钟服务器与 MS 之间的时间同步通过承载两个信号的同轴电缆建立:一个用于绝对相位对齐的每秒脉冲(PPS)脉冲,以及一个用于通过振荡器驯服进行频率同步的 10 MHz 参考信号。类似地,辅助 WR-Z16 交换机使用相同的同轴接口与 5G GM 时钟服务器同步,从而能够在 NW-TT 和 DS-TT 之间进行准确的时间分发,以启用 TC 模式 [20]。在测试床中,MS 和 SL 使用单播用户数据报协议(UDP)通过 IPv4 通信 PTP 数据包,并采用 E2E 时延测量机制。PTP 传输速率配置为每秒 1 个数据包。
PPS、10 MHz、UDP、IPv4、E2E、PTP 传输速率等数字和缩写均保留。术语“oscillator disciplining”译为“振荡器驯服”是时间同步领域可接受译法,也可人工考虑译为“振荡器校准/约束”。未发现数字或逻辑问题。
端设备与测试床连接。两台 Ubuntu 22.04 LTS 服务器分别作为使用 packETH 工具的数据包生成器和接收端运行。测试床中的所有组件均使用 1 Gbps 光纤链路互连,但 NW-TT - gNB 以及 DS-TT - UE 之间的连接除外,这些连接使用 1 Gbps RJ-45 以太网电缆。
packETH、Ubuntu 22.04 LTS、1 Gbps、RJ-45 均准确保留。原文“packet generator with packETH tool and sink”译为“数据包生成器和接收端”符合网络实验语境。未发现明显问题。
网络流量。在 5G 核心网处,配置了两个不同的数据网络名称(DNN),以便为工业流量管理创建分离的网络切片。一个承载 PTP 和 DC 流,另一个处理 BE 流,从而实现差异化路由和资源分配。5G 网络采用 IP 传输,因为所考虑的 UE 在没有基于以太网的会话的情况下运行。为支持 IP 之上的二层工业自动化流量,实现了一种基于虚拟可扩展局域网(VxLAN)的隧道机制 [9],并相应配置了两个 VxLAN:一个传输 DC 和 PTP 流,另一个传输 BE 流。数据包被标记为反映各流之间相对优先级的 PCP 值:PTP 流的数据包使用 PCP 3,DC 流数据包使用 PCP 2,BE 流数据包使用 PCP 0。此外,在 5G 网络内部,按各流的数据包分配 5QI 值,其中 PTP 和 DC 流量为 80,BE 流量为 9。
DNN、PTP、DC、BE、IP、Layer 2、VxLAN、PCP、5QI 均保留。两个 DNN、两个 VxLAN、PCP 3/2/0、5QI 80/9 数字准确。原文“per flow’s packets”语法略别扭,译为“按各流的数据包分配”符合含义。未发现明显问题。
我们在五个实验场景中评估 DC 流的数据包传输时延 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。每个场景分析一个特定的 TAS 配置参数,以评估其对 TSN 系统容忍 5G 所引入时延的能力的影响。
原文公式包含 LaTeX/glossaries 转换残留,已规范为 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。DC、TAS、TSN、5G 均保留;“five experimental scenarios”译为“五个实验场景”。由于公式原文存在抽取冗余但可辨识,未发现明显问题。
实验 1:5G 网络的时延分析。我们分析改变流量生成速率 \(R_{\mathrm{DC}}^{\mathrm{gen}}\) 对 5G 网络时延和抖动的影响,以确定 \(\hat{D}_{\mathrm{DC},p}^{\mathrm{emp}}\),并由此确定不确定性区间 \(t_{\mathrm{DC}}^{\mathrm{uni}}\)。为此,我们以 300 kbps 为增量,将 \(R_{\mathrm{DC}}^{\mathrm{gen}}\) 从 350 kbps 扫描到 1.55 Mbps。对于每个 \(R_{\mathrm{DC}}^{\mathrm{gen}}\),传输窗口 \(W_{\mathrm{MS},\mathrm{DC}}\) 根据式 (9) 中定义的下界计算,以确保符合 WR-Z16 的缓冲区大小限制。这使得 MS 处的传输窗口范围从 10.5 \(\mu s\) 到 46.5 \(\mu s\)。TAS 在 MS 处启用,而在 SL 处,输出队列门始终保持 100% 开启。这样做是为了估计 ZWSL 经验时延 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)。网络周期固定为 \(T_{\mathrm{MS}}^{\mathrm{nc}}=30\) ms。
公式符号 \(R_{\mathrm{DC}}^{\mathrm{gen}}\)、\(\hat{D}_{\mathrm{DC},p}^{\mathrm{emp}}\)、\(t_{\mathrm{DC}}^{\mathrm{uni}}\)、\(W_{\mathrm{MS},\mathrm{DC}}\)、\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)、\(T_{\mathrm{MS}}^{\mathrm{nc}}\) 已从抽取残留规范化。数值 300 kbps、350 kbps、1.55 Mbps、10.5 \(\mu s\)、46.5 \(\mu s\)、100%、30 ms 准确。ZWSL 未展开,按原文保留。原文存在公式抽取噪声,状态建议人工复核公式排版。
实验 2:基于 MS 和 SL 交换机传输窗口之间偏移的时延分析。我们分析 MS 和 SL 处网络周期之间不同时间偏移对 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 的影响。TAS 在两台交换机上以类似方式配置,其中传输窗口固定为 \(W_{i,\mathrm{DC}}=46.5~\mu s\),网络周期固定为 \(T_i^{\mathrm{nc}}=30\) ms,\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。我们扫描偏移 \(\delta_{\mathrm{DC}}=\{5,10,15,20,25,30\}\) ms。
公式 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)、\(W_{i,\mathrm{DC}}\)、\(T_i^{\mathrm{nc}}\)、\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)、\(\delta_{\mathrm{DC}}\) 已规范化。数值 46.5 \(\mu s\)、30 ms、集合 \{5,10,15,20,25,30\} ms 准确。原文标题中 “Offset between transmission windows” 与正文“network cycles”存在轻微表述差异,译文分别保留。未发现明显问题。
实验 3:基于网络周期的时延分析。我们在恒定 \(\delta_{\mathrm{DC}}\) 下研究网络周期对 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 的影响,以分析第 IV-E 节中描述的场景。网络周期在 \(T_i^{\mathrm{nc}}=\{6,8,10,12.5,15,17.5,20,22.5\}\) ms 的范围内变化,\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。传输窗口分别设置为 \(W_{i,\mathrm{DC}}=\{9,12,15,18,22.5,25.5,30,33\}\) \(\mu s\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\),以将注入到 5G-TSN 网络中的数据速率保持恒定为 1.55 Mbps。
公式和集合已规范化;网络周期集合与传输窗口集合一一对应,“respectively”译为“分别”。数值 6、8、10、12.5、15、17.5、20、22.5 ms,以及 9、12、15、18、22.5、25.5、30、33 \(\mu s\),1.55 Mbps 均准确。未发现明显问题。
实验 4:考虑多个相同优先级流量流的时延分析。我们在多个不同流共享同一优先级输出队列时评估数据包传输时延。首先,TAS 仅在 MS 处启用,而在 SL 处,输出队列门始终保持 100% 开启,与实验 1 相同,以获得 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)。网络周期固定为 \(T_i^{\mathrm{nc}}=30~\mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。并且,为容纳所有流,传输窗口设置为 \(W_{\mathrm{MS},\mathrm{DC}}=\{0.25,0.5,0.75,1,1.25,1.5,1.75\}\) ms,在源端分别转发 1 到 7 个聚合 DC 流,并分析其中一个流的时延分布。随后,我们还在 SL 处配置 TAS,使得 \(W_{\mathrm{MS},\mathrm{DC}}=W_{\mathrm{SL},\mathrm{DC}}\),以表征 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。偏移 \(\delta_{\mathrm{DC}}\) 根据先前实验保持恒定。
公式 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)、\(T_i^{\mathrm{nc}}\)、\(W_{\mathrm{MS},\mathrm{DC}}\)、\(W_{\mathrm{SL},\mathrm{DC}}\)、\(d_{\mathrm{DC}}^{\mathrm{emp}}\)、\(\delta_{\mathrm{DC}}\) 已规范化。数值 100%、30 ms、窗口集合 0.25 到 1.75 ms、1 到 7 个聚合 DC 流均准确。原文“forwarding from 1 to 7 aggregated DC flows at source each”语法略不顺,译为“在源端分别转发 1 到 7 个聚合 DC 流”需结合表格或实验设置人工确认。
实验 5:基于 BE 流量负载的时延分析。我们扫描 BE 分组生成速率 \(R_{\text{BE}}^{\text{gen}}=\{600,650,700,750,800,850,900,950,980\}\) Mbps,以分析 BE 负载如何影响 DC 流量的 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 分布。网络周期固定为 \(T_i^{\text{nc}}=30~\text{ms}\),对所有 \(i\in\mathcal{I}^{\text{TSN}}\) 均如此;传输窗口仅设置在 MS 处,且 \(W_{\text{MS},\text{DC}}=46.5~\mu s\)。
术语 BE、DC、MS、TSN 保留为缩写;速率集合、30 ms、46.5 μs、\(\forall i\in\mathcal{I}^{\text{TSN}}\) 已保留。输入中公式含 LaTeX/glossaries 残留,已按可读公式整理,含义无明显风险。
需要注意的是,与文献 [5] 中的 Cyclic-Synchronous 应用不同,\(T_i^{\text{nc}}\) 的取值已经根据我们的 5G-TSN 实验装置能力进行了调整,并且随之也调整了流约束,以便最初尽可能避免 ICI,从而允许在各个实验之间观察到时延变化。本文工作的目的并不是复现某一种精确的工业配置,而是在同步的 5G-TSN 网络下,分析 5G 时延和抖动与 TAS 之间的相互作用。
Cyclic-Synchronous、ICI、TAS 保留;“potentially avoid ICI at first” 译为“最初尽可能避免 ICI”,存在上下文依赖但逻辑一致。未发现明显问题。
此外,每次实验运行均执行 33 分钟,并丢弃前 3 分钟期间捕获的样本,以确保时钟锁定之后 TSN 设备之间实现稳定同步。该时间间隔使我们能够针对单个 DC 流平均捕获 340,000 个有效样本。
33 分钟、前 3 分钟、340,000 个样本均已保留;“after clock locking” 译为“时钟锁定之后”,术语无明显风险。未发现明显问题。
在我们的实验中,以下配置已应用于测试平台。
“testbed” 译为“测试平台”,符合实验系统语境。未发现明显问题。
流量生成与配置。针对每一种流量流类型,重点如下:
“Traffic flow type” 译为“流量流类型”略显直译,但保留了类型划分含义。未发现明显问题。
• DC 流:在实验 1-3 和实验 5 中,我们使用单个 packETH 实例生成一个 DC 流,其分组大小固定为 \(L_{\text{DC}}=200\) Bytes。尽管 \(T_i^{\text{nc}}\) 处于几十毫秒量级,DC 分组仍每隔 \(750~\mu s\) 生成一次,以防止 MS 处的队列变空,并因此模拟同一传输窗口内的一组突发分组。于是,\(R_{\text{DC}}^{\text{gen}}\propto W_{i,\text{DC}}\)。我们的工作聚焦于 TAS 配置,因此 DC 流没有特定的应用周期,而是由 MS 处队列的开启来施加约束,因此 \(T_{\text{DC}}^{\text{app}}=T_i^{\text{nc}}\)。在实验 4 中,我们使用多个 packETH 实例生成多个 DC 流量流,每个流具有相同的 PCP 值,但具有不同的目的地址,以便在 SL 处将其解聚合到不同输出端口;其中仅测量目标 DC 流的 \(d_{\text{DC}}^{\text{emp}}\)。在该实验中,分组大小已减小到 100 Bytes,目标 DC 流分组的生成速率降低为每 \(100~\mu s\) 一个分组,而背景 DC 被设置为 packETH 的最大比特率以进行交织。• BE 流:分组大小固定为 \(L_{\text{BE}}=1500\) Bytes,并在实验 1-3 中以恒定的 30 Mbps 速率生成。实验 4 没有 BE 流量,以避免干扰 DC 流量;而实验 5 将该速率从 600 Mbps 扫描到 980 Mbps。
本段输入同时包含 DC flow 与 BE flow 两个项目,且后续 P087、P088 又分别重复出现,疑似 PDF/抽取导致的列表重复;但按要求未合并、未省略。所有数字、单位、公式、packETH、PCP、MS、SL 均已保留。由于存在段落抽取重复和列表边界异常,需人工复核。
DC 流:在实验 1-3 和实验 5 中,我们使用单个 packETH 实例生成一个 DC 流,其分组大小固定为 \(L_{\text{DC}}=200\) Bytes。尽管 \(T_i^{\text{nc}}\) 处于几十毫秒量级,DC 分组仍每隔 \(750~\mu s\) 生成一次,以防止 MS 处的队列变空,并因此模拟同一传输窗口内的一组突发分组。于是,\(R_{\text{DC}}^{\text{gen}}\propto W_{i,\text{DC}}\)。我们的工作聚焦于 TAS 配置,因此 DC 流没有特定的应用周期,而是由 MS 处队列的开启来施加约束,因此 \(T_{\text{DC}}^{\text{app}}=T_i^{\text{nc}}\)。在实验 4 中,我们使用多个 packETH 实例生成多个 DC 流量流,每个流具有相同的 PCP 值,但具有不同的目的地址,以便在 SL 处将其解聚合到不同输出端口;其中仅测量目标 DC 流的 \(d_{\text{DC}}^{\text{emp}}\)。在该实验中,分组大小已减小到 100 Bytes,目标 DC 流分组的生成速率降低为每 \(100~\mu s\) 一个分组,而背景 DC 被设置为 packETH 的最大比特率以进行交织。
本段与 P086 中 DC flow 部分重复,疑似输入抽取重复;但作为独立输入段落已完整翻译。100 Bytes、每 100 μs、750 μs、\(R_{\text{DC}}^{\text{gen}}\propto W_{i,\text{DC}}\)、\(T_{\text{DC}}^{\text{app}}=T_i^{\text{nc}}\) 均已保留。由于存在重复抽取风险,需人工复核。
BE 流:分组大小固定为 \(L_{\text{BE}}=1500\) Bytes,并在实验 1-3 中以恒定的 30 Mbps 速率生成。实验 4 没有 BE 流量,以避免干扰 DC 流量;而实验 5 将该速率从 600 Mbps 扫描到 980 Mbps。
本段与 P086 中 BE flow 部分重复,疑似输入抽取重复;30 Mbps、600 Mbps 至 980 Mbps、1500 Bytes 均已保留。由于存在重复抽取风险,需人工复核。
TAS 调度。我们考虑为 DC 流量保留单个传输窗口 \(W_{i,\text{DC}}\),对所有 \(i\in\mathcal{I}^{\text{TSN}}\) 均如此。用于 BE 流量的传输窗口 \(W_{i,\text{BE}}\) 通过从总网络周期时长 \(T_i^{\text{nc}}\) 中减去 DC 传输窗口 \(W_{i,\text{DC}}\)、位于其之前的固定 \(6.26~\mu s\) 保护带 \(T^{\text{GB}}\),以及为单个 PTP 消息保留的 \(160~ns\) 的 \(W_{i,\text{PTP}}\) 而得到。
公式关系按原句顺序保留;6.26 μs、160 ns、PTP、保护带、\(T^{\text{GB}}\) 均已保留。“precedes it” 明确译为“位于其之前”。未发现明显问题。
时延测量。经验时延 \(d_{\text{DC}}^{\text{emp}}\) 和 ZWSL 经验时延 \(\widetilde{d}_{\text{DC}}^{\text{emp}}\) 在 TSN 交换机 MS 和 SL 的输出端口处进行测量,如图 5 所示(绿色点)。分组传输时延使用放置在 TSN 交换机 MS 和 SL 输出端口处的 WR-Z16 时间戳探针进行测量。这些探针提取嵌入在 UDP 载荷前 4 Bytes 中的序列号,并将离开时间戳记录到 CSV 文件中。逐分组时延通过匹配两个交换机处的序列号并计算时间戳差值来获得。所提出的配置实现了可忽略不计的分组丢失。
\(d_{\text{DC}}^{\text{emp}}\)、\(\widetilde{d}_{\text{DC}}^{\text{emp}}\)、ZWSL、WR-Z16、UDP、CSV、MS、SL 均已保留;“negligible packet loss” 译为“可忽略不计的分组丢失”。未发现明显问题。
数据采集。所有实验均按照第 V-B 节所述至少运行 30 分钟,从而生成足够数量的样本,以确保结果在统计上有效。所有数据集和脚本均已公开提供,以促进可复现性。注 1:该代码仓库可通过此链接公开访问。
“1 1 1 The repository...”疑似脚注抽取重复,已按脚注含义处理;30 分钟、Section V-B、datasets/scripts、reproducibility 均已保留。存在链接内容缺失。
这些实验及其配置的概要可见表 II。
表号 Table II 已保留;语义直接,未发现明显问题。
在本节中,我们根据前一节第 V 节中提出的设备和场景,对已执行实验的结果进行分析。
“previous Section V”译为“前一节第 V 节”;equipment 与 scenarios 均已保留。未发现明显问题。
在基于 TAS 的实验之前,我们针对一个开窗 DC 流,对独立 TSN 网络以及其与 5G 集成后的网络之间的时延和抖动进行了经验比较。DC 流分组大小为 200 Bytes,并且两个场景中使用的 TAS 配置为 \(W_{\mathrm{MS},\mathrm{DC}} = 46.5~\mu s\) 和 \(T_{\mathrm{MS}}^{\mathrm{nc}} = 30~ms\)。对于 TSN,我们得到 \(\max\{\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\}=40.53~\mu s\) 和 \(t_{\mathrm{DC}}^{\mathrm{jit}}=29.54~\mu s\)(\(p=1\));而在 5G-TSN 设置中,二者分别上升到 \(\max\{\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\}=18.41~ms\) 和 \(t_{\mathrm{DC}}^{\mathrm{jit}}=10.5~ms\)(\(p=0.999\))。这些结果印证了第 IV-A 节中的观察,并使得对 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 的表征成为无线感知 TAS 调度的关键输入。
数字与单位已保留:200 Bytes、46.5 μs、30 ms、40.53 μs、29.54 μs、18.41 ms、10.5 ms、p=1、p=0.999。原文在 TSN 处使用 \(\widetilde{d}_{DC}^{emp}\),末句使用 \(d_{DC}^{emp}\),已分别保留。公式抽取含有 LaTeX/glossary 噪声,已按可读公式整理。
对于不同传输窗口大小 \(W_{\mathrm{MS},\mathrm{DC}}\),ZWSL 经验时延分布 \(F_{\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}}(\cdot)\) 所得到的 CDF 如图 6 所示。结果表明,增大 \(W_{\mathrm{MS},\mathrm{DC}}\) 会使 CDF 发生适度右移,这表示 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 更高。这是因为 MS 中更大的传输窗口允许在每个网络周期内将更多分组注入 5G 系统。随着更多分组进入 5G 系统,它们在通过无线接口传输之前会在缓冲区中累积,导致排队时延增加,并因此导致更高的 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\),如第 IV-C 节所述。
ZWSL、CDF、\(W_{\mathrm{MS},\mathrm{DC}}\)、\(\widetilde{d}_{DC}^{emp}\)、Fig. 6、Section IV-C 均已保留。因果链“窗口增大-注入更多分组-缓冲累积-排队时延增加”完整。未发现明显问题。
对于所评估的传输窗口,\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 的分布显示平均时延介于 6.39 ms 和 7.21 ms 之间,观测到的最大时延为 \(\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}=18.41~ms\)。第 99.9 百分位略低于 15 ms,因此我们将 5G 时延贡献的上界设置为 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}=15~ms\)。观测到的最小时延为 \(\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}=4.5~ms\)。据此,式(17)中确定性传输的必要条件得到满足:\(T_{\mathrm{MS}}^{\mathrm{nc}}-W_{\mathrm{MS},\mathrm{DC}}\approx 30~ms > t_{\mathrm{DC}}^{\mathrm{jit}}=10.5~ms\)。这些结果与文献 [11] 中的时延结果一致,并且这些边界会在后续实验中予以考虑。
数字 6.39 ms、7.21 ms、18.41 ms、99.9th、15 ms、4.5 ms、30 ms、10.5 ms、[11] 已保留。原文不等式抽取为“30 ms > t...=10.5 ms”,已修正为可读形式。存在原文写“maximum observed delay of \(\max\{t_{DC}^{uni}\}\)”而非 \(\max\{\widetilde{d}\}\),已保留该符号。
尽管有这些结果,但需要注意的是,所获得的时延第 99.9 百分位 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\) 并不是通用值,因为它取决于多个因素,例如 5G 配置、信干噪比(Signal-to-Interference-plus-Noise Ratio, SINR)、业务负载等。对于部署 5G 系统的任何特定场景和条件,都必须对其进行估计。例如,负载的影响在实验 4 和实验 5 中进行了研究。
\(\hat{D}_{DC,0.999}^{emp}\)、99.9 百分位、5G configuration、SINR、traffic load、Experiments 4, 5 均已保留。未发现明显问题。
图 7 使用分组柱状图表示。每个被评估场景对应于一个特定偏移 \(\delta_{\mathrm{DC}}\),该图将 SL 交换机中的传输窗口集合表示为一个或多个柱,每个柱对应于该场景中用于传输任意分组的第 \(n\) 个传输窗口。x 轴枚举被评估的场景,而 y 轴显示在分组由第 \(n\) 个传输窗口传输这一条件下的最小分组传输经验时延 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。此外,每个柱都标注了该情况发生的概率。注意,同一被评估场景内所有柱的概率之和等于 1,因为它们共同覆盖了某一特定偏移配置下所有可能的传输结果。
Fig. 7、grouped bar chart、\(\delta_{DC}\)、SL switch、第 \(n\) 个传输窗口、x/y 轴含义、概率和为 1 的逻辑均已保留。原文“one per the n n-th”有抽取重复,已译为“第 \(n\) 个”。未发现明显问题。
假设如实验 1 所示,式(17)中实现确定性传输所需的必要条件已经满足,则下一个必须满足的基本约束是式(15)中的边界条件,或者等价地,是式(16)中的边界条件。据此,所配置的偏移 \(\delta_{\mathrm{DC}}\) 必须至少等于 ZWSL 经验时延分布的第 99 百分位,该百分位定义了不确定性区间的上界,即 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}=\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\)。对于网络周期偏移 \(\delta_{\mathrm{DC}}'=\delta_{\mathrm{DC}}>\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\)(即大于 15 ms),100% 的分组都在单个传输窗口内传输,这一点由每种情况下只有一个柱得到证明。这些实现对应于图 4 中描绘的场景 1。这表示 \(d_{\mathrm{DC}}^{\mathrm{emp}}\in[\delta_{\mathrm{DC}}-W_{i,\mathrm{DC}},\ \delta_{\mathrm{DC}}+W_{i,\mathrm{DC}}]\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\),因为 \(\delta_{\mathrm{DC}}\) 超过 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\),因而 \(\delta_{\mathrm{DC}}\) 在统计意义上大于 5G 网络的最大时延,从而满足式(10)。由于 \(W_{i,\mathrm{DC}}\) 会相应缩放(见第 V-C 节),因此 \(d_{\mathrm{DC}}^{\mathrm{emp}}=\delta_{\mathrm{DC}}\)。此外,更大的偏移 \(\delta_{\mathrm{DC}}\) 因而会导致更高的时延。
公式与引用 Eq. (17)、Eq. (15)、Eq. (16)、Eq. (10)、Experiment 1、Fig. 4、Scenario 1、Section V-C 均已保留。风险:原文写“99th percentile”但符号为 \(0.999\),与前文 99.9 百分位不一致,可能是原文笔误或抽取问题;已按文字译为“第 99 百分位”并保留 \(0.999\) 符号。另有 \(\hat{D}_{DC,0.999}^{emp}=\max\{t_{DC}^{uni}\}\) 与前文“第 99.9 百分位略低于 15 ms、最大值 18.41 ms”存在潜在逻辑冲突,需核对论文图表上下文。
当 \(\delta_{\mathrm{DC}}'=\delta_{\mathrm{DC}}\leq\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\)(即等于或低于 15 ms)时,并非所有分组都能及时到达并在 SL 的同一网络周期内被调度到传输窗口中,因此它们必须被推迟到下一网络周期中相应的传输窗口。这些实现对应于图 4 中描绘的场景 3。主要后果是,在第二个传输窗口中传输的分组会产生一个约等于 \(T_i^{\mathrm{nc}}\) 的附加时延。因此,经验时延分布变为双峰分布,这意味着一部分分组以偏移了 \(T_i^{\mathrm{nc}}\) 的时延进行传输,即 \(d_{\mathrm{DC}}^{\mathrm{emp}}\in[\delta_{\mathrm{DC}}+T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}},\delta_{\mathrm{DC}}+T_i^{\mathrm{nc}}+W_{i,\mathrm{DC}}]\)。
\(\delta'_{DC}=\delta_{DC}\leq\hat{D}_{DC,0.999}^{emp}\)、15 ms、SL、下一网络周期、Scenario 3、Fig. 4、\(T_i^{nc}\)、双峰分布、区间公式均已保留。未发现明显问题。
实验 1 得到的第 99.9 百分位偏移量设置,即 \(\delta'_{\mathrm{DC}}=\delta_{\mathrm{DC}}=\hat{D}^{\mathrm{emp}}_{\mathrm{DC},0.999}=15\ \mathrm{ms}\),由于 ICI 效应,并不足以在同一个传输窗口内传输所有数据包,因而会增加数据包在第二个网络周期中被传输的概率。
术语 ICI 保留;\(\delta'_{\mathrm{DC}}\)、\(\delta_{\mathrm{DC}}\)、\(\hat{D}^{\mathrm{emp}}_{\mathrm{DC},0.999}\) 与 15 ms 已保留;“second network cycle”译为“第二个网络周期”符合上下文。未发现明显问题。
总之,必须选择偏移量 \(\delta_{\mathrm{DC}}\),使得 ICI 效应不会发生,同时它又不能过大以免增加时延,即 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)。然而,如第 IV-D 节所述,这一更高的偏移量将不可避免地以保证确定性传输为代价而增加时延。
原文 “in exchange of guaranteeing” 语义为“以保证确定性传输为交换/代价”,已保留因果与权衡关系;“unevitably” 应为 “inevitably” 的拼写错误,按语义译为“不可避免地”。未发现明显问题。
图 8 使用了前一个实验中引入的相同分组柱状图表示方式。每个被评估的场景对应于网络周期 \(T_i^{\mathrm{nc}}\) 与传输窗口大小 \(W_{i,\mathrm{DC}}\) 的一个特定组合。所表示的实现对应于图 4 所示的场景 2-4,其中根据前述实验 2,\(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)。其中一些实现呈现出严重的 ICI,因为数据包从 SL 跨多个传输窗口被传输。随着网络周期 \(T_i^{\mathrm{nc}}\) 减小,在目标传输窗口中传输的数据包百分比也会降低。因此,同一突发中数据包可能被传输的传输窗口数量会增加。为清晰起见,某些被评估的网络周期,即 \(T_i^{\mathrm{nc}}\geq 20\ \mathrm{ms}\)、图 4 中的场景 1,未在图 8 中绘出,因为如实验 2 所示,100% 生成的数据包都在单个传输窗口内传输,也就是没有 ICI。
图号、场景编号、\(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)、\(T_i^{\mathrm{nc}}\geq 20\ \mathrm{ms}\) 均已保留;“realizations”按实验结果实例译为“实现”,可能也可译为“实验实现/样本实现”,但不影响技术含义。未发现明显问题。
一方面,在 \(T_i^{\mathrm{nc}}<\delta_{\mathrm{DC}}\) 且 \(T_i^{\mathrm{nc}}<\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的大多数情况下,其传输可能会被拆分到多个网络周期之间。这直接取决于 \(\delta'_{\mathrm{DC}}\),如式 (12) 所述;例如,对于 \(T_i^{\mathrm{nc}}=\{12.5,15\}\ \mathrm{ms}\),分别有 \(\delta'_{\mathrm{DC}}=\{7.5,5\}\ \mathrm{ms}\),其中 \(\delta'_{\mathrm{DC}}>\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}-W_{i,\mathrm{DC}}\)(图 4 中的场景 3)。尽管如此,满足式 (17) 意味着对 \(\delta'_{\mathrm{DC}}\) 的修正可以解决该 ICI,并转入场景 1。对于 \(T_i^{\mathrm{nc}}=\{6,8,10\}\ \mathrm{ms}\) 的情况,式 (17) 的条件不满足,即 \(T_i^{\mathrm{nc}}-W_{i,\mathrm{DC}}<t_{\mathrm{DC}}^{\mathrm{jit}}=10.5\ \mathrm{ms}\)。这意味着 ICI 效应不可避免。此外,鉴于 \(\delta'_{\mathrm{DC}}=\{2,4,0\}\ \mathrm{ms}\),即 \(\delta'_{\mathrm{DC}}<\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}-W_{i,\mathrm{DC}}\),这些实现属于图 4 中的场景 4。由此得到,最小时延等于 \(\delta'_{\mathrm{DC}}+T_i^{\mathrm{nc}}\),因为 \(\delta'_{\mathrm{DC}}\) 不足以在初始传输窗口内完成任何数据包的传输。
保留了所有条件、集合值、式 (12)、式 (17)、场景 3/4 和 \(t_{\mathrm{DC}}^{\mathrm{jit}}=10.5\ \mathrm{ms}\);原文 “It results that” 译为“由此得到”;公式上下文较密集但未见残缺。未发现明显问题。
另一方面,当 \(T_i^{\mathrm{nc}}<\delta_{\mathrm{DC}}\) 且 \(T_i^{\mathrm{nc}}>\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 时,例如 \(T_i^{\mathrm{nc}}=17.5\ \mathrm{ms}\),一个初始传输窗口会在 \(\delta'_{\mathrm{DC}}=2.5\ \mathrm{ms}\) 处打开,这早于原本在 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\) 处调度的传输窗口(图 4 中的场景 2)。虽然如果数据包过早到达,这些提前的传输窗口在理论上可能导致 ICI,但并未观察到这种干扰。这是因为 \(\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}-W_{i,\mathrm{DC}}\geq\delta'_{\mathrm{DC}}\),从而防止任何数据包在其计划传输窗口之前从 SL 被传输。因此,100% 的数据包都在 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\) 处传输,与目标调度一致。
条件 \(T_i^{\mathrm{nc}}<\delta_{\mathrm{DC}}\)、\(T_i^{\mathrm{nc}}>\max\{t_{\mathrm{DC}}^{\mathrm{uni}}\}\) 和数值 17.5、2.5、20 ms 均已保留;“from SL”按原文译为“从 SL 被传输”。未发现明显问题。
作为结论,当式 (17) 不满足时,较短的网络周期 \(T_i^{\mathrm{nc}}\) 可能导致 ICI。此外,那些在 \(\delta'_{\mathrm{DC}}\) 之前于 SL 排队的数据包会承受一个经验时延,使得 \(d_{\mathrm{DC}}^{\mathrm{emp}}<\delta_{\mathrm{DC}}\) 以及 \(d_{\mathrm{DC}}^{\mathrm{emp}}>\delta_{\mathrm{DC}}\)。如第 IV-D 节所述,当考虑 \(d_{\mathrm{DC}}^{\mathrm{emp}}\) 分布时,网络周期偏移 \(\delta'_{\mathrm{DC}}\) 不足,就会发生这种情况。另外,这会对调度在前一网络周期和后一网络周期中的数据包产生 ICI,可能阻止它们满足其约束。因此,\(T_i^{\mathrm{nc}}\geq 17.5\ \mathrm{ms}\)。尽管如此,考虑到唯一的 DC 流类型,实验 4-5 仍保持 \(T_i^{\mathrm{nc}}=T_{\mathrm{DC}}^{\mathrm{app}}=30\ \mathrm{ms}\)。
原文同时写出 \(d_{\mathrm{DC}}^{\mathrm{emp}}<\delta_{\mathrm{DC}}\) 和 \(d_{\mathrm{DC}}^{\mathrm{emp}}>\delta_{\mathrm{DC}}\),看似表达“可能低于或高于偏移量”,但逻辑上不能对同一数据包同时成立;已按原式保留。该处存在潜在表述歧义,建议人工核对上下文。
在本实验中,目标 DC 流和背景 DC 流共享同一个传输窗口。进行了两个场景:一个对应于图 9(a) 所示的结果,其中 SL 处禁用 TAS,用于测量目标 DC 流量的 5G 网络时延;而图 9(b) 展示了 SL 处启用 TAS 的情况。
保留 TAS、SL、DC 与图 9(a)/9(b);“target and background DC flows”译为“目标 DC 流和背景 DC 流”。未发现明显问题。
与实验 1 中给出的结果类似,图 9(a) 显示,随着传输窗口 \(W_{\mathrm{MS},\mathrm{DC}}\) 的持续时间增加,\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 的 CDF 会向右移动。然而,\(W_{\mathrm{MS},\mathrm{DC}}\) 现在显著更大,最高达到 1.75 ms,而实验 1 中仅为几十微秒。因此,观察到显著更高的 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 值。尽管最小时延仍约为 \(\min\{t_{\mathrm{DC}}^{\mathrm{uni}}\}=4.5\ \mathrm{ms}\),但平均时延范围为 10.27 ms 到 17.79 ms。此外,观察到的 \(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\) 最大值超过 23 ms,而最坏情况配置中的第 99.9 百分位为 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}=22\ \mathrm{ms}\)。因此,\(t_{\mathrm{DC}}^{\mathrm{jit}}=17.5\ \mathrm{ms}\),满足式 (17)。这些结果突出了在 5G 下行通信中,存在多个具有相同优先级的并发 DC 流所引入的更高 5G 排队时延和抖动。
CDF、\(\widetilde{d}_{\mathrm{DC}}^{\mathrm{emp}}\)、\(W_{\mathrm{MS},\mathrm{DC}}\)、99.9 百分位、22 ms、23 ms、17.5 ms 均已保留;“few tens of microseconds”译为“几十微秒”。未发现明显问题。
图 9(b) 显示了 SL 处启用 TAS 机制的场景所对应的 CCDF,其中使用实验 2 得到的 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\) 来评估 \(d_{\mathrm{DC}}^{\mathrm{emp}}\)。当 \(W_{i,\mathrm{DC}}\in[0.25,0.75]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 时,对于那些及时到达、能够在 SL 的同一网络周期内被调度进传输窗口的数据包,测得的时延集中在区间 \([\delta_{\mathrm{DC}}-W_{i,\mathrm{DC}},\delta_{\mathrm{DC}}]\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 内。这些低于 \(\delta_{\mathrm{DC}}\) 的时延值出现在以下情况下:MS 处的数据包在传输窗口 \(W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 内的任意时刻被传输,并且由于 SL 输出端口处的数据包解聚合,队列中等待的目标 DC 数据包会在 \(\delta_{\mathrm{DC}}\) 之后被快速传输。虽然在 \(W_{i,\mathrm{DC}}\in[0.25,0.75]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的某些测量值高于 \(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\),但它们不能归因于任何效应,因为它们处在定义的第 99.9 百分位所允许的范围内。尽管如此,当 \(W_{i,\mathrm{DC}}\in[1,1.25]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 时,测得的时延集中在区间 \([\delta_{\mathrm{DC}}-W_{i,\mathrm{DC}},\delta_{\mathrm{DC}}+W_{i,\mathrm{DC}}]\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 内。这发生在数据包晚于那 20 ms 到达、但在 \(W_{\mathrm{SL},\mathrm{DC}}\) 期间发现其门处于打开状态时,并且随着 \(W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 变大,该效应的概率也会增加。这意味着,为了保证某些目标 DC 数据包的确定性传输,必须满足 \(W_{\mathrm{SL},\mathrm{DC}}>N_{\mathrm{DC}}\cdot d_{\varepsilon_{\mathrm{MS},\mathrm{NW\text{-}TT}},\mathrm{DC}}^{\mathrm{tran}}\),其代价是降低带宽,尽管 \(W_{i,\mathrm{DC}}\) 内的一些抖动会扩散到后续 TSN 节点。此外,在更大窗口大小 \(W_{i,\mathrm{DC}}\in[1.5,1.75]\ \mathrm{ms}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的情况下,也就是聚合流量负载更大的情况下,这一效应更加突出;此时数据包开始承受大于 \(\delta_{\mathrm{DC}}+W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\) 的时延,并且并非所有数据包都能及时到达以便在同一网络周期内传输。因此,一些数据包必须在下一个网络周期的传输窗口内传输,产生额外的 \(T_i^{\mathrm{nc}}=30\ \mathrm{ms}\) 时延,即 \(\delta_{\mathrm{DC}}+T_i^{\mathrm{nc}}=50\ \mathrm{ms}\)。这种行为导致 ICI 效应。
段落很长,已保留 CCDF、TAS、SL、MS、NW-TT、所有窗口区间、\(\delta_{\mathrm{DC}}=20\ \mathrm{ms}\)、\(T_i^{\mathrm{nc}}=30\ \mathrm{ms}\)、50 ms 以及不等式 \(W_{\mathrm{SL},\mathrm{DC}}>N_{\mathrm{DC}}\cdot d_{\varepsilon_{\mathrm{MS},\mathrm{NW\text{-}TT}},\mathrm{DC}}^{\mathrm{tran}}\);“packet disaggregation”译为“数据包解聚合”,可能需结合论文术语确认;公式下标较复杂但未见输入残缺。未发现明显问题。
总之,在多个流共享相同优先级的场景中,要在单个传输窗口内传输 DC 流的数据包,解决方案是相应地增加 \(W_{i,\mathrm{DC}}\),\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)。然而,这种方法不可避免地会导致抖动增加,而该抖动可能变得显著,并影响相应工业应用的性能。因此,在 SL 中,应根据新测得的百分位 \(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\) 来设置偏移量 \(\delta_{\mathrm{DC}}\),同时也应重新调整传输窗口 \(W_{\mathrm{SL},\mathrm{DC}}\) 的大小,以便在降低抖动的同时优化带宽。
保留了 \(W_{i,\mathrm{DC}}\)、\(\forall i\in\mathcal{I}^{\mathrm{TSN}}\)、\(\hat{D}_{\mathrm{DC},0.999}^{\mathrm{emp}}\)、\(\delta_{\mathrm{DC}}\)、\(W_{\mathrm{SL},\mathrm{DC}}\);“at the same time jitter is reduced”译为“在降低抖动的同时”。未发现明显问题。
所得到的 \( \widetilde{d}_{\text{DC}}^{\text{emp}} \) 的 CCDF 如图 10 所示,其中可以看到,随着 BE 负载增加,时延明显呈现向更高数值移动的趋势。对于 \(R^{\text{gen}}_{\text{BE}}\in[600,650]\) Mbps 的情况,我们得到的时延行为与实验 1 的情况类似,即 \(\hat{D}_{\text{DC},0.999}^{\text{emp}}\leq 15\) ms,因此我们也可以设置 \(\delta_{\text{DC}}=20\) ms,从而复现图 4 中的场景 1。然而,尽管使用了与实验 1 相同的 TAS 配置,并固定 \(W_{\text{MS},\text{DC}}=46.5\ \mu s\),更高的 BE 负载,例如 \(R^{\text{gen}}_{\text{BE}}\in[700,750]\) Mbps,明显会触发略高于 \(\delta_{\text{DC}}\) 的时延,使得少量数据包无法在下一个网络周期之前完成传输。在这些情况下,偏移量应当重新按比例增大,例如增大到 \(\delta_{\text{DC}}=25\) ms。类似地,\(R^{\text{gen}}_{\text{BE}}=800\) Mbps 已足以使时延增加到超过 50 ms(图 4 中的场景 4)。此外,对于 \(R^{\text{gen}}_{\text{BE}}\in[850,980]\) Mbps,时延大幅增加至 800 ms,这已经相当远离工业约束。这些结果突出表明,在 5G 系统中,DC 流量与 BE 流量之间的隔离能力有限。虽然 \(T^{\text{GB}}\) 可以防止 TAS 域中的冲突(第 III-C 节),但 5G 系统仅通过 5QI 配置提供相对优先级。因此,资源仍然是共享的,并且在高 BE 负载下,由于缓冲区竞争,DC 数据包可能经历增加的排队时延。因此,DC 流的时延和抖动会被 BE 负载显著增大,并且必须再次重新审查偏移量 \(\delta_{\text{DC}}\)。
术语 CCDF、BE、DC、TAS、5QI、\(T^{\text{GB}}\)、\(\delta_{\text{DC}}\)、\(W_{\text{MS},\text{DC}}\) 已保留;数值区间、单位 Mbps、ms、\(\mu s\) 均已保留。原文公式存在 LaTeX 提取噪声,已按可识别形式整理;“until the next network cycle”语义可能涉及“直到下一个网络周期才可传输/在下一个网络周期前未能传输”的边界解释,需结合图 4 和调度上下文确认。
本节回顾关于 5G-TSN 集成的已有工作,并特别关注 TAS 调度。在文献中,TSN 既被作为 5G 网络内部的前传/回传解决方案进行探索,也被用于 5G 网络充当 TSN 网桥的场景。关于后一类情况,我们分析了通过体系结构框架、基于仿真的评估以及实验测试床来处理基于 TAS 的集成的工作。最后,我们将我们的贡献与每个主题下的其他工作进行比较。
术语 5G-TSN、TAS、TSN、前传/回传、TSN 网桥、测试床已准确保留。逻辑层次为“综述范围、两类场景、聚焦后一类、贡献比较”,未发现明显问题。
一些研究工作集中于 5G 前传段,该段涉及基于以太网的低时延传输解决方案。Hisano 等人 [27] 提出了 gate-shrunk TAS,这是一种 TAS 的动态变体,它通过特殊控制数据包调整门状态,以在不降低机器到机器通信时延性能的情况下提高带宽效率。Nakayama 等人 [28] 开发了一种自主 TAS 调度算法,该算法被表述为布尔可满足性问题,并使用基于 FPGA 的求解器进行快速计算,以及在流量变化时对 GCL 进行灵活重配置。Shibata 等人 [29] 提出了名为 iTAS 和 GS-TAS 的自主 TAS 技术,并提出了用于移动前传的自适应压缩,以高效管理低时延且突发性的 IoT 流量,实现确定性时延,并支持 5G 和 IoT 网络中的前传与回传。
gate-shrunk TAS、FPGA、GCL、iTAS、GS-TAS、IoT 等术语和模型名已保留;引用编号 [27]-[29] 未遗漏。句中“autonomous TAS scheduling algorithm”译为“自主 TAS 调度算法”,“boolean satisfiability problem”译为“布尔可满足性问题”,未发现明显问题。
尽管这些研究为确定性低时延前传传输提供了有价值的基于 TAS 的解决方案,但它们不足以确保由 TSN 节点和作为 TSN 网桥接入的 5G 共同组成的网络中的端到端确定性。
E2E 译为“端到端”;“joined as a TSN bridge”按上下文译为“作为 TSN 网桥接入”,可能也可理解为“以 TSN 网桥形式连接”,但不影响主要逻辑。未发现明显问题。
从体系结构角度看,正如 [30] [31] 所讨论的,5G 系统作为 TSN 逻辑交换机运行这一点已经得到充分确认。若干工作将时间同步 [32] 和 5G-TSN QoS 映射 [33] 作为该逻辑交换机模型的关键功能来处理。全面的综述和体系结构框架已经为理解 TAS 在 5G-TSN 网络中的作用奠定了基础。Satka 等人 [34] 提供了一项深入研究,该研究虽然覆盖了 5G-TSN 系统中的同步、时延和安全,但也将 TAS 识别为实现端到端确定性时一个关键但尚未得到充分探索的组成部分。Egger 等人 [25] 强调了 TAS 的确定性假设与无线 5G 链路随机性之间的不兼容性,并主张采用一种新的“无线感知 TSN 工程”范式,以便为未来的 5G 和第六代(6G)系统适配 TAS 机制。Islam [35] 将图神经网络与深度强化学习结合起来,用于增量式联合 TAS 和无线资源调度,说明了 AI 驱动优化在复杂集成网络中的收益。Nazari 等人 [36] 开发了增量式联合调度与路由算法,强调在集中式 TSN 网络配置中进行精确的 TAS 门控控制和路由,以最小化时延和数据包时延变化。
术语 TSN logical switch、QoS mapping、E2E determinism、wireless-aware TSN engineering、6G、graph neural networks、deep reinforcement learning、packet delay variation 已准确处理;引用编号完整。最后一句涉及“centralized TSN network configuration”,译为“集中式 TSN 网络配置”,未发现明显问题。
虽然这些贡献为 5G-TSN 网络中的 TAS 集成提供了有价值的体系结构视角和概念性视角,但它们缺乏经验验证,并且没有专门考察抖动对网络性能的影响。
“empirical validation”译为“经验验证”,也可译为“实证验证”;“jitter”译为“抖动”。逻辑清晰,未发现明显问题。
若干研究依赖仿真来评估和改进 5G-TSN 集成网络中的 TAS 调度、路由和性能。Li 等人 [37] 提出了一种基于冗余调度和优先级调整的容错 TAS 调度算法,以降低复杂度并提高对定时故障的鲁棒性,为 5G-TSN 集成提供了一个可扩展的基线。Wang 等人 [38] 提出了 Balanced and Urgency First Scheduling(B-UFS)启发式算法,以确保周期性时间关键流的确定性端到端时延。该算法针对不确定到达引入了伪循环排队与转发模型、统一资源度量,以及一种在时间和空间上平衡紧迫性与负载的调度策略,从而在整个网络中高效管理资源。Debnath 等人 [33] 提出了 5G TQ,这是一个开源框架,它通过 TSN 到 5G 的 QoS 映射算法实现 5G-TSN 集成。该框架在 5G MAC 层中实现了 QoS 感知优先级调度器,并使用 ns-3 评估无线接入网(RAN)级调度策略,展示了工业流量在时延和可靠性方面的改进。Ginthör 等人 [39] 提出了一种基于约束规划的框架,通过建模特定域约束和统一性能目标来优化 5G-TSN 网络中的端到端流调度。工业拓扑上的仿真表明,与分离的 5G 和 TSN 调度方法相比,该方法提高了可调度性并降低了时延。Chen 等人 [40] 探索了将 5G 用作 TSN 网桥的方式,集成 TAS 以支持跨 TSN 域和 5G 域的时间触发流。该研究提出了一种动态调度机制,为关键服务分配时间片,确保确定性时延和抖动。然而,该研究抽象掉了 5G 的无线特性,仅关注其作为确定性转发网桥的角色,而不是分析无线层变异性。Shih 等人 [41] 提出了一种基于约束满足的 TAS 调度方法,该方法纳入 5G 逻辑网桥的可变驻留时间,以保持端到端确定性。该方法对无线定时不确定性进行建模,并在调度约束中引入鲁棒性裕量,以平衡可调度性和可靠性。Fontalvo-Hernández 等人 [42] 分析了将 5G 流量集成到由 TAS 管控的 TSN 调度中的可行性,重点关注 5G-TSN 边界处的抖动缓解。该研究评估了 3GPP 标准中提出的保持并转发缓冲机制,该机制对 5G 中的数据包驻留时间进行均衡,使流能够与 TAS 调度兼容。通过 OMNeT++ 仿真,该研究量化了缓冲所引入的抖动降低与端到端时延增加之间的权衡。
引用 [37]-[42]、B-UFS、5G TQ、MAC、RAN、ns-3、3GPP、OMNeT++ 等术语和工具名已保留;“pseudo-cyclic queuing and forwarding”译为“伪循环排队与转发”,“hold-and-forward buffering mechanism”译为“保持并转发缓冲机制”。段落较长且涉及多个工作,逻辑关系已逐句对应,未发现明显问题。
虽然这些基于仿真的研究为 TAS 调度和抖动缓解提供了有价值的见解,但它们缺乏用于配置 TAS 以处理 5G 时延变异性的实践指南,并且没有在真实环境中验证其方案。例如,尽管 Fontalvo-Hernández 等人 [42] 提出的面向 TAS 的保持并转发缓冲抖动缓解机制是一种有前景的方法,并且 Debnath 等人 [33] 提出了完整的 5G-TSN 体系结构,但二者都缺乏使用商用 5G 和 TSN 设备进行的验证。我们的工作通过使用功能性测试床,对抖动影响进行实证分析,并为 5G-TSN 网络推导鲁棒 TAS 配置,从而填补了这一空白。
“delay variability”译为“时延变异性”,“commercial 5G and TSN equipment validation”译为“使用商用 5G 和 TSN 设备进行的验证”。原文第二句语法略不完整或存在并列结构不顺,译文已按上下文补足主谓关系;需人工确认是否与作者原意完全一致。
实验验证补充了理论结果和仿真结果,为 5G-TSN 网络中的 TAS 调度提供了实践见解。Jayabal 等人 [43] 设计了一种带有传输门控的无竞争载波侦听多路访问(CSMA)介质访问控制(MAC),以在 5G-TSN 场景中最小化冲突并实现低时延。Agustí-Torra 等人 [44] 旨在于一个仿真的 5G-TSN 测试床中研究体系结构挑战和互操作性方面的问题。Aijaz 等人 [45] 使用商用 TSN 和 5G 设备构建了一个 5G-TSN 测试床,通过 IEEE 802.1Qbv TAS 传输流量。该工作通过在不同流量和网络条件下,在接近产品级的 5G 系统上调度数据包,评估端到端时延和抖动。该分析对 5G 集成对 TAS 性能的影响提供了有用的初步视角,并概述了资源分配策略,不过更深入的探索仍留待未来工作开展。
CSMA、MAC、IEEE 802.1Qbv TAS、E2E、测试床等术语已保留;“contention-free”译为“无竞争”,“near product-grade”译为“接近产品级”。“emulated 5G-TSN testbed”译为“仿真的 5G-TSN 测试床”,可能也可译为“仿真/仿真化测试床”,未发现明显问题。
最近,我们在 [6] 中研究了 5G 网络引入的时延和抖动对集成 5G-TSN 网络中 IEEE 802.1Qbv 调度性能的影响。该研究包括一项基于真实世界测试床的实证分析,该测试床包含支持 IEEE 802.1Qbv 的交换机、TSN 转换器以及一个商用 5G 系统。我们重点评估了 5G 集成如何影响 IEEE 802.1Qbv 调度的确定性行为,开发了一个结合 TSN 和 5G 技术的实验设置,并识别了在 5G-TSN 环境中优化 IEEE 802.1Qbv 性能的关键配置参数。然而,无论是在这项工作中,还是在其他实证工作中,都没有定义确定性通信的条件,也没有评估关键场景。
IEEE 802.1Qbv、5G-TSN、TSN translators、commercial 5G system 等术语已保留;“neither in this nor in other empirical work”译为“无论是在这项工作中,还是在其他实证工作中”,逻辑准确。未发现明显问题。
尽管这些工作也以基于实证测试床、使用真实流量对 5G-TSN 网络进行评估为特征,但它们在范围和深度上有所不同。Agustí-Torra 等人 [44] 侧重于测试床的初步设计和实现,而没有深入评估针对不同 TAS 配置进行组合的可行性。对于 Aijaz 等人 [45],其研究考察了来自单个 TSN 交换机、经过窗口化处理的流量在 5G 系统中的表现,只关注时延性能,而不是评估完整的 TAS 配置。类似地,Jayabal 等人 [43] 旨在增强无线 TSN MAC 协调,而没有集成或刻画真实的 5G 时延行为。相比之下,我们的工作侧重于针对特定 TAS 配置刻画这种时延,以确定下行链路中 TSN 节点之间为了实现确定性运行所需的偏移量。
术语 TAS、TSN、MAC、5G-TSN、downlink 已按领域习惯保留或译为“下行链路”。“enwindowed traffic”译为“经过窗口化处理的流量”,该词较少见,可能需结合全文确认是否指受 TAS 门控窗口约束的流量。“combining for different TAS configurations”原文表达略不顺,译为“针对不同 TAS 配置进行组合的可行性”,存在轻微语义风险。
在本工作中,我们刻画了由 5G 引入的时延和抖动如何影响集成 5G-TSN 网络中 IEEE 802.1Qbv TAS 的协调运行,目标是确定保持确定性传输所需的时序条件。我们将确定性传输视为这样一种场景:同一应用周期的所有数据包在与 5G 段相邻的两个 TSN 交换机处,都在单个传输窗口内被转发,从而确保有界抖动不超过该传输窗口。
IEEE 802.1Qbv TAS、5G-induced delay and jitter、application cycle、transmission window 等术语翻译一致。逻辑上保留了“目标是确定所需时序条件”和“同一应用周期数据包在两个相邻 TSN 交换机均落入单个传输窗口”的定义关系。数字、引用、公式无缺失。未发现明显问题。
为了实现确定性传输,必须在包围 5G 段的 TSN 交换机的网络周期之间引入一个时间偏移量,并且该偏移量应根据 5G 实证时延的高百分位上界来确定。此外,必须满足四个时序约束,以确保来自同一应用周期的所有数据包都被限制在单个传输窗口内。我们还揭示了另一个基本条件:网络周期时长与所配置传输窗口之间的差值必须严格大于 5G 抖动,这确立了 TAS 参数必须如何相对于 5G 时延进行配置,以避免 ICI。这些条件已在商用 5G-TSN 测试床上、在现实设备引入的时延变异性下得到验证。此外,我们的实验表明,多个共享相同优先级的时延关键型流会增加 5G 排队时延和抖动,因此需要更大的偏移量和传输窗口来维持应用周期约束。尽管 TAS 已正确配置,尽力而为流量的存在仍会进一步拓宽 5G 时延分布,这表明必须显式考虑流并发性、流量负载和 5G 排队动态,以保持确定性传输。
“high-percentile bound”译为“高百分位上界”,“strictly larger than”译为“严格大于”,逻辑和不等式含义保留。ICI 未展开,按原文保留缩写。最后一句 “preserve the deterministic transmission” 中定冠词未单独体现,但语义完整。无公式残缺;“四个时序约束”未列出属于原段未展开,不是翻译遗漏。未发现明显问题。
我们的结果要求进一步研究抖动缓解技术,例如保持并转发缓冲机制,以减轻 ICI 效应,并在现实 5G 时延变异性下实现接近满链路利用率。此外,可以通过利用面向 uRLLC 的时延降低特性,进一步提升 5G-TSN 网络的性能,例如配置授权、微时隙调度、5G 网络切片,或即将出现的 6G 系统。我们的发现还推动了自适应算法的设计,这类算法能够基于实时流量负载、实证 5G 时延分布和无线信道条件,动态调整偏移量和 TAS 参数。最后,未来工作可以分析如何在等时流量下保证确定性。
“hold-and-forward buffering mechanism”译为“保持并转发缓冲机制”,可能也可译为“保持-转发缓冲机制”,需按全文术语统一。uRLLC、configured grants、mini-slot scheduling、network slicing 等术语保留准确;“configured grants”译为“配置授权”符合蜂窝通信常见译法。数字、引用、公式无缺失。未发现明显问题。
切换查看英文原文
Industrial Internet of Things (IIoT) enables tightly integrated Cyber-Physical Systems (CPSs), which are critical for manufacturing automation in modern Industry 4.0. These systems demand deterministic, low-latency communication to guarantee safe and predictable operation in dynamic industrial environments [ 1 ]. Among the most demanding IIoT applications are Connected Robotics and Autonomous Systems (CRAS), including Autonomous Mobile Robots (AMRs), drones, and intelligent agents. These systems rely on precise coordination between sensing, computing, and actuation, and are highly sensitive to communication delays and jitter [ 2 ].
To meet these demands, Time-Sensitive Networking (TSN) standards define mechanisms that enable deterministic communication over wired Ethernet infrastructures [ 3 ]. One of the key components of TSN is the IEEE 802.1Qbv Time-Aware Shaper (TAS), which operates at the output ports of TSN switches. TAS enforces scheduled access to the transmission medium by periodically opening and closing gates that control the egress of packets from different traffic queues. By precisely determining when each queue is allowed to transmit, TAS ensures bounded delay and low jitter for selected traffic classes. This deterministic behavior is essential to support time-critical IIoT applications that require guaranteed communication performance [ 4 ]. Nevertheless, TSN ’s reliance on wired infrastructure limits mobility and flexibility, especially in complex industrial settings.
To overcome these limitations, 5th Generation (5G) mobile networks offer mobility, flexibility, wide-area coverage, and ultra-Reliable and Low-Latency Communications (uRLLC) capabilities, which have sparked significant interest in integrating 5G with TSN for industrial scenarios [ 5 ]. In this paradigm, industrial end devices such as robots and production line equipment connect wirelessly to the network via the 5G system. The 5G network provides access to a wired TSN backbone composed of TSN switches connected to edge computing platforms hosting IIoT control functions. This integration aims to combine 5G mobility and coverage with TSN determinism. However, the stochastic nature of 5G, characterized by variable delay in the radio and core segments, disrupts the strict timing required by TAS. This variability challenges the achievement of End-to-End (E2E) deterministic communication.
To address these challenges, TAS configurations must be carefully adapted to maintain synchronized transmissions across TSN switches. In particular, these configurations must compensate for the delay variability introduced by the 5G system while avoiding excessive buffering, added latency, or bandwidth inefficiencies. Ensuring proper alignment of transmission windows is essential to preserve the deterministic guarantees required by time-sensitive IIoT applications.
Literature Review. The 5G - TSN integration has drawn substantial research interest. Prior works have explored architectures where 5G functions as a logical TSN switch and have proposed solutions for time synchronization and Quality of Service (QoS) mapping between domains. Simulation studies have also evaluated TAS scheduling and jitter mitigation; however, these typically rely on idealized wireless models. Although such studies have advanced the understanding of 5G - TSN integration, critical challenges remain in tuning TAS parameters to compensate for realistic 5G delay and jitter dynamics. In particular, there is a lack of experimental validation under commercial 5G conditions. For interested readers, a detailed literature review is provided in Section VII.
Contributions. This article analyzes the impact of 5G -induced delay and jitter on the operation of the IEEE 802.1Qbv TAS in an integrated 5G - TSN network, focusing on the configuration of TAS scheduling parameters to accommodate a delay-critical traffic flow. The main contributions are:
C1 We provide a detailed analysis of the delay components involved in the transmission of packets between adjacent TAS -enabled TSN switches interconnected via a 5G network. This analysis characterizes how 5G -induced delays and jitter interact with TAS parameters, and quantifies their impact on E2E latency performance. C2 Based on this analysis, we identify the conditions under which deterministic communication can be achieved in 5G - TSN networks. We thoroughly investigate the resulting scenarios arising from different TAS parameter configurations and provide general configuration guidelines to ensure deterministic behavior. C3 We implement an experimental testbed integrating a commercial private 5G network and TAS -enabled TSN switches, enabling real-world evaluation of TAS configurations under realistic conditions. The testbed is used to assess the impact of 5G delay and jitter on specific TAS settings under representative network scenarios.
We provide a detailed analysis of the delay components involved in the transmission of packets between adjacent TAS -enabled TSN switches interconnected via a 5G network. This analysis characterizes how 5G -induced delays and jitter interact with TAS parameters, and quantifies their impact on E2E latency performance.
Based on this analysis, we identify the conditions under which deterministic communication can be achieved in 5G - TSN networks. We thoroughly investigate the resulting scenarios arising from different TAS parameter configurations and provide general configuration guidelines to ensure deterministic behavior.
We implement an experimental testbed integrating a commercial private 5G network and TAS -enabled TSN switches, enabling real-world evaluation of TAS configurations under realistic conditions. The testbed is used to assess the impact of 5G delay and jitter on specific TAS settings under representative network scenarios.
This article builds upon our previous conference work [ 6 ], which presented an initial testbed-based study of TAS scheduling in integrated 5G - TSN environments. In this extended version, we provide a more comprehensive theoretical and experimental analysis of the impact of 5G -induced delay and jitter on TAS operation. We identify and characterize critical scenarios arising from different TAS parameter configurations. Furthermore, we derive general configuration guidelines and formally establish the conditions required to guarantee deterministic E2E performance in 5G - TSN networks.
Our results show that guaranteeing bounded latency and jitter requires configuring the TAS transmission window offset between TSN switches based on the maximum observed 5G delay, estimated using a high-percentile delay metric. While increasing this offset helps to absorb delay variability, it also increases E2E latency. Moreover, if the offset becomes excessively large, it may cause misalignment between the transmission windows of TSN switches, thereby violating the deterministic behavior. Additionally, to ensure that packets always arrive within their assigned transmission windows, the TAS cycle period should be greater than the sum of the peak-to-peak jitter introduced by 5G and the transmission window duration. Finally, we see how additional traffic flows with the same priority may also increase 5G delay and jitter. Similarly, if the 5G network lacks proper isolation between traffic types, flows with lower priority can contribute to latency and jitter degradation. Such cases require recalculating TAS parameters.
Paper Outline. The paper is organized as follows: Section II covers background on industrial 5G - TSN networks and TAS. Section III presents the system model. Section IV analyzes 5G delay and jitter impact on TAS. Section V describes the testbed and the experimental setup. Section VI reports performance results. Section VII reviews related work. Section VIII outlines the key conclusions and future work.
This section overviews 5G - TSN networks in Industry 4.0. First, we introduce the main network segments and key characteristics of industrial applications. Then, we discuss QoS traffic management and the TAS mechanism. Finally, we highlight time synchronization for deterministic communications.
As depicted in Fig. 1, three connectivity segments are defined in a 5G - TSN -based industrial network [ 5 ]:
• Edge/Cloud Room: Centralizes management tasks handled by the Manufacturing Execution System (MES), such as monitoring, data collection, and analytics. Control functions are traditionally performed by Programmable Logic Controllers (PLCs), which may run on dedicated hardware or general-purpose servers, i.e., virtualized PLCs (vPLCs). This layer may also include a network device that provides the TSN Grand Master (GM) clock reference, typically derived from Global Navigation Satellite System (GNSS) [ 7 ], for distribution across the network. • 5G System: According to 3rd Generation Partnership Project (3GPP) TS 23.501 (v19.0.0) [ 8 ], the 5G system integrates into the TSN network as one or more virtual TSN switches, with the User Plane Functions (UPFs) and User Equipments (UEs) acting as endpoints. The UE connects wirelessly to the next generation Node B (gNB). The TSN Translators, specifically the Network-side Translator (NW-TT) located in the UPF and the Device-side Translator (DS-TT) in the UE, support the integration between the TSN and 5G domains by adapting traffic formats and QoS information, and enabling the transport of synchronization information. • Production Lines: Each includes Field Devices (FDs) such as sensors and actuators, along with local PLCs for distributed control. FDs report operational data to centralized PLCs, enabling hierarchical decision-making. Each production line connects to a TSN Slave (SL) switch that receives clock signals from the TSN Master (MS) switch via the 5G system and redistributes synchronization to the FDs within this production line.
Edge/Cloud Room: Centralizes management tasks handled by the Manufacturing Execution System (MES), such as monitoring, data collection, and analytics. Control functions are traditionally performed by Programmable Logic Controllers (PLCs), which may run on dedicated hardware or general-purpose servers, i.e., virtualized PLCs (vPLCs). This layer may also include a network device that provides the TSN Grand Master (GM) clock reference, typically derived from Global Navigation Satellite System (GNSS) [ 7 ], for distribution across the network.
5G System: According to 3rd Generation Partnership Project (3GPP) TS 23.501 (v19.0.0) [ 8 ], the 5G system integrates into the TSN network as one or more virtual TSN switches, with the User Plane Functions (UPFs) and User Equipments (UEs) acting as endpoints. The UE connects wirelessly to the next generation Node B (gNB). The TSN Translators, specifically the Network-side Translator (NW-TT) located in the UPF and the Device-side Translator (DS-TT) in the UE, support the integration between the TSN and 5G domains by adapting traffic formats and QoS information, and enabling the transport of synchronization information.
Production Lines: Each includes Field Devices (FDs) such as sensors and actuators, along with local PLCs for distributed control. FDs report operational data to centralized PLCs, enabling hierarchical decision-making. Each production line connects to a TSN Slave (SL) switch that receives clock signals from the TSN Master (MS) switch via the 5G system and redistributes synchronization to the FDs within this production line.
Industrial network traffic is predominantly delay-sensitive, with E2E latency requirements ranging from hundreds of microseconds to few tens of milliseconds [ 9 ]. Although other traffic types exist, such as network control, mobile robotics, and video streams, TAS can be applied to Cyclic-Synchronous applications, which require highly predictable timing to ensure reliable communications [ 5, 10 ].
The Cyclic-Synchronous applications consist of periodic communication between devices operating on independent cycles, with synchronization enforced at intermediate network nodes rather than end devices. Each device samples and updates at its own rate, allowing for bounded jitter and some timing variation. Although the E2E packet transmission delay must remain within predictable bounds, occasional variation is tolerated. Thereby, jitter is constrained to the latency bound [ 10 ]. This traffic is commonly used in controller-to-I/O exchanges, periodic sensor polling, and updates to supervisory systems. Examples include PLC -to-actuator response commands, graphic updates to Supervisory Control and Data Acquisition (SCADA) systems, and routine diagnostic or historian data transfers.
In addition, another category of time-sensitive industrial applications coexists with Cyclic-Synchronous: the Isochronous. Although both of them require strict delay and jitter analysis in 5G - TSN networks, our work addresses general Cyclic-Synchronous applications and evaluates the feasibility of their scheduling, as the stringent requirements of Isochronous applications cannot currently be met, which significantly exceed the latency capabilities of existing 5G deployments [ 11 ].
Traffic prioritization in TSN networks relies on the 3-bit Priority Code Point (PCP) field defined in IEEE 802.1Q Virtual Local Area Network (VLAN) tags, allowing up to eight priority levels [ 3 ]. These levels enable differentiation according to QoS requirements: higher values (i.e., PCP 4–7) are typically assigned to critical traffic, while lower ones (i.e., PCP 0–3) serve less time-sensitive or best-effort data [ 5 ].
In 5G networks, QoS is managed for each flow by a QoS Flow ID (QFI) and associated with a standardized 5G QoS Identifier (5QI), as specified in 3GPP TS 23.501 [ 8 ]. Each 5QI defines key performance characteristics such as priority level, delay tolerance, and packet error rate, which determine the treatment of traffic throughout the 5G system [ 12 ].
While TSN enforces QoS through PCP -based prioritization, 5G employs 5QI -driven flow control to differentiate traffic. The mapping between TSN traffic classes and 5G QoS flows remains an active research topic, primarily due to the semantic differences between the PCP -based prioritization in TSN and the 5QI -based framework in 5G. As shown in [ 9 ], a feasible approach involves classifying Ethernet frames based on their PCP field at the UE and UPF, using packet filters to associate them with appropriate 5G QoS flows.
IEEE 802.1Qbv is a TSN standard that specifies the TAS mechanism, which enables time-aware scheduling of Layer 2 frames at the egress ports of TSN switches based on QoS requirements [ 13, 14, 15 ]. TAS utilizes the PCP field in the IEEE 802.1Q header to classify packets into one of eight First-In First-Out (FIFO) queues. At each egress port, these queues are prioritized to ensure that higher-priority traffic is transmitted before lower-priority traffic.
Each egress port is controlled by a Gate Control List (GCL), which defines a time-triggered transmission schedule divided into transmission windows governed by the clock reference. During each transmission window, one or more queues are permitted to transmit, depending on the binary state of their associated gates. Each queue has its own gate, and the GCL specifies the time intervals during which each gate is open or closed. When multiple gates are open, transmission order typically follows queue priority, although exact behavior may depend on the switch implementation.
TAS scheduling is organized around periodic network cycles that enable deterministic communication. A network cycle consists of a fixed-duration time interval which encompasses a full instance of a specific set of transmission windows defined by the GCL [ 16 ]. The duration of the network cycle is typically chosen to align with the application cycles involved, which are defined as the periods at which message exchanges occur. This alignment is commonly achieved by selecting the network cycle duration as the greatest common divisor of the involved application cycles. For more information on TAS see [ 4 ].
Time synchronization is essential in 5G - TSN networks to support the deterministic requirements of IIoT applications. In typical TSN architectures, a TSN MS switch distributes the GM clock via Precision Time Protocol (PTP) or generalized Precision Time Protocol (gPTP) messages to multiple TSN SL switches, each deployed along a different production line, as defined in Section II-A. Upon receiving these messages, each TSN SL switch estimates the time difference between its local clock and the reference clock of the TSN MS switch, known as the clock offset, and adjusts its local time accordingly [ 17 ].
According to the architecture defined in 3GPP TS 23.501 [ 8 ], TSN translators, specifically the NW-TT and DS-TT, enable propagation of the GM clock across the 5G system to the TSN domain, thus maintaining clock consistency across TSN switches interconnected via 5G (see Fig. 1). A widely adopted configuration for propagating synchronization over 5G is the Transparent Clock (TC) mode defined in IEEE 1588 [ 18, 19, 20 ], where synchronization messages are forwarded with the correctionField updated to reflect the residence time within each intermediate node, while original timestamps remain unchanged. Unlike Boundary Clock (BC) mode, where each node terminates and regenerates synchronization messages, TC mode preserves a single timing domain by accumulating residence times [ 21 ]. The NW-TT and DS-TT measure the residence time within the 5G system and include this delay in the forwarded messages with the correctionField. This operation complies with IEEE 1588-2019 and enables accurate clock correction at the TSN endpoint. For more information see [ 17, 21, 18, 20, 19 ].
Discrepancies in the clocks of different devices within the 5G - TSN network may occur, preventing the devices from updating their clocks accurately. The 3GPP TS 22.104 [ 22 ] specifies that a maximum clock drift contribution of 900 ns must be guaranteed for 5G systems to enable time-critical industrial applications. In line with this, the work in [ 20 ] empirically quantizes a maximum peak-to-peak synchronization error of 500 ns, which is significantly below the requirement.
This section introduces the network and traffic models. We then describe the TAS model, followed by a description of the different sources of latency in the system. Table I provides a summary of key mathematical notations used throughout the paper.
Notation Conventions. We use calligraphic letters (e.g., 𝒳 \mathcal{X}) to denote sets. Lowercase letters (e.g., y y) represent random variables, while uppercase letters (e.g., Y Y) denote constant parameters. Binary variables are typeset in uppercase sans serif font (e.g., 𝖷 \mathsf{X}). Subscripts indicate that a parameter applies to specific elements of a given set; for example, z i, j z_{i,j} refers to the parameter z z corresponding to elements i ∈ ℐ i\in\mathcal{I} and j ∈ 𝒥 j\in\mathcal{J}. Superscripts provide descriptive annotations, e.g., z desc z^{\text{desc}} denotes the variable z z with descriptor ”desc”. In addition, f x (⋅) f_{x}(\cdot) and F x (⋅) F_{x}(\cdot) denote the Probability Density Function (PDF) and Cumulative Distribution Function (CDF) of the random variable x x, respectively. Finally, the letter Z ^ \hat{Z} denotes the statistical upper bound of F x (⋅) F_{x}(\cdot).
We consider a set of network nodes denoted by ℐ \mathcal{I}, comprising: (i) two TSN switches, denoted as master switch MS and slave switch SL, respectively; (ii) two TSN translators, one being a network-side translator and denoted as NW-TT and the other being the device-side translator and denoted as DS-TT; (iii) a 5G UE denoted as UE; and (iv) a 5G gNB and an UPF, denoted by gNB and UPF, respectively. Each communication link is represented by ε \varepsilon, and the set of all such links is denoted by ℰ \mathcal{E}. A specific link between nodes i i and j j is denoted by ε i, j ∈ ℰ \varepsilon_{i,j}\in\mathcal{E}, where i, j ∈ ℐ i,j\in\mathcal{I}. The topology is defined by the sequential links: ℰ ≡ { ε MS, NW-TT, ε NW-TT, UPF, ε UPF, gNB, ε gNB, UE, ε UE, DS-TT, ε DS-TT, SL } \mathcal{E}\equiv\{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}},\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}},\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}},\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}},\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}},\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}\}. We define the subset of nodes corresponding to the 5G system as ℐ 5G ≡ { UE, gNB, UPF, NW-TT, DS-TT } \mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}\equiv\{\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}},\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}},\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}},\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}},\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}}\}. Similarly, the virtual 5G system link set ℰ 5G ⊂ ℰ \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}\subset\mathcal{E} contains the subset of physical links that connect the nodes of the 5G system, i.e., ℰ 5G ≡ { ε NW-TT, UPF, ε UPF, gNB, ε gNB, UE, ε UE, DS-TT } \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}\equiv\{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}},\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UPF}{{{}}UPF}},\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB}},\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}},\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT}}}\}. Finally, we define the subset of TSN switches as ℐ TSN ⊂ ℐ \mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\subset\mathcal{I}, i.e., ℐ TSN ≡ { MS, SL } \mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\equiv\{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}\}, which are interconnected via the 5G system with the link set ℰ TSN ⊂ ℰ \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\subset\mathcal{E}, containing the subset of physical links to the 5G bridge bounds NW-TT and DS-TT, i.e., ℰ TSN ≡ { ε MS, NW-TT, ε DS-TT, SL } \mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}\equiv\{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}}},\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{DS-TT}{{{}}DS-TT},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}\}, respectively.
Let 𝒮 \mathcal{S} denote the set of traffic flows traversing the considered 5G - TSN network. Specifically, 𝒮 \mathcal{S} includes:
• A downlink Delay-Critical (DC) flow generated by a Cyclic-Synchronous application, as described in Section II-B. We assume a DC flow in downlink as a set of packets sharing a source at the Edge/Cloud Room, e.g., a PLC, and any of the devices in the same production line as the destination, e.g., actuators, which are typically served by a common switch, i.e., the SL switch. Each application cycle, of periodic duration T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, the PLC generates a batch of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets of constant size L DC L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, resulting in an average data rate R DC gen = N DC ⋅ L DC / T DC app R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}~=~N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\cdot~L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}/T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, as a response delivered to all these actuators after processing the production state [ 23 ]. Additionally, packets must traverse the 5G - TSN network subject to an E2E delay constraint d DC E2E ≤ D DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}}~\leq~D_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Assuming these packets belong to a single application, they share the same timing constraints between them. • A downlink Best-Effort (BE) flow composed of packets that do not require strict timing guarantees. We assume packets of constant size L BE L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} are generated at a constant data rate R BE gen R_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}^{\text{gen}}. • Uplink and downlink PTP flows are considered to support clock synchronization among TSN switches. The exchange of these messages, as defined by the PTP standard, occurs periodically, with an application cycle T PTP app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}} significantly larger than T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, i.e., T PTP app ≫ T DC app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}\gg T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}.
A downlink Delay-Critical (DC) flow generated by a Cyclic-Synchronous application, as described in Section II-B. We assume a DC flow in downlink as a set of packets sharing a source at the Edge/Cloud Room, e.g., a PLC, and any of the devices in the same production line as the destination, e.g., actuators, which are typically served by a common switch, i.e., the SL switch. Each application cycle, of periodic duration T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, the PLC generates a batch of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets of constant size L DC L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, resulting in an average data rate R DC gen = N DC ⋅ L DC / T DC app R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}~=~N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\cdot~L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}/T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, as a response delivered to all these actuators after processing the production state [ 23 ]. Additionally, packets must traverse the 5G - TSN network subject to an E2E delay constraint d DC E2E ≤ D DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}}~\leq~D_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Assuming these packets belong to a single application, they share the same timing constraints between them.
A downlink Best-Effort (BE) flow composed of packets that do not require strict timing guarantees. We assume packets of constant size L BE L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} are generated at a constant data rate R BE gen R_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}^{\text{gen}}.
Uplink and downlink PTP flows are considered to support clock synchronization among TSN switches. The exchange of these messages, as defined by the PTP standard, occurs periodically, with an application cycle T PTP app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}} significantly larger than T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, i.e., T PTP app ≫ T DC app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}\gg T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}.
PTP flows are assigned the highest priority, followed by DC and then BE flows, consistently across both the 5G and TSN domains. Accordingly, PTP and DC packets are assigned higher PCP values for TSN scheduling, and they are mapped to 5G QoS flows with lower 5QI indices, indicating stricter QoS treatment. BE packets are mapped to the lowest priority class with higher 5QI index.
At each TSN switch i ∈ ℐ TSN i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, each egress port is associated with a set 𝒬 i \mathcal{Q}_{i} containing up to eight output queues. We assume a one-to-one mapping between each queue q ∈ 𝒬 i q\in\mathcal{Q}_{i} and a traffic flow s ∈ 𝒮 s\in\mathcal{S}, allowing interchangeability of q q and s s throughout this paper. Furthermore, we assume the GCL enforces mutually exclusive gate openings among the eight queues per egress port, guaranteeing that only one queue is permitted to transmit at any given instant.
Accordingly, the GCL configuration for queue q ∈ 𝒬 i q\in\mathcal{Q}_{i} at switch i ∈ ℐ TSN i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} is formally expressed by Eq. (1). The binary variable 𝖦 i, q (t) \mathsf{G}_{i,q}(t) indicates whether the gate is open (1) or closed (0). The gates operate periodically with period T i nc T_{i}^{\text{nc}}, referred to as the network cycle. In the network cycle n = 0 n=0, the gate opening and closing instants, T i, q open T_{i,q}^{\text{open}} and T i, q closed T_{i,q}^{\text{closed}}, define the transmission window duration W i, q = T i, q closed − T i, q open W_{i,q}=T_{i,q}^{\text{closed}}-T_{i,q}^{\text{open}}. 𝖦 i, q (t) = { 1, n T i nc + T i, q open < t ≤ n T i nc + T i, q closed, ∀ n ∈ ℕ ∪ { 0 }. 0, otherwise. \mathsf{G}_{i,q}(t)=\begin{cases}1,&nT_{i}^{\text{nc}}+T_{i,q}^{\text{open}}<t\leq nT_{i}^{\text{nc}}+T_{i,q}^{\text{closed}},\\ &\;\forall n\in\mathbb{N}\cup\{0\}.\\ 0,&\text{otherwise}.\end{cases} (1)
The DC flow period T DC app T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}} typically ranges from several hundreds of microseconds up to a few tens of milliseconds, whereas PTP synchronization messages are generated approximately every T PTP app ≈ 1 s T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}\approx 1\,\text{s}. Given that condition T PTP app ≫ T DC app T_{\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}^{\text{app}}~\gg~T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, we consider the duration of the network cycle, T i nc = T DC app T_{i}^{\text{nc}}=T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}, ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, as the DC flow is the primary target of this work.
Each network cycle comprises three non-overlapping transmission windows (see Fig. 2): W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} for the DC traffic, W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} for PTP synchronization messages and W i, BE W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} for BE traffic, followed by a fixed guard band T GB T^{\text{GB}} to avoid interference on DC traffic. Thus, T i nc = W i, DC + W i, PTP + W i, BE + T GB T_{i}^{\text{nc}}~=~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~+~W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}~+~W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}~+~T^{\text{GB}}, ∀ i ∈ ℐ TSN \forall~i~\in~\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. We consider W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} occupies a negligible fraction of T i nc T_{i}^{\text{nc}}, 100 to 1000 times smaller, due to the low frequency of synchronization messages, i.e., W i, PTP ≪ W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}\ll W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and W i, PTP ≪ W i, BE W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}}\ll W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}. Due to this and for ease of reading, W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} is omitted in subsequent equations, while it is implicitly assumed to be scheduled immediately after W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. For further details on PTP planning, see [ 21 ].
Finally, at the MS, each batch of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets belonging to the DC flow is assumed to be available at the start of every network cycle.
For each packet of flow s ∈ 𝒮 s\in\mathcal{S} traversing node i ∈ ℐ i\in\mathcal{I}, the total delay comprises five components: input queuing delay, processing delay, output queuing delay, transmission delay, and propagation delay. These can be seen in Fig. 3.
The input queuing delay d i, s que,in d_{i,s}^{\text{que,in}} is the interval between the arrival of a packet at node i i and the start of its processing. The processing delay d i, s proc d_{i,s}^{\text{proc}} corresponds to the time required by node i i to parse the packet header and determine the forwarding action. The output queuing delay d i, s que,out d_{i,s}^{\text{que,out}} refers to the delay from the end of processing at node i i until the packet is transmitted to the next hop.
The transmission delay d ε i, j, s tran d_{\varepsilon_{i,j},s}^{\text{tran}} corresponds to the time needed to serialize all bits of the packet over the link ε i, j ∈ ℰ \varepsilon_{i,j}\in\mathcal{E}. It depends on the packet size L s L_{s} and the link capacity r ε i, j r_{\varepsilon_{i,j}}, and is given by d ε i, j, s tran = L s / r ε i, j d_{\varepsilon_{i,j},s}^{\text{tran}}=L_{s}/r_{\varepsilon_{i,j}}. The propagation delay D ε i, j prop D_{\varepsilon_{i,j}}^{\text{prop}} is the time a signal takes to travel through link ε i, j ∈ ℰ \varepsilon_{i,j}\in\mathcal{E} and is assumed to be constant for any flow s ∈ 𝒮 s\in\mathcal{S} in that link in time.
In this section, we analyze how 5G impacts TAS scheduling performance. First, we define the E2E delay for a packet of an arbitrary flow and study how the 5G delay component impacts it. Then, we formalize the constraint for the transmission window of the DC flow in TSN switches. Next, we introduce the concept of offset between the network cycles of the MS and SL switches, and derive the conditions required to ensure deterministic communication. Finally, we analyze how this offset interacts with the 5G delay component, and evaluate how different TAS parameter configurations influence the scheduling performance across various scenarios.
The set of flows 𝒮 \mathcal{S} traverses a sequence of network nodes to reach their destination, as illustrated in Fig. 3. The E2E packet transmission delay d s E2E d_{s}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}} for the flow s ∈ 𝒮 s\in\mathcal{S} along this path is computed as the sum of delays at each network node plus the transmission delays on each link: d s E2E = ∑ i ∈ ℐ (d i, s que,in + d i, s proc + d i, s que,out) + ∑ e ∈ ℰ (d e, s tran + D e prop). d_{s}^{\text{\lx@glossaries@gls@link{acronym}{E2E}{{{}}E2E}}}\hskip-1.42271pt=\hskip-2.84544pt\sum_{i\in\mathcal{I}}\left(d_{i,s}^{\text{que,in}}\hskip-2.84544pt+\hskip-1.42271ptd_{i,s}^{\text{proc}}\hskip-1.42271pt+\hskip-1.42271ptd_{i,s}^{\text{que,out}}\right)\hskip-1.42271pt+\sum_{e\in\mathcal{E}}\left(d_{e,s}^{\text{tran}}\hskip-2.84544pt+\hskip-1.42271ptD_{e}^{\text{prop}}\right). (2) The 5G delay d s 5G d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}} is defined as the sum of node processing and queuing delays, plus link transmission in the 5G domain: d s 5G = ∑ j ∈ ℐ 5G (d j, s que,in + d j, s proc + d j, s que,out) + ∑ k ∈ ℰ 5G (d k, s tran + D k prop). d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}=\hskip-1.42271pt\sum_{j\in\mathcal{I^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}}}\hskip-2.84544pt\left(d_{j,s}^{\text{que,in}}\hskip-1.42271pt+\hskip-1.42271ptd_{j,s}^{\text{proc}}\hskip-1.42271pt+\hskip-1.42271ptd_{j,s}^{\text{que,out}}\right)\hskip-0.85355pt+\hskip-2.84544pt\sum_{k\in\mathcal{E^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}}}\hskip-2.84544pt\left(d_{k,s}^{\text{tran}}\hskip-1.42271pt+\hskip-1.42271ptD_{k}^{\text{prop}}\right). (3) To assess the impact of 5G in combination with the TAS scheduling, we consider the packet delay between the MS and SL output ports, d s MS, SL d_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}, and compute it as follows: d s MS, SL = ∑ ε ⊂ ℰ TSN (d ε, s tran + D ε prop) + d s 5G + d SL, s que,in + d SL proc + d SL, s que,out. d_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}=\hskip-2.84544pt\sum_{\varepsilon\subset\mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}\hskip-5.69046pt\left(d_{\varepsilon,s}^{\text{tran}}\hskip 0.0pt+\hskip-1.42271ptD_{\varepsilon}^{\text{prop}}\hskip-2.84544pt\hskip 2.84544pt\right)+d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,in}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}^{\text{proc}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,out}}\hskip-1.42271pt. (4) For convenience, we also consider the packet delay between the MS output port and the SL switch processing, d ~ s MS, SL \widetilde{d}_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}, that is, excluding the SL output queuing delay, d SL, s que,out d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,out}}, as it is influenced by the TAS configuration: d ~ s MS, SL = ∑ ε ⊂ ℰ TSN (d ε, s tran + D ε prop) + d s 5G + d SL, s que,in + d SL proc. \widetilde{d}_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}=\sum_{\varepsilon\subset\mathcal{E}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}\left(d_{\varepsilon,s}^{\text{tran}}\hskip-1.42271pt+D_{\varepsilon}^{\text{prop}}\right)+d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},s}^{\text{que,in}}+d_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}^{\text{proc}}\hskip-1.42271pt. (5) In this work, we rely on empirical delay measurements for our analysis. Therefore, our model has to consider the synchronization error that inherently affects the delay measurement between separate TSN nodes, i.e., Δ i, j \Delta_{i,j}, ∀ i, j ∈ ℐ TSN \forall i,j\in\mathcal{I^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}. Hence, the empirical measurement of the packet delay between the MS and the SL output ports, d s emp d_{s}^{\text{emp}}, could be expressed as in Eq. (6), where Δ MS, SL \Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}} refers to the synchronization error between MS and SL. d s emp = d s MS, SL + Δ MS, SL. d_{s}^{\text{emp}}=d_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}+\Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}. (6) The value of Δ MS, SL \Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}} is assumed to take positive or negative values, as clocks may be ahead or behind each other at any instant. A higher | Δ MS, SL | |\Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}| may cause the measurements to become unreliable, as it distorts the temporal correspondence between events. In this way, the E2E latency from Eq. (2) is also affected by the synchronization error. Thus, its empirical measurements can be written as d s E2Emp d_{s}^{\text{E2Emp}} in Eq. (7). d s E2Emp = d MS, s que,in + d MS proc + d MS, s que,out + d s emp. d_{s}^{\text{E2Emp}}=d_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},s}^{\text{que,in}}+d_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{proc}}+d_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},s}^{\text{que,out}}+d_{s}^{\text{emp}}. (7) Similarly, the empirical measurement of the packet delay between the MS output port and the SL switch processing, from now on Zero-Wait-at-SL (ZWSL) empirical delay, d ~ s emp \widetilde{d}_{s}^{\text{emp}}, could be expressed as in Eq. (8). d ~ s emp = d ~ s MS, SL + Δ MS, SL. \widetilde{d}_{s}^{\text{emp}}=\widetilde{d}_{s}^{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}+\Delta_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}. (8) Observation –. The 5G system delay, d s 5G d_{s}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}, is significantly larger than the transmission delays over wired links, d ε i, j, s tran d_{\varepsilon_{i,j},s}^{\text{tran}}, ∀ ε i, j ∈ ℰ \forall\varepsilon_{i,j}\in\mathcal{E} \ { ε gNB, UE } \{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{gNB}{{{}}gNB},\lx@glossaries@gls@link{acronym}{UE}{{{}}UE}}}\}, ∀ i, j ∈ ℐ \forall i,j\in\mathcal{I}; the propagation delays, D ε i, j prop D_{\varepsilon_{i,j}}^{\text{prop}}, ∀ ε i, j ∈ ℰ \forall\varepsilon_{i,j}\in\mathcal{E}, ∀ i, j ∈ ℐ \forall i,j\in\mathcal{I}; and processing delays in the TSN switches, d i, s proc, ∀ i ∈ ℐ TSN d_{i,s}^{\text{proc}},\forall i\in\mathcal{I^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}}. On the one hand, transmission delays over wired links are typically within the microsecond range. For example, a 200 Bytes packet, assuming 42 Bytes of overhead, has a transmission delay of 1.9 μ \mu s in 1 Gbps links. Similarly, processing delays in TSN switches are typically also in the microsecond range [ 24 ]. On the other hand, 5G system delay is in the range from milliseconds to a few tens of milliseconds [ 11 ]. This delay and jitter dominance will be corroborated experimentally in Section VI.
As a consequence of this observation, the 5G system delay, and its associated jitter, play a prominent role in Eq. (4)-(8), and therefore in the TAS configuration of the TSN switches. Since our analysis targets the DC flow, the formulation presented from this point onward assumes s = DC s=\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}.
The transmission window duration W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} for flow DC ∈ 𝒮 \text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}\in\mathcal{S} at TSN switch i ∈ ℐ TSN i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} must satisfy two conditions: it must be strictly shorter than the network cycle T i nc T_{i}^{\text{nc}} and equal or greater than the cumulative transmission time of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets through the output port. These constraints are formalized in Eq. (9), where j ∈ ℐ j\in\mathcal{I} is the next network node after switch i i. N DC ⋅ d ε i, j, DC tran ≤ W i, DC < T i nc. N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\cdot d_{\varepsilon_{i,j},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{tran}}\;\leq W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}<T_{i}^{\text{nc}}. (9) Violating these bounds can lead to performance degradation. If W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is too short, not all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets can be transmitted within a single network cycle. The remaining packets accumulate and are deferred to subsequent network cycles, introducing additional delays that are multiples of T i nc T_{i}^{\text{nc}}. On the other hand, if W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} exceeds the network cycle duration, it monopolizes the schedule, preventing other flows s ∈ 𝒮 ∖ { DC } s\in\mathcal{S}\setminus\{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}\} from being scheduled during that network cycle.
We consider identical TAS scheduling configurations at both MS and SL switches, i.e., T MS nc = T SL nc T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}=T_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}}}^{\text{nc}} and W MS, DC = W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Under this assumption, let us define the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} as the time difference between the start of the network cycle at the MS and SL. This offset must be configured to ensure all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets, generated within a single application cycle, arrive at the output queue of the SL and are transmitted through its egress port before the corresponding transmission window closes.
Since all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets are sent as a burst from the MS into the 5G system, it is essential to characterize the delay experienced by these packets in the 5G system to establish a value for the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Assuming that the 5G system capacity is generally lower than the capacity of a wired link [ 11 ], the 5G segment constitutes a bottleneck in the 5G - TSN network, where packets experience increasing queuing delays. The first packet in the burst, if no retransmission is required, may traverse the 5G network with minimal delay, i.e., min (d DC 5G) \min(d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}), while each subsequent packet must wait for the transmission of the previous packets. Consequently, delay accumulates across the burst, such that the last packet tends to experience the highest latency, i.e., max (d DC 5G) \max(d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{\lx@glossaries@gls@link{acronym}{5G}{{{}}5G}}}), which already includes the cumulative queuing delay of the entire burst. Consequently, the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be set to at least max (d ~ DC emp) \text{max}(\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}) to guarantee the availability of packets at the SL output port queue to be transmitted on time. This leads to the condition in Eq. (10). δ DC ≥ max (d ~ DC emp). \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\text{max}(\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}). (10) Since d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} is random by nature, it is necessary to characterize its behavior statistically. In this work, we define a statistical upper bound based on a given percentile p ∈ [ 0, 1) p\in[0,1) of the CDF F d ~ DC emp (⋅) F_{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}}(\cdot) of the ZWSL empirical delay. Specifically, we denote this bound as D ^ DC, p emp = F d ~ DC emp − 1 (p) \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}}=F_{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}}^{-1}(p), which corresponds to the p -th p\text{-th} percentile of the delay distribution. A higher value of p p increases the confidence d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} will remain below D ^ DC, p emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}} [ 25 ]. For instance, setting p = 0.999 p=0.999 yields an upper bound such that 99.9% of packets experience delays below this value. Accordingly, we set the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} as in Eq. (11), ensuring that at least p ⋅ 100 p\cdot 100 % of packets have been queued before the transmission window in the SL closes. δ DC ≥ D ^ DC,p emp. \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC},p}}^{\text{emp}}. (11) An additional parameter of interest is the time instant at which an initial transmission window opens at the SL for transmitting packets of the DC flow. We denote this instant as the network cycle offset δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, formally defined as follows: δ DC ′ = { δ DC, if δ DC < T i nc. δ DC mod T i nc, otherwise. \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\begin{cases}\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},&\text{if }\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}<T_{i}^{\text{nc}}.\\ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\bmod T_{i}^{\text{nc}},&\text{otherwise}.\end{cases} (12) The network cycle offset δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime} depends on the configured offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and the network cycle duration T i nc T_{i}^{\text{nc}}. When δ DC < T i nc \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~<~T_{i}^{\text{nc}}, it holds that δ DC ′ = δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}~=~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the transmission window opens exactly at the configured offset. Conversely, if δ DC ≥ T i nc \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\geq~T_{i}^{\text{nc}}, the initial transmission opportunity may occur before the configured offset, and the effective opening time is given by δ DC ′ = δ DC mod T i nc ∈ [ 0, T i nc) \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\bmod T_{i}^{\text{nc}}\in[0,T_{i}^{\text{nc}}).
We consider deterministic transmission as the scenario in which the entire burst of N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets in the same transmission window of a given network cycle at the MS are delivered and forwarded within a single transmission window at the SL switch. In this case, the E2E jitter remains bounded by the window size W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, thus enabling predictable communication.
To determine if a deterministic transmission is possible, it is essential to examine the relationship between the 5G -induced delay and jitter and the following TAS parameters: (i) the network cycle offset δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, (ii) the network cycle duration T i nc T_{i}^{\text{nc}}, and (iii) the size of the transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}.
Let us define the uncertainty interval t DC uni t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}} as the range of possible delays a packet from DC flow may experience when traversing the 5G - TSN network: t DC uni = [ min (d ~ DC emp), D ^ DC, p emp ]. t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}=\left[\min(\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}),\ \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}}\right]. (13) This interval is bounded by the minimum and maximum values of the per-packet d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. Note that we consider the p -th p\text{-th} percentile of the ZWSL empirical delay distribution as the maximum value of the uncertainty interval. Accordingly, we define the induced jitter of the 5G - TSN network, t DC jit t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}, as the difference between the limits of the uncertainty interval: t DC jit = max (t DC uni) − min (t DC uni). t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}). (14) To guarantee a deterministic transmission, two timing conditions must be satisfied between MS and SL:
First Condition for Determinism: To ensure this one-to-one correspondence between the transmission windows at MS and SL, the start time of the transmission window at the SL switch, i.e., δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, must satisfy the two boundary conditions valid for any network cycle in Eq. (15) or, alternatively, those in Eq. (16). C1: max (t DC uni) ≤ δ DC ′, C2: δ DC ′ + W i, DC ≤ min (t DC uni) + T i nc. \begin{split}&\text{C1: }\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)\leq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\\ &\text{C2: }\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)+T_{i}^{\text{nc}}.\end{split} (15) The condition C1 indicates that the transmission window at the SL switch must start only after the last packet of the burst transmitted by the MS switch has arrived in the current network cycle, ensuring that all those packets are already available when the window opens. The condition C2 requires that the transmission window must close before the first packet served in a subsequent network cycle at the MS switch arrives at the SL switch in the next network cycle. C3: max (t DC uni) ≤ δ DC ′ + T i nc, C4: δ DC ′ + W i, DC ≤ min (t DC uni). \begin{split}&\text{C3: }\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)\leq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}},\\ &\text{C4: }\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right).\end{split} (16) The condition C3 stipulates that the transmission window at the SL switch can start only after the last packet of the burst transmitted by the MS switch has arrived in the previous network cycle. The condition C4 designates that the transmission window must close before the first packet served in a subsequent network cycle at the MS switch arrives at the SL switch in the current network cycle.
Either Eq. (15) or Eq. (16) ensures that all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets can be forwarded within a single transmission window. Otherwise, the burst will necessarily be split across multiple transmission windows, violating the determinism requirement. We call this effect Inter-Cycle Interference (ICI), where the packets scheduled in a network cycle may interfere with the ones scheduled in the next network cycle.
As max (t DC uni) = D ^ DC, p emp \max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)=\ \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}}, in Eq. (15) and Eq. (16) the transmission window forwarding all N DC N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} packets at the SL switch is lower bounded by the p -th p\text{-th} percentile of the delay distribution of the ZWSL empirical delay, d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}, and hence by the p -th p\text{-th} percentile of 5G system delay distribution. As a relevant consequence, the packet empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} may increase in exchange for achieving deterministic transmission according to the p -th p\text{-th} percentile and the network cycle duration.
Second Condition for Determinism: Directly comparing the upper and lower bounds for δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} isolated on one side of each of the inequalities, either in Eq. (15) or Eq. (16), leads to the additional condition in Eq. (17), which relates how the TAS parameters must be configured with respect to the 5G jitter to guarantee deterministic transmission. T i nc − W i, DC ≥ t DC jit. T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}. (17)
Eq. (17) imposes a second fundamental condition on the interplay between the TAS configuration and the statistical behavior of the 5G system. It establishes that the 5G -induced jitter imposes a lower bound on the network cycle T i nc T_{i}^{\text{nc}}. Additionally, increasing the transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} not only requires larger network cycle T i nc T_{i}^{\text{nc}} as Eq. (17) shows, but it will also indirectly increase t DC jit t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}} due to the cumulative queuing effect on packets in the 5G system. Furthermore, Eq. (17) also imposes a limit on the link utilization for DC traffic, as additional transmission windows of DC traffic in the network cycle period would cause ICI and break the determinism.
The conditions derived above provide a foundation for deterministic transmission. In the following subsection, we perform a detailed analysis of these conditions under different parameter configurations, identifying scenarios in which determinism is either achieved or violated to later be experimentally demonstrated in Section VI.
The analysis of the impact of the empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}, largely dominated by the 5G system, on the coordinated operation of TAS mechanism in both the MS and SL switches is illustrated in Fig. 4, which shows the timing of data transmissions through the egress ports of the MS and SL switches interconnected via a 5G system. Each timeline is structured into consecutive network cycles, each of which contains a single transmission window allocated to the DC flow. The figure considers four distinct scenarios based on the relative timing between the transmission windows at the SL and the uncertainty interval t DC uni t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}} in Eq. (13). These scenarios are defined by specific conditions on the network parameters T i nc T_{i}^{\text{nc}}, W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the configured offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, which implicitly determines δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime} according to Eq. (12).
Scenario 1: Deterministic transmission with early arrival. min (t DC uni) + T i nc − W i, DC ≥ δ DC ′ ≥ max (t DC uni). \min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})+T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}). (18) From the previous conditions C1 and C2 in Eq. (15), the lower bound δ DC ′ ≥ max (t DC uni) \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right), and the upper bound, δ DC ′ ≤ min (t DC uni) + T i nc − W i, DC \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)+T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, can be yielded for δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} in Eq. (18). With this, all packets from a given network cycle arrive at the SL before the initial transmission window opens. As a result, they can be transmitted entirely within that transmission window. This configuration ensures deterministic behavior in the 5G - TSN network, with packet jitter bounded by the duration of the transmission window, W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}.
Scenario 2: Deterministic transmission with unused initial transmission window. min (t DC uni) − W i, DC ≥ δ DC ′ ≥ max (t DC uni) − T i nc. \begin{split}\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-T_{i}^{\text{nc}}.\end{split} (19) Now, from conditions C3 and C4 in Eq. (16), the lower bound δ DC ′ ≥ max (t DC uni) − T i nc \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\max\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)-T_{i}^{\text{nc}}, and the upper bound, δ DC ′ ≤ min (t DC uni) − W i, DC \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right)-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, can be yielded for δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} in Eq. (19). No packets arrive before the initial transmission window at SL closes, which therefore remains unused. However, all packets are available before the second transmission window opens, allowing their complete transmission. This results in higher minimum and maximum packet transmission delays compared to Scenario 1, increased by the waiting in the queue until the next network cycle. Nevertheless, the transmission remains deterministic, with bounded jitter.
Scenario 3: Non-deterministic transmission with partial packet arrival. max (t DC uni) ≥ δ DC ′ ≥ min (t DC uni) − W i, DC. \max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})\geq\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\geq\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. (20) Some packets arrive in time to be transmitted during the initial transmission window at the SL, while others must wait for the second transmission window. This results in ICI, as defined in Section IV-D. Consequently, jitter increases to at least one full network cycle, thereby affecting packets scheduled in the next network cycle, and determinism is lost in the 5G - TSN network.
Scenario 4: Non-deterministic transmission with delayed arrival. δ DC ′ ≤ min { min (t DC uni) − W i, DC, max (t DC uni) − T i nc }. \begin{split}\delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\min\left\{\min(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\right.\left.\max(t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}})-T_{i}^{\text{nc}}\right\}.\end{split} (21) This configuration represents the most adverse condition for the 5G - TSN network because Eq. (17) is not met. This means ICI is unavoidable. In this case, the second or subsequent transmission windows at SL may close before all packets have arrived, so some packets may be transmitted in the next network cycle, leading to the highest delays and jitter among all scenarios. We reflect the case where ICI is extended to a third transmission window due to the accumulation of packets at the SL ’s buffer between network cycles.
In this section, we describe the implemented 5G - TSN testbed and the considered experimental setup.
To carry out our empirical analysis, we implemented the testbed depicted in Fig. 5. Its components are described below.
5G System. The 5G network comprises a single gNB and a 5G core, both implemented on a PC with a 50 MHz PCIe Amarisoft Software Defined Radio (SDR) cards and an AMARI NW 600 license. The gNB operates in the n78 band with 30 kHz subcarrier spacing and a bandwidth of 50 MHz. Data transmission uses a Time Division Duplex (TDD) scheme with a pattern of four consecutive downlink slots, four uplink slots, and two flexible slots. Although our analysis focuses solely on downlink traffic, this configuration reserves resources for uplink, enabling a realistic testbed environment [ 26 ]. Two UEs are deployed, each consisting of a Quectel RM500Q-GL modem connected via USB to an Intel NUC 10 (i7-10710U, 16 GB RAM, 512 GB SSD) running Ubuntu 22.04. Experiments are conducted using one LABIFIX Faraday cage, with gNB antennas connected to the SDR via SMA connectors. Finally, although it is common to assign one DS-TT per UE [ 5 ], this proof of concept simplifies the setup by using a single DS-TT for both UEs. Similarly, we use a single NW-TT for simplicity’s sake.
TSN Network. The TSN network is built using Safran’s WR-Z16 switches. One switch operates as the MS, another as the SL, and two additional switches act as TSN translators, i.e., NW-TT and DS-TT. The MS is directly connected to a Safran SecureSync 2400 server, which provides the GM clock to the SL for time synchronization. Since the 5G system operates in PTP TC mode (implemented in TSN translators [ 20 ]), an auxiliary WR-Z16 switch, also synchronized via a second SecureSync 2400, is used to distribute the 5G GM clock between the TSN translators. Each WR-Z16 switch is based on a Xilinx Zynq-7000 FPGA and a 1 GHz dual-core ARM Cortex-A9, enabling high switching rates and low processing delays under a Linux-based OS. The switches support IEEE 802.1Qbv TAS and VLANs, and include sixteen 1GbE Small Form-factor Pluggable (SFP) timing ports configurable as PTP MS or SL. Each egress port provides four priority hardware queues to separate the different traffic flows, with a maximum buffer size of 6.6 kB per queue. This limits the number of PCPs from 0 to 3, and also imposes a constraint on sustained throughput, as exceeding the draining capacity leads to packet drops. Additionally, timestamping probes on each port enables high-precision latency measurements between the output ports of the TSN nodes.
Testbed Clock Synchronization. Time synchronization between the TSN GM clock server and the MS is established via coaxial cables carrying two signals: a Pulse Per Second (PPS) pulse for absolute phase alignment and a 10 MHz reference for frequency synchronization through oscillator disciplining. Similarly, the auxiliary WR-Z16 switch is synchronized with the 5G GM clock server using the same coaxial interface, enabling accurate time distribution between the NW-TT and DS-TT to enable the TC mode [ 20 ]. In the testbed, the MS and SL communicate PTP packets over IPv4 using unicast User Datagram Protocol (UDP) and the E2E delay measurement mechanism. The PTP transmission rate is configured to 1 packet per second.
End Devices and Testbed Connections. Two Ubuntu 22.04 LTS servers operate as packet generator with packETH tool and sink, respectively. All components in the testbed are interconnected using 1 Gbps optical fiber links, except for the connections between the NW-TT - gNB, and DS-TT - UEs, which use 1 Gbps RJ-45 Ethernet cables.
Network Traffic. At the 5G core network, two distinct Data Network Names (DNNs) are configured to create separate network slices for industrial traffic management. One carries both PTP and DC flows, while the other handles BE flow, enabling differentiated routing and resource allocation. The 5G network employs IP transport because the considered UE operates without Ethernet-based sessions. To support Layer 2 industrial automation traffic over IP, a Virtual Extensible LAN (VxLAN) -based tunneling mechanism is implemented [ 9 ], with two VxLANs configured accordingly: one transporting DC and PTP flows, and the other BE flow. Packets are tagged with PCP values reflecting the relative priority among the flows: PCP 3 for packets of the PTP flow, PCP 2 for DC flow packets, and PCP 0 for BE flow packets. Additionally, within the 5G network, 5QI values are assigned per flow’s packets, with 80 for PTP and DC traffic, and 9 for BE traffic.
We evaluate the packet transmission delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} for the DC flow across five experimental scenarios. Each scenario analyzes a specific TAS configuration parameter to evaluate its effect on the TSN system’s ability to tolerate 5G -induced delay.
Experiment 1: Delay Analysis of 5G Network. We analyze the effect of varying the traffic generation rate R DC gen R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}} on the delay and jitter of the 5G network to determine D ^ DC, p emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},p}^{\text{emp}} and, with it, the uncertainty interval t DC uni t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}. For that, we sweep R DC gen R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}} in 300 kbps increments from 350 kbps to 1.55 Mbps. For each R DC gen R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}, the transmission window W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is calculated based on the lower bound defined in Eq. (9), ensuring compliance with the WR-Z16’s buffer size limitation. This results in transmission windows at MS ranging from 10.5 μ \mu s to 46.5 μ \mu s. TAS is enabled at the MS, while at SL the output queue gate remains open 100% of the time. This is done this way to estimate the ZWSL empirical delay, d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. The network cycle is fixed at T MS nc = 30 T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}=30 ms.
Experiment 2: Delay Analysis based on Offset between transmission windows of MS and SL Switches. We analyze the effect on d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} of different temporal shifts between network cycles at MS and SL. TAS is similarly configured at both switches, with fixed transmission window W i, DC = 46.5 μ W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=46.5~\mu s and network cycle T i nc = 30 T_{i}^{\text{nc}}=30 ms, ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. We sweep offset δ DC = { 5, 10, 15, 20, 25, 30 } \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=\{5,10,15,20,25,30\} ms.
Experiment 3: Delay Analysis Based on Network Cycle. We study the influence of the network cycle on d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} with a constant δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} to analyze the scenarios described in Section IV-E. The network cycle is varied in the range of T i nc = { 6, 8, 10, 12.5, 15, 17.5, 20, 22.5 } T_{i}^{\text{nc}}=\{6,8,10,12.5,15,17.5,20,22.5\} ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. Transmission windows are set to W i, DC = { 9, 12, 15, 18, 22.5, 25.5, 30, 33 } W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~=~\{9,12,15,18,22.5,25.5,30,33\} μ \mu s, ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, respectively, to keep the injected data rate into the 5G - TSN network constant at 1.55 Mbps.
Experiment 4: Delay Analysis considering Multiple Traffic flows with Same-Priority. We evaluate the packet transmission delay when multiple distinct flows share the same priority output queue. Firstly, TAS is enabled exclusively at the MS, while at the SL, the output queue gate remains open 100% of the time, as in Experiment 1 to obtain d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. The network cycle is fixed at T i nc = 30 ms T_{i}^{\text{nc}}=30~\text{ms} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and, to accommodate all the flows, transmission windows are set to W MS, DC = { 0.25, 0.5, 0.75, 1, 1.25, 1.5, 1.75 } W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=\{0.25,0.5,0.75,1,1.25,1.5,1.75\} ms, forwarding from 1 to 7 aggregated DC flows at source each and analyzing the delay distribution for one of them. Then, we also configure TAS at SL so that W MS, DC = W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} to characterize d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. The offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is constant according to previous experiments.
Experiment 5: Delay Analysis Based on BE Traffic Load. We sweep the BE packet generation rates R BE gen = R_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}^{\text{gen}}= {600, 650, 700, 750, 800, 850, 900, 950, 980} Mbps to analyze how the BE load affects the DC traffic d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} distribution. The network cycle is fixed to T i nc = 30 ms T_{i}^{\text{nc}}=30~\text{ms} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and the transmission window is set only at MS, with W MS, DC = W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 46.5 μ \mu s.
Note the T i nc T_{i}^{\text{nc}} values, unlike the Cyclic-Synchronous applications in [ 5 ], have been adapted to the capabilities of our 5G - TSN experimental setup and, with it, the flow constraints to potentially avoid ICI at first and thus allow observable delay variation across experiments. The purpose of this work is not to replicate an exact industrial configuration but to analyze the interaction between 5G delay and jitter and TAS under a synchronized 5G - TSN network.
Additionally, each run of the experiments has been executed for 33 minutes, discarding the samples captured during the first 3 minutes to ensure stable synchronization between TSN devices after clock locking. This time interval allows us to capture an average of 340,000 valid samples for a single DC flow.
In our experiments, the following configurations have been applied to the testbed.
Traffic Generation and Configuration. Focusing on each traffic flow type:
• DC flow: In Experiments 1-3 and 5, we use a single instance of packETH to generate a DC flow with packet size fixed at L DC = 200 L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=200 Bytes. Despite T i nc T_{i}^{\text{nc}} being in the order of tens of milliseconds, DC packets are generated every 750 μ \mu s to prevent the queue at MS from emptying and therefore emulate a burst of packets within the same transmission window. Then, R DC gen ∝ W i, DC R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}\propto W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Our work focuses on TAS configurations so that DC flow has no particular application period, but is imposed by the opening of the queue at MS, thus T DC app = T i nc T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}=T_{i}^{\text{nc}}. In Experiment 4, we use multiple instances of packETH to generate multiple DC traffic flows, each with the same PCP value but different destination addresses for the disaggregation at SL to different output ports, measuring d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} for just the target DC flow. In this experiment, the packet size has been reduced to 100 Bytes and the generation rate of the target DC flow’s packets is lessened to one packet every 100 μ s 100~\mu s, while the background DC is set to packETH ’s maximum bitrate for interlacing. • BE flow: The packet size is fixed at L BE = 1500 L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}=1500 Bytes and generated at a constant rate of 30 Mbps for the Experiments 1-3. Experiment 4 has no BE traffic to avoid interference with DC traffic while Experiment 5 sweeps this rate from 600 Mbps to 980 Mbps.
DC flow: In Experiments 1-3 and 5, we use a single instance of packETH to generate a DC flow with packet size fixed at L DC = 200 L_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=200 Bytes. Despite T i nc T_{i}^{\text{nc}} being in the order of tens of milliseconds, DC packets are generated every 750 μ \mu s to prevent the queue at MS from emptying and therefore emulate a burst of packets within the same transmission window. Then, R DC gen ∝ W i, DC R_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{gen}}\propto W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Our work focuses on TAS configurations so that DC flow has no particular application period, but is imposed by the opening of the queue at MS, thus T DC app = T i nc T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}=T_{i}^{\text{nc}}. In Experiment 4, we use multiple instances of packETH to generate multiple DC traffic flows, each with the same PCP value but different destination addresses for the disaggregation at SL to different output ports, measuring d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} for just the target DC flow. In this experiment, the packet size has been reduced to 100 Bytes and the generation rate of the target DC flow’s packets is lessened to one packet every 100 μ s 100~\mu s, while the background DC is set to packETH ’s maximum bitrate for interlacing.
BE flow: The packet size is fixed at L BE = 1500 L_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}=1500 Bytes and generated at a constant rate of 30 Mbps for the Experiments 1-3. Experiment 4 has no BE traffic to avoid interference with DC traffic while Experiment 5 sweeps this rate from 600 Mbps to 980 Mbps.
TAS scheduling. We consider a single transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} reserved for DC traffic. The transmission window W i, BE W_{i,\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}} for BE traffic is obtained by subtracting the DC transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, the fixed 6.26 μ \mu s guard band T GB T^{\text{GB}} that precedes it, and the 160 ns W i, PTP W_{i,\text{\lx@glossaries@gls@link{acronym}{PTP}{{{}}PTP}}} reserved for a single PTP message, from the total network cycle duration, T i nc T_{i}^{\text{nc}}.
Delay Measurement. The empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} and the ZWSL empirical delay d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} are measured at the output ports of the TSN switches MS and SL, as shown in Fig. 5 (green dots). Packet transmission delay is measured using WR-Z16 timestamp probes placed at the output ports of the TSN switches MS and SL. These probes extract the sequence number, which is embedded in the first 4 Bytes of the UDP payload, and log the departure timestamp to CSV files. Per-packet latency is calculated by matching sequence numbers from both switches and computing the timestamp difference. The proposed configuration achieves negligible packet loss.
Data Capture. All experiments were run for at least 30 minutes as described in Section V-B, generating a sufficient number of samples to ensure statistically valid results. All datasets and scripts are made publicly available to foster reproducibility 1 1 1 The repository is publicly accessible at this link..
A summary of these experiments and their configurations can be found in Table II.
In this section, we analyze the results of the performed experiments according to the equipment and the scenarios raised within the previous Section V.
Prior to TAS -based experiments, we conducted an empirical comparison of latency and jitter between a standalone TSN network and its integration with 5G for a windowed DC flow. The size of the DC flow packets is 200 Bytes, and the TAS configuration used in both scenarios is W MS, DC = 46.5 W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~=~46.5 μ \mu s and T MS nc = T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}= 30 ms. While for TSN we obtained that max { d ~ DC emp } = 40.53 \max\{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\}=~40.53 μ \mu s and t DC jit = 29.54 t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=~29.54 μ \mu s (p = p= 1), in the 5G - TSN setup both rose to max { d ~ DC emp } = 18.41 \max\{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\}=~18.41 ms and t DC jit = 10.5 t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=~10.5 ms (p = p= 0.999). These results corroborate the observation in Section IV-A and make the characterization of d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} a key input to the wireless-aware TAS scheduling.
The resulting CDFs of the ZWSL empirical delay distribution, F d ~ DC emp (⋅) F_{\widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}}(\cdot), for the different transmission window sizes W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} are presented in Fig. 6. The results show that increasing W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} causes a moderate rightward shift in the CDF, indicating higher d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}. This is because a larger transmission window in the MS allows more packets to be injected into the 5G system during each network cycle. As more packets enter the 5G system, they accumulate in the buffer before transmission over the radio interface, leading to increased queuing delays and consequently higher d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}, as stated in Section IV-C.
For the evaluated transmission windows, the distributions of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} show average delays between 6.39 ms and 7.21 ms, with a maximum observed delay of max { t DC uni } = 18.41 \max\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}~=~18.41 ms. The 99.9th percentile is just below 15 ms, so we set the upper bound for the 5G delay contribution as D ^ DC, 0.999 emp = 15 ms \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}=~15~\text{ms}. The observed minimum delay is min { t DC uni } = 4.5 \min\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}=4.5 ms. With this, the necessary condition for deterministic transmission in Eq. (17) is satisfied: T MS nc − W MS, DC ≈ 30 T_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}}}^{\text{nc}}-W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\approx 30 ms > t DC jit = 10.5 >t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=10.5 ms. These results are aligned with the latency results in [ 11 ] and bounds are considered in subsequent experiments.
Despite these results, it is important to note that the obtained 99.9th percentile of the delay, D ^ DC, 0.999 emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}, is not universal, as it depends on multiple factors such as the 5G configuration, the Signal-to-Interference-plus-Noise Ratio (SINR), the traffic load, etc. It must be estimated for any particular scenario and conditions where the 5G system is deployed. For example, the influence of the load is studied in the Experiments 4, 5.
Fig. 7 uses a grouped bar chart representation. Each evaluated scenario corresponds to a specific offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the plot represents the set of transmission windows in the SL switch as one or more bars, one per the n n -th transmission window used for transmitting an arbitrary packet in that scenario. The x-axis enumerates the evaluated scenarios, while the y-axis shows the minimum packet-transmission empirical delay d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} conditioned on the packet being transmitted in the n n -th transmission window. Furthermore, each bar is labeled with the probability that this case occurs. Note that the sum of the probabilities of all bars within the same evaluated scenario equals one, since they collectively cover all possible transmission outcomes for a specific offset configuration.
Assuming that the necessary condition for achieving a deterministic transmission in Eq. (17) is met, as seen in Experiment 1, the next fundamental constraint to be satisfied is the boundary conditions in Eq. (15) or, alternatively, in Eq. (16). With this, the configured offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be at least the 99th percentile of the ZWSL empirical delay distribution that defines the upper bound of the uncertainty interval, this is D ^ DC, 0.999 emp = max { t DC uni } \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}=\max\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}. For network cycle offset δ DC ′ = δ DC > D ^ DC, 0.999 emp \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}>\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} (i.e., greater than 15 ms), 100% of packets are transmitted within a single transmission window, as evidenced by a single bar per case. These realizations correspond to the Scenario 1 depicted in Fig. 4. This indicates d DC emp ∈ [ δ DC − W i, DC, δ DC + W i, DC ] d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\in[\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}] ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} since δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} exceeds D ^ DC, 0.999 emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} and thus δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is statistically greater than the maximum delay of the 5G network, satisfying Eq. (10). As W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is scaled accordingly (see Section V-C), d DC emp = δ DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Additionally, larger offsets δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} thus lead to higher latencies.
When δ DC ′ = δ DC ≤ D ^ DC, 0.999 emp \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\leq\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} (i.e., equal or lower than 15 ms) not all packets arrive in time to be scheduled within the transmission window in the same network cycle at SL and must therefore be deferred to the corresponding transmission window of the next network cycle. These realizations correspond to the Scenario 3 depicted in Fig. 4. The main consequence is that packets transmitted in the second transmission window incur an additional delay approximately equal to T i nc T_{i}^{\text{nc}}. As a result, the empirical delay distribution becomes bimodal, meaning that a subset of packets are transmitted with a delay shifted by T i nc T_{i}^{\text{nc}}, i.e., d DC emp ∈ [ δ DC + T i nc − W i, DC, δ DC + T i nc + W i, DC ] d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}\in[\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}].
The setting of the 99.9th percentile offset obtained from Experiment 1, i.e., δ DC ′ = δ DC = D ^ DC, 0.999 emp = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~=~{\hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp }}}= 15 ms, is not enough to transmit all packets within the same transmission window due to the ICI effect, increasing then the probability of being transmitted in a second network cycle.
In conclusion, the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be elected so that ICI effect does not occur and, at the same time, it is not excessively large to increase latencies, i.e., δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 20 ms. However, as stated in Section IV-D, this higher offset will unevitably increase the latency in exchange of guaranteeing the deterministic transmissions.
Fig. 8 uses the same grouped bar chart representation introduced in the previous experiment. Each evaluated scenario corresponds to a specific combination of the network cycle T i nc T_{i}^{\text{nc}} and the transmission window size W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. The represented realizations correspond to the Scenarios 2-4, illustrated in Fig. 4, where δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms according to previous Experiment 2. Some present severe ICI as packets are transmitted from SL across multiple transmission windows. As the network cycle T i nc T_{i}^{\text{nc}} decreases, the percentage of packets transmitted in the target transmission window also decreases. Consequently, the number of transmission windows where packets of the same burst can be transmitted increases. For clarity, some evaluated network cycles (i.e., T i nc ≥ 20 T_{i}^{\text{nc}}\geq 20 ms, Scenario 1 in Fig. 4) are not depicted in the Fig. 8 due to 100% of generated packets being transmitted within a single transmission window, i.e., with no ICI, as seen in Experiment 2.
On the one hand, most of the cases where T i nc < δ DC T_{i}^{\text{nc}}~<~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and T i nc < max { t DC uni } T_{i}^{\text{nc}}<\max\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} may see their transmissions split between network cycles. This depends directly on δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, as described in Eq. (12), e.g., δ DC ′ = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}= {7.5, 5} ms for T i nc = { 12.5, 15 } T_{i}^{\text{nc}}=\{12.5,~15\} ms, respectively, where δ DC ′ > min { t DC uni } − W i, DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}~>~\min\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\}~-~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} (Scenario 3 in Fig. 4). Nevertheless, the compliance with Eq. (17) implies that a δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} correction may solve this ICI and move on to Scenario 1. For the cases where T i nc = T_{i}^{\text{nc}}= {6, 8, 10} ms, the condition of Eq. (17) is not met, i.e., T i nc − W i, DC < t DC jit = 10.5 T_{i}^{\text{nc}}~-~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~<~t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}=10.5 ms. This means that ICI effect is unavoidable. Moreover, given that δ DC ′ = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}= {2, 4, 0} ms, i.e., δ DC ′ < min { t DC uni } − W i, DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}<\min\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, these realizations fall under the Scenario 4 in Fig. 4. It results that minimum latency is equal to δ DC ′ + T i nc \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}+T_{i}^{\text{nc}} as δ DC ′ \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime} is not enough to accomplish the transmission of any packet within the initial transmission window.
On the other hand, when T i nc < δ DC T_{i}^{\text{nc}}<\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and T i nc > max { t DC uni } T_{i}^{\text{nc}}>\max\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, e.g., T i nc = 17.5 T_{i}^{\text{nc}}=17.5 ms, an initial transmission window opens at δ DC ′ = 2.5 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}=2.5 ms, which is earlier than the transmission window originally scheduled at δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms (Scenario 2 in Fig. 4). While these early transmission windows may theoretically lead to ICI if packets arrive prematurely, no such interference was observed. This is due to min { t DC uni } − W i, DC ≥ δ DC ′ \min\left\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\right\}~-~W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\geq~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\prime}, preventing any packet from being transmitted from SL before its planned transmission window. As a result, 100% of the packets are transmitted at δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms, consistent with the target scheduling.
To conclude, shorter network cycles T i nc T_{i}^{\text{nc}} may lead to ICI when the Eq. (17) is not met. Furthermore, those packets queued at SL before δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} suffer an empirical delay so that d DC emp < δ DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}<\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} and d DC emp > δ DC d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}}>\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. This occurs when the network cycle offset δ DC ′ \delta^{\prime}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is not enough, taking into account the d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} distribution, as stated in Section IV-D. In addition, this produces ICI to the packets scheduled in the preceding and succeeding network cycles, potentially preventing them from meeting their constraints. Then, T i nc ≥ 17.5 T_{i}^{\text{nc}}\geq 17.5 ms. Nevertheless, considering a unique DC flow type, T i nc = T DC app = 30 T_{i}^{\text{nc}}=T_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{app}}=30 ms is kept for the Experiments 4-5.
In this experiment, target and background DC flows share the same transmission window. Two scenarios are carried out: one corresponding to the results shown in Fig. 9(a), where TAS is disabled at the SL, measuring the 5G network delays for target DC traffic; while Fig. 9(b) illustrates the case where TAS is enabled at SL.
Similarly to the results presented in Experiment 1, Fig. 9(a) shows the CDFs of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} shift rightward as the duration of the transmission window W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} increases. However, W MS, DC W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} is now significantly larger, reaching up to 1.75 ms, in contrast to the few tens of microseconds of Experiment 1. As a consequence, significantly higher values of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} are observed. Although the minimum delay remains approximately min { t DC uni } = 4.5 \min\{t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{uni}}\}=4.5 ms, the average delays range from 10.27 ms to 17.79 ms. Additionally, the maximum observed value of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} exceeds 23 ms, while the 99.9th percentile in the worst-case configuration is D ^ DC, 0.999 emp = 22 ms \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}=22~\text{ms}. Consequently, t DC jit = 17.5 t_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{jit}}~=~17.5 ms, which satisfies Eq. (17). These results underline the increased 5G queuing delays and jitter induced by the presence of multiple concurrent DC flows with the same priority in 5G downlink communications.
Fig. 9(b) shows the CCDF corresponding to the scenario where the TAS mechanism is enabled at the SL, where d DC emp d_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} is evaluated with δ DC = 20 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}=20 ms, resulting from Experiment 2. When W i, DC ∈ [ 0.25, 0.75 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}~\in~\left[0.25,0.75\right] ms ∀ i ∈ ℐ TSN \forall~i~\in~\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, the measured delays are concentrated within the interval [ δ DC − W i, DC, δ DC ] [\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},~\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}] ∀ i ∈ ℐ TSN \forall i\in~\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, for those packets that arrive in time to be scheduled within the transmission window in the same network cycle at the SL. These latency values below δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} happen when a packet at the MS is transmitted at any time within the transmission window W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and, due to packet disaggregation at the output ports in SL, target DC packets waiting in the queue are quickly transmitted after δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}. Although some measures in W i, DC ∈ [ 0.25, 0.75 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\in\left[0.25,0.75\right] ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} are above δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 20 ms, they cannot be attributed to any effect as they are within the amount allowed by the defined 99.9th percentile. Nevertheless, when W i, DC ∈ [ 1, 1.25 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\in\left[1,1.25\right] ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}, the measured delays are concentrated within the interval [ δ DC − W i, DC, δ DC + W i, DC ] [\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}-W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}},\delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}] ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}}. This occurs when the packets arrive later than those 20 ms but find their gate open during W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}, and the probability of this effect increases as the W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} gets higher. This means that W SL, DC > N DC ⋅ d ε MS, NW-TT, DC tran W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL},\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}>N_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\cdot d_{\varepsilon_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS},\lx@glossaries@gls@link{acronym}{NW-TT}{{{}}NW-TT}}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{tran}} was necessary to guarantee the deterministic transmission of certain target DC packets in exchange of reducing the bandwidth, although some jitter within W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} spreads across subsequent TSN nodes. Furthermore, this effect is highlighted in the cases of larger window sizes W i, DC ∈ [ 1.5, 1.75 ] W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}\in\left[1.5,1.75\right] ms ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} —and then, greater aggregated traffic loads—, where packets start suffering greater latencies than δ DC + W i, DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} and not all packets arrive in time to be transmitted within the same network cycle. Consequently, some packets must be transmitted within the transmission window of the following network cycle, incurring an additional delay of T i nc = 30 T_{i}^{\text{nc}}=30 ms, i.e., δ DC + T i nc = 50 \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}+T_{i}^{\text{nc}}=50 ms. This behavior causes the ICI effect.
In summary, in scenarios where multiple flows share the same priority, the solution for transmitting the packets of the DC flows in a single transmission window is to increase W i, DC W_{i,\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} ∀ i ∈ ℐ TSN \forall i\in\mathcal{I}^{\text{\lx@glossaries@gls@link{acronym}{TSN}{{{}}TSN}}} accordingly. However, this approach inevitably leads to increased jitter, which may become significant and impact the performance of the corresponding industrial application. Thus, in the SL, the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} should be set according to the new percentile D ^ DC, 0.999 emp \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}} measured, as well as the transmission window W SL, DC W_{\text{\lx@glossaries@gls@link{acronym}{SL}{{{}}SL}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} should be resized to optimize bandwidth at the same time jitter is reduced.
The resulting CCDF of d ~ DC emp \widetilde{d}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}^{\text{emp}} is depicted in Fig. 10, where a clear trend towards higher latencies can be seen as BE load is increased. For the cases R BE gen ∈ [ 600, 650 ] R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}\in[600,650] Mbps, we obtain similar behavior of latencies as in the case of Experiment 1, i.e., D ^ DC, 0.999 emp ≤ \hat{D}_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}},0.999}^{\text{emp}}\leq 15 ms, so that we can also set δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 20 ms, replicating Scenario 1 in Fig. 4. However, despite using the same TAS configuration of Experiment 1 with fixed W MS, DC = W_{\text{\lx@glossaries@gls@link{acronym}{MS}{{{}}MS}},\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 46.5 μ \mu s, higher BE loads such as R BE gen ∈ [ 700, 750 ] R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}\in[700,750] Mbps clearly triggers latencies slightly over δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} such that few packets could not be transmitted until the next network cycle. In those cases, the offset should be rescaled up to, for example, δ DC = \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}}= 25 ms. Similarly, R BE gen = R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}= 800 Mbps is enough for increasing latencies over 50 ms (Scenario 4 in Fig. 4). Additionally, latencies for R BE gen ∈ [ 850, 980 ] R^{\text{gen}}_{\text{\lx@glossaries@gls@link{acronym}{BE}{{{}}BE}}}\in[850,980] Mbps highly increase up to 800 ms, which is quite far from the industrial constraints. These results highlight the limited isolation between DC and BE traffic in the 5G system. Although T GB T^{\text{GB}} prevents collisions in the TAS domain (Section III-C), the 5G system only provides relative prioritization via the 5QI configuration. Consequently, resources are still shared, and under high BE load, DC packets may experience increased queuing delays due to buffer contention. Hence, the latency and jitter of the DC flow are substantially increased by the BE load, and the offset δ DC \delta_{\text{\lx@glossaries@gls@link{acronym}{DC}{{{}}DC}}} must be reviewed again.
This section reviews existing work on 5G - TSN integration, with a specific focus on TAS scheduling. In the literature, TSN has been explored both as a fronthaul/backhaul solution within a 5G network and in scenarios where the 5G network acts as a TSN bridge. Regarding the latter, we analyze works that address TAS -based integration through architectural frameworks, simulation-based evaluations, and experimental testbeds. Finally, we compare our contributions with respect to the other works in each topic.
Some research efforts concentrate on the 5G fronthaul segment, which involves Ethernet-based low-latency transport solutions. Hisano et al. [ 27 ] propose the gate-shrunk TAS, a dynamic variant of TAS that adjusts gate states via special control packets to enhance bandwidth efficiency without degrading delay for machine-to-machine communications. Nakayama et al. [ 28 ] develop an autonomous TAS scheduling algorithm formulated as a boolean satisfiability problem that uses an FPGA-based solver for fast computation and flexible reconfiguration of the GCL in response to changing traffic. Shibata et al. [ 29 ] propose autonomous TAS techniques, named iTAS and GS-TAS, and adaptive compression for mobile fronthaul to efficiently manage low-latency and bursty IoT traffic, achieving deterministic delay and supporting fronthaul and backhaul in 5G and IoT networks.
Although these studies provide valuable TAS -based solutions for deterministic low-latency fronthaul transport, they are not sufficient to ensure E2E determinism in networks composed of both TSN nodes and 5G, joined as a TSN bridge.
From an architectural perspective, it is well established that the 5G system behaves as a TSN logical switch, as discussed in [ 30 ] [ 31 ]. Several works address time synchronization [ 32 ] and 5G - TSN QoS mapping [ 33 ] as key functions for this logical switch model. Comprehensive surveys and architectural frameworks have laid the foundation for understanding the role of TAS in 5G - TSN networks. Satka et al. [ 34 ] provide an in-depth study that, while covering synchronization, delay, and security in 5G - TSN systems, identifies TAS as a critical yet underexplored component in achieving E2E determinism. Egger et al. [ 25 ] highlight the incompatibilities between TAS ’s deterministic assumptions and the stochastic nature of wireless 5G links, advocating for a new “wireless-aware TSN engineering” paradigm to adapt TAS mechanisms for future 5G and 6th Generation (6G) systems. Islam [ 35 ] applies graph neural networks combined with deep reinforcement learning for incremental joint TAS and radio resource scheduling, illustrating the benefits of AI-driven optimization in complex integrated networks. Nazari et al. [ 36 ] develop the incremental joint scheduling and routing algorithm, emphasizing precise TAS gate control and routing within centralized TSN network configuration to minimize delay and packet delay variation.
While these contributions offer valuable architectural and conceptual perspectives on TAS integration in 5G - TSN networks, they lack empirical validation and do not specifically examine the impact of jitter on network performance.
Several studies have relied on simulation to evaluate and improve TAS scheduling, routing, and performance in 5G - TSN integrated networks. Li et al. [ 37 ] propose a fault-tolerant TAS scheduling algorithm based on redundant scheduling and priority adjustment to reduce complexity and improve robustness against timing faults, offering a scalable baseline for 5G - TSN integration. Wang et al. [ 38 ] propose the Balanced and Urgency First Scheduling (B-UFS) heuristic algorithm to ensure deterministic E2E delay for periodic time-critical flows. It introduces a pseudo-cyclic queuing and forwarding model for uncertain arrivals, a uniform resource metric, and a scheduling strategy that balances urgency and load across time and space to efficiently manage resources across the network. Debnath et al. [ 33 ] present 5G TQ, an open-source framework that enables 5G - TSN integration through a TSN -to- 5G QoS mapping algorithm. It implements a QoS -aware priority scheduler within the 5G MAC layer and evaluates Radio Access Network (RAN) -level scheduling strategies using ns-3, demonstrating improvements in delay and reliability for industrial traffic. Ginthör et al. [ 39 ] propose a constraint programming–based framework for optimizing E2E flow scheduling in 5G - TSN networks by modeling domain-specific constraints and a unified performance objective. Simulations on industrial topologies demonstrate improved schedulability and reduced delay compared to separate 5G and TSN scheduling approaches. Chen et al. [ 40 ] explore the use of 5G as a TSN bridge, integrating TAS to support time-triggered flows across TSN and 5G domains. It proposes a dynamic scheduling mechanism that allocates time slices to critical services, ensuring deterministic delay and jitter. However, the study abstracts away the wireless characteristics of 5G, focusing solely on its role as a deterministic forwarding bridge rather than analyzing radio-layer variability. Shih et al. [ 41 ] propose a TAS scheduling method based on constraint satisfaction that incorporates the variable residence time of the 5G logical bridge to preserve E2E determinism. The approach models wireless timing uncertainty and introduces a robustness margin into the scheduling constraints to balance schedulability and reliability. Fontalvo-Hernández et al. [ 42 ] analyze the feasibility of integrating 5G traffic into TSN schedules governed by TAS, focusing on jitter mitigation at the 5G - TSN boundary. It evaluates the hold-and-forward buffering mechanism proposed in 3GPP standards, which equalizes packet residence time in 5G to make flows compatible with TAS schedules. Using OMNeT++ simulations, the study quantifies the trade-off between jitter reduction and increased E2E delay introduced by buffering.
While these simulation-based studies provide valuable insights into TAS scheduling and jitter mitigation, they lack practical guidelines for configuring TAS to handle 5G delay variability, and do not validate their proposals in real environments. For instance, although the promising approach of the hold-and-forward buffer jitter mitigation mechanism for TAS presented by Fontalvo-Hernández et al. [ 42 ] and the complete 5G - TSN architecture proposed by Debnath et al. [ 33 ], both lack commercial 5G and TSN equipment validation. Our work fills this gap by using a functional testbed to empirically analyze jitter impact and derive robust TAS configurations for 5G - TSN networks.
Experimental validations complement theoretical and simulation results, providing practical insights into TAS scheduling for 5G - TSN networks. Jayabal et al. [ 43 ] design a contention-free Carrier Sense Multiple Access (CSMA) Medium Access Control (MAC) with transmission gating to minimize collisions and achieve low delay in 5G - TSN scenarios. Agustí-Torra et al. [ 44 ] aim to study architectural challenges and interoperability aspects in an emulated 5G - TSN testbed. Aijaz et al. [ 45 ] build a 5G - TSN testbed using commercial TSN and 5G devices to transmit traffic via IEEE 802.1Qbv TAS. It evaluates E2E delay and jitter by scheduling packets over a near product-grade 5G system under varying traffic and network conditions. The analysis offers a useful initial view of the impact of 5G integration on TAS performance and outlines resource allocation strategies, though a more in-depth exploration remains open for future work.
Recently, we investigated in [ 6 ] the impact of 5G network-induced delay and jitter on the performance of IEEE 802.1Qbv scheduling in integrated 5G - TSN networks. This study involved an empirical analysis based on a real-world testbed, which included IEEE 802.1Qbv-enabled switches, TSN translators, and a commercial 5G system. We focused on evaluating how the integration of 5G affects the deterministic behavior of IEEE 802.1Qbv scheduling, developed an experimental setup combining TSN and 5G technologies, and identified key configuration parameters to optimize IEEE 802.1Qbv performance within a 5G - TSN environment. However, neither in this nor in other empirical work are the conditions for deterministic communications defined, nor are the critical scenarios evaluated.
Although these works are characterized by also conducting an empirical testbed-based evaluation of a 5G - TSN network with real traffic, they differ in scope and depth. Agustí-Torra et al. [ 44 ] focus on preliminary design and implementation of the testbed without delving into the evaluation of the feasibility of combining for different TAS configurations. In the case of Aijaz et al. [ 45 ], the enwindowed traffic from a single TSN switch is examined through the 5G system, focusing solely on delay performance rather than assessing a full TAS configuration. Similarly, Jayabal et al. [ 43 ] aim to enhance wireless TSN MAC coordination without integrating or characterizing real 5G latency behavior. In contrast, our work focuses on characterizing this delay for a specific TAS configuration in order to determine the required offset between TSN nodes in the downlink for deterministic operation.
In this work, we have characterized how 5G -induced delay and jitter affect the coordinated operation of IEEE 802.1Qbv TAS in integrated 5G - TSN networks, with the objective of determining the timing conditions required to preserve deterministic transmission. We consider deterministic transmission as the scenario in which all packets of the same application cycle are forwarded within a single transmission window at both TSN switches adjacent to the 5G segment, ensuring bounded jitter not exceeding the transmission window.
To enable deterministic transmission, a temporal offset must be introduced between the network cycles of the TSN switches enclosing the 5G segment, dimensioned from a high-percentile bound of the 5G empirical delay. In addition, four timing constraints must be satisfied to ensure that all packets from the same application cycle are confined within a single transmission window. We also revealed another fundamental condition: the difference between the network cycle duration and the configured transmission window must be strictly larger than the 5G jitter, establishing how TAS parameters must be configured with respect to 5G delay to avoid ICI. These conditions were validated using a commercial 5G - TSN testbed under realistic equipment-induced delay variability. Furthermore, our experiments showed that multiple delay-critical flows sharing the same priority increase 5G queuing delays and jitter, requiring larger offsets and transmission windows to maintain application cycle confinement. The presence of best effort traffic further broadens the 5G delay distribution, even with TAS correctly configured, demonstrating that flow concurrency, traffic load, and 5G queuing dynamics must be explicitly considered to preserve the deterministic transmission.
Our results call for investigating jitter-mitigation techniques, such as the hold-and-forward buffering mechanism, to alleviate the ICI effect and achieve near-full link utilization under realistic 5G delay variability. In addition, the performance of the 5G - TSN network can be further enhanced by leveraging uRLLC -oriented latency reduction features such as configured grants, mini-slot scheduling, 5G network slicing, or upcoming 6G systems. Our findings also motivate the design of adaptive algorithms capable of dynamically adjusting the offset and TAS parameters based on real-time traffic load, empirical 5G delay distribution, and radio channel conditions. Finally, future work could analyze how to guarantee determinism under isochronous traffic.