DCDTS: Deterministic cross-domain transmission and scheduling for large-scale deterministic networks

IF 4.4 2区计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE

Computer Networks Pub Date : 2025-06-17 DOI:10.1016/j.comnet.2025.111434

Xu Huang , Jia Chen , Deyun Gao , Shang Liu , Shangbing Qiao , Hongke Zhang

{"title":"DCDTS: Deterministic cross-domain transmission and scheduling for large-scale deterministic networks","authors":"Xu Huang , Jia Chen , Deyun Gao , Shang Liu , Shangbing Qiao , Hongke Zhang","doi":"10.1016/j.comnet.2025.111434","DOIUrl":null,"url":null,"abstract":"<div><div>Deterministic Networking (DetNet) is emerging to support the deterministic transmission in the Large-scale Deterministic Networks (LDNs). Recent proposals focus on the cooperation of different shaping mechanisms in Time Sensitive Networks (TSN) and DetNet to achieve the deterministic cross-domain in LDNs. However, the queue overflow caused by multi-domain access and the uncontrolled micro bursts during cross-domain remain challenges. To address this dilemma, a deterministic cross-domain scheme for LDNs is essential. In this paper, we design the Deterministic Cross-Domain Transmission and Scheduling (DCDTS), where the deterministic cross-domain cycle mapping scheme is proposed to fulfill the one-to-one cycle mapping between different domains and the cooperation of mechanisms in TSN and DetNet. In addition, we propose the Cyclic Queuing Clusters Forwarding (CQCF) mechanism to solve the effect of micro bursts during transmission in cross-domain and DetNet domains. Furthermore, we design the Hybrid Greedy-DDQN-based Traffic Scheduling (HGDTS) algorithm, which integrates the greedy and double deep Q-network into a two-step scheduling. The prototype and simulation experiments show that CQCF outperforms DIP in the number of successfully scheduled flows by approximately 22.4%. Moreover, HGDTS improves the schedulability, resource utilization, and convergence speed compared to the six baseline algorithms.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"269 ","pages":"Article 111434"},"PeriodicalIF":4.4000,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625004013","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}

引用次数: 0

Abstract

Deterministic Networking (DetNet) is emerging to support the deterministic transmission in the Large-scale Deterministic Networks (LDNs). Recent proposals focus on the cooperation of different shaping mechanisms in Time Sensitive Networks (TSN) and DetNet to achieve the deterministic cross-domain in LDNs. However, the queue overflow caused by multi-domain access and the uncontrolled micro bursts during cross-domain remain challenges. To address this dilemma, a deterministic cross-domain scheme for LDNs is essential. In this paper, we design the Deterministic Cross-Domain Transmission and Scheduling (DCDTS), where the deterministic cross-domain cycle mapping scheme is proposed to fulfill the one-to-one cycle mapping between different domains and the cooperation of mechanisms in TSN and DetNet. In addition, we propose the Cyclic Queuing Clusters Forwarding (CQCF) mechanism to solve the effect of micro bursts during transmission in cross-domain and DetNet domains. Furthermore, we design the Hybrid Greedy-DDQN-based Traffic Scheduling (HGDTS) algorithm, which integrates the greedy and double deep Q-network into a two-step scheduling. The prototype and simulation experiments show that CQCF outperforms DIP in the number of successfully scheduled flows by approximately 22.4%. Moreover, HGDTS improves the schedulability, resource utilization, and convergence speed compared to the six baseline algorithms.

查看原文本刊更多论文

DCDTS：大规模确定性网络的确定性跨域传输和调度

确定性网络（DetNet）是为了支持大规模确定性网络（ldn）中的确定性传输而出现的。最近的研究主要集中在时间敏感网络（TSN）和DetNet中不同整形机制的合作上，以实现ldn中的确定性跨域。然而，多域访问引起的队列溢出和跨域访问过程中不受控制的微突发问题仍然是一个难题。为了解决这一困境，一个确定性的ldn跨域方案是必不可少的。本文设计了确定性跨域传输与调度（DCDTS），提出了确定性跨域循环映射方案，以实现TSN和DetNet中不同域之间的一对一循环映射和机制的协作。此外，我们还提出了循环排队簇转发（CQCF）机制来解决跨域和DetNet域传输过程中微突发的影响。在此基础上，设计了基于贪心- ddq网络的混合流量调度算法（HGDTS），该算法将贪心和双深度q网络融合为两步调度。原型和仿真实验表明，CQCF在成功调度流的数量上比DIP高出约22.4%。此外，与六种基准算法相比，HGDTS提高了可调度性、资源利用率和收敛速度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computer Networks 工程技术-电信学

CiteScore

10.80

自引率

3.60%

发文量

434

审稿时长

8.6 months

期刊介绍： Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.