基于分段帧复制和消除的时间敏感网络动态冗余机制研究  

Study on Dynamic Redundancy Mechanism of Time Sensitive Networks Based on Segmented Frame Copy and Elimination

作　　者：张浩 郭偶凡 周飞飞 马涛 何迎利 姚苏滨 ZHANG Hao;GUO Oufan;ZHOU Feifei;MA Tao;HE Yingli;YAO Subin(State Grid Shandong Electric Power Company,Jinan 250001,China;State Grid Electric Power Research Institute,Nari Group Co.,Ltd.,Nanjing 211106,China;School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]国网山东省电力公司经济技术研究院,济南250001 [2]国网电力科学研究院有限公司,南京211106 [3]南京邮电大学计算机学院,南京210003

出　　处：《计算机科学》2024年第S02期740-746,共7页Computer Science

基　　金：国家电网有限公司总部科技项目资助“电力时间敏感网络交换芯片研制及应用”项目(5108-202218280A-2-170-XG)。

摘　　要：为解决时间敏感网络IEEE 802.1CB协议中并未明确如何实现复制帧的可靠传输的问题,以及从端到端角度进行可靠性保护存在的网络资源浪费问题,提出了一种基于分段帧复制和消除的时间敏感网络动态冗余机制。该机制利用可靠性概率模型根据数据流优先级的不同对各数据流部署不同的冗余路径,同时借助分段保护的思想实现对网络冗余的压缩处理,能够在保证数据传输高可靠性的同时有效地压缩网络冗余。该算法首先根据数据流的优先级对客户端流进行筛选,仅针对优先级大于等于4的数据流进行冗余保证;其次,利用遗传算法计算源节点和目的节点之间的最优主路径进行数据传输,并根据可靠性概率模型判断是否达到预期可靠性,若没有达到,将使用分段帧复制和消除手段来确认冗余路径以及需要部署的FERE-NODE数量;最后,经过不断迭代更新获得部署FERE-NODE的最优解以及最佳冗余路径策略。通过在NeSTiNg平台搭建仿真实验,结果表明,在与最短路径算法、基于拉格朗日松弛的时延约束的最小代价算法(DCLC)两种基准算法的对比中,所提冗余算法在丢包率分别降低了0.15%,0.23%,平均时延上分别降低了9.33%,7.35%;在与两种端到端的冗余机制ETE-FRER和ONE-FRER的对比中,所提冗余算法在99.999%可靠性要求下的带宽消耗分别降低了35.0%,12.4%,充分验证了该算法在保证网络高可靠性的同时能够有效地降低网络冗余消耗。To address the issue of how to achieve reliable transmission of replicated frames in the IEEE 802.1CB protocol for time sensitive networks,as well as the waste of network resources caused by end-to-end reliability protection,this paper proposes a dynamic redundancy mechanism for time sensitive networks based on segmented frame replication and elimination.This mechanism utilizes a reliability probability model to deploy different redundant paths for each data flow based on its priority,and utilizes the idea of segmented protection to compress network redundancy,effectively compressing network redundancy while ensuring high reliability of data transmission.This algorithm first filters the client stream based on its priority,ensuring redundancy only for data streams with priority greater than or equal to 4.Secondly,genetic algorithm is used to calculate the optimal main path between the source node and the destination node for data transmission,and the reliability probability model is used to determine whether the expected reliability has been achieved.If not,segmented frame replication and elimination methods will be used to confirm redundant paths and the number of FERE-NODES that need to be deployed.Finally,through continuous iteration and updating,the optimal solution for deploying FERE-CODE and the optimal redundant path strategy are obtained.Through simulation experiments on the NeSTiNg platform,the results show that compared with the shortest path algorithm and the minimum cost algorithm based on Lagrangian relaxation delay constraint(DCLC),the proposed redundant algorithm reduces packet loss rates by 0.15% and 0.23% respectively,and reduces average latency by 9.33% and 7.35% respectively.In comparison with two end-to-end redundancy mechanisms,ETE-FRER and ONE-FRER,the proposed redundancy algorithm reduces bandwidth consumption by 35.0%and 12.4%respectively under the 99.999% reliability requirement,fully verifying that this algorithm can effectively reduce network redundancy consumption while ensuring high ne

关 键 词：时间敏感网络 可靠性 帧复制和消除 动态冗余 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]