Scholarlink

<p>To meet the mixed traffic scheduling requirements of time-triggered (TT) streams and audio video bridging (AVB) streams in the industrial Internet, this paper proposes a time aware cyclic queuing forwarding traffic scheduling algorithm considering reallocation and priority sorting (RPS-TACQF) method. Combining time aware shaper (TAS) and cyclic queuing and forwarding (CQF) mechanisms, it dynamically adjusts the queue resource allocation and traffic forwarding order, and uses the dead time of CQF odd and even queue switching to schedule TAS, optimize the frame injection time slot and routing, while meeting their respective end-to-end delay and jitter requirements. The experimental results show that the RPS-TACQF algorithm significantly improves the scheduling success rate in scenarios with 50 TT data streams and 100–1000 AVB data streams, especially under high load conditions, where the scheduling success rate of AVB data streams is about 36.5% higher than other algorithms; The bandwidth utilization rate increased by about 36.5% under high load, and the algorithm execution time still saved about 31.4% compared to the TAMCQF-ILP solver algorithm under high load networks.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Time aware cyclic queuing forwarding traffic scheduling algorithm considering reallocation and priority sorting (RPS-TACQF)

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月3日

查看全文
  • Yuanxun Shen,
  • Xinjie Chen,
  • Xuelian Ma

摘要

To meet the mixed traffic scheduling requirements of time-triggered (TT) streams and audio video bridging (AVB) streams in the industrial Internet, this paper proposes a time aware cyclic queuing forwarding traffic scheduling algorithm considering reallocation and priority sorting (RPS-TACQF) method. Combining time aware shaper (TAS) and cyclic queuing and forwarding (CQF) mechanisms, it dynamically adjusts the queue resource allocation and traffic forwarding order, and uses the dead time of CQF odd and even queue switching to schedule TAS, optimize the frame injection time slot and routing, while meeting their respective end-to-end delay and jitter requirements. The experimental results show that the RPS-TACQF algorithm significantly improves the scheduling success rate in scenarios with 50 TT data streams and 100–1000 AVB data streams, especially under high load conditions, where the scheduling success rate of AVB data streams is about 36.5% higher than other algorithms; The bandwidth utilization rate increased by about 36.5% under high load, and the algorithm execution time still saved about 31.4% compared to the TAMCQF-ILP solver algorithm under high load networks.