| 引用本文: | 杨志,赵禹博,李保罡,等.基于贪心算法的 TSN-SPQ 混合调度策略在变电站通信中的应用研究[J].电力系统保护与控制,2026,54(11):84-92. |
| YANG Zhi,ZHAO Yubo,LI Baogang,et al.Research on the application of TSN-SPQ hybrid scheduling strategy based on greedy algorithm in substation communications[J].Power System Protection and Control,2026,54(11):84-92 |
|
| 摘要: |
| 为满足智能变电站对低时延、高确定性与高可靠性的传输需求，并提升其对动态混合流量的适应性，提出一种基于贪心算法的 TSN-SPQ 混合调度策略。该策略融合时间敏感网络 (time-sensitive networking, TSN) 技术与严格优先级队列 (strict priority queuing, SPQ) 调度机制，依据报文优先级差异化调度传输路径，在保障高优先级报文确定性传输的同时，优化低优先级报文的带宽利用效率。同时引入贪心算法动态分配 TSN 门控列表时隙窗口，优先满足高优先级报文需求，实现了突发场景下时隙的动态零冲突分配与带宽高效复用。最后基于网络演算理论，严格推导了混合调度策略的端到端时延上界，通过仿真对比分析了不同调度策略的性能差异。结果表明：该策略显著增强了智能变电站对动态复杂流量场景的适应能力，为智能变电站的稳定可靠运行提供关键技术支撑。 |
| 关键词: 时间敏感网络 贪心算法 智能变电站 流量调度 网络演算理论 |
| DOI：10.19783/j.cnki.pspc.250804 |
| 分类号: |
| 基金项目:国家自然科学基金项目资助 (62471181) |
|
| Research on the application of TSN-SPQ hybrid scheduling strategy based on greedy algorithm in substation communications |
|
YANG Zhi1,2, ZHAO Yubo1,2, LI Baogang1,2, ZHAO Jinwei1,2
|
|
1. Department of Electronic and Communication Engineering, North China Electric Power University, Baoding 071003, China; 2. Hebei Key Laboratory of Power Internet of Things Technology, North China Electric Power University, Baoding 071003, China
|
| Abstract: |
| To meet the requirements of low-latency, high determinism, and high reliability in smart substations, and to enhance adaptability to dynamic mixed traffic, this paper proposes a greedy-algorithm-based TSN-SPQ hybrid scheduling strategy. It integrates time-sensitive networking (TSN) technology with the strict priority queuing (SPQ) mechanism, and differentiates transmission paths according to message priority levels. It ensures deterministic transmission for high-priority messages while improving bandwidth utilization efficiency for low-priority traffic. A greedy algorithm is introduced to dynamically allocate time-slot windows in the TSN gate control list, prioritizing high-priority demands. This enables dynamic, conflict-free time-slot allocation and efficient bandwidth reuse under burst traffic scenarios. Furthermore, based on network calculus theory, the end-to-end delay upper bound of the hybrid scheduling strategy is rigorously derived. Simulation studies are conducted to compare the performance of different scheduling strategies. The results demonstrate that the proposed strategy significantly enhances the adaptability of smart substations to dynamic and complex traffic scenarios, providing critical technical support for their stable and reliable operation. |
| Key words: time-sensitive network greedy algorithms smart substation traffic scheduling network calculus theory |
