TY - JOUR
T1 - Multi-Feature Incremental Scheduling for TSN Cyclic Queuing and Forwarding via a Triple-Mode Cooperative Optimizer
AU - Zhan, Jianning
AU - Zhang, Hangu
AU - Chen, Changsheng
AU - Zhang, Wentao
AU - Fan, Chao
AU - Han, Xu
AU - Deng, Shizhuang
N1 - Publisher Copyright:
© 2026 by the authors.
PY - 2026/6
Y1 - 2026/6
N2 - Time-Sensitive Networking (TSN) with Cyclic Queuing and Forwarding (CQF) is a critical mechanism for ensuring deterministic forwarding. However, existing incremental schedulers typically rely on single-dimensional heuristics, which fail to address the coupled impact of traffic characteristics and spatiotemporal resource distribution. This limitation leads to suboptimal scheduling success, especially under complex topologies and high network loads. To address this, we propose TMCOA–MFS, a joint incremental scheduling framework that integrates the Triple-Mode Cooperative Optimization Algorithm (TMCOA) with a Multi-Feature Scheduling (MFS) strategy. The logic of our approach is twofold: First, to balance spatial resource distribution, we introduce the TMCOA—inspired by table-tennis offensive–defensive behaviors—to optimize path selection by minimizing port-load variance and escaping local optima through a three-mode population partition. Second, building upon the optimized spatial paths, the MFS strategy is employed to resolve temporal scheduling conflicts. By computing a composite priority score that accounts for path hops, offset configuration difficulty, and flow size, MFS enables a robust incremental offset search with integrated feasibility checking. Extensive simulations on benchmark functions and diverse TSN scenarios demonstrate that the TMCOA offers superior convergence and stability. More importantly, the integrated TMCOA–MFS framework significantly enhances scheduling success rates and load balancing, effectively overcoming the bottlenecks of high-load and topologically complex environments.
AB - Time-Sensitive Networking (TSN) with Cyclic Queuing and Forwarding (CQF) is a critical mechanism for ensuring deterministic forwarding. However, existing incremental schedulers typically rely on single-dimensional heuristics, which fail to address the coupled impact of traffic characteristics and spatiotemporal resource distribution. This limitation leads to suboptimal scheduling success, especially under complex topologies and high network loads. To address this, we propose TMCOA–MFS, a joint incremental scheduling framework that integrates the Triple-Mode Cooperative Optimization Algorithm (TMCOA) with a Multi-Feature Scheduling (MFS) strategy. The logic of our approach is twofold: First, to balance spatial resource distribution, we introduce the TMCOA—inspired by table-tennis offensive–defensive behaviors—to optimize path selection by minimizing port-load variance and escaping local optima through a three-mode population partition. Second, building upon the optimized spatial paths, the MFS strategy is employed to resolve temporal scheduling conflicts. By computing a composite priority score that accounts for path hops, offset configuration difficulty, and flow size, MFS enables a robust incremental offset search with integrated feasibility checking. Extensive simulations on benchmark functions and diverse TSN scenarios demonstrate that the TMCOA offers superior convergence and stability. More importantly, the integrated TMCOA–MFS framework significantly enhances scheduling success rates and load balancing, effectively overcoming the bottlenecks of high-load and topologically complex environments.
KW - cyclic queuing and forwarding (CQF)
KW - incremental scheduling
KW - load balancing
KW - multi-feature priority scoring
KW - swarm intelligence optimization
KW - time-sensitive networking (TSN)
UR - https://www.scopus.com/pages/publications/105041455632
U2 - 10.3390/electronics15112252
DO - 10.3390/electronics15112252
M3 - 文章
AN - SCOPUS:105041455632
SN - 2079-9292
VL - 15
JO - Electronics (Switzerland)
JF - Electronics (Switzerland)
IS - 11
M1 - 2252
ER -