检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李佳庆 陈水忠[2] 魏刚 李昕 LI Jiaqing;CHEN Shuizhong;WEI Gang;LI Xin(Science and Technology on Electro-Optical Control Laboratory,Luoyang 471000,China;Luoyang Institute of Electro-Optical Equipment,AVIC,Luoyang 471000,China)
机构地区:[1]光电控制技术重点实验室,河南洛阳471000 [2]中国航空工业集团公司洛阳电光设备研究所,河南洛阳471000
出 处:《电光与控制》2023年第3期58-62,共5页Electronics Optics & Control
摘 要:时间敏感网络在标准以太网的基础上通过增加高精度时间同步、资源预留及路径控制、流量整形和业务调度等一系列关键技术,能够保证数据传输的实时性和可靠性。然而,启发式算法在实现门控调度时,数据的周期比过大会导致缓存容量增大和相同优先级数据同时、同向传输时无控制调度等问题。为此,优化改进了门控调度的启发式算法,通过采取数据周期感知和输出缓存长度感知循环等技术,解决了缓存容量不足和时延抖动等问题。仿真结果表明,与传统的启发式算法相比,所提算法在数据周期比超过60倍时能有效减少门控列表90%的存储空间,在相同优先级数据传输情况下平均时延抖动降低了约50%。On the basis of standard Ethernet,Time Sensitive Network(TSN) can ensure the real-time and reliability of data transmission by adding a series of key technologies such as high-precision time synchronization,resource reservation and path control,and traffic shaping and service scheduling.However, when heuristic algorithm realizes gating scheduling,the excessive cycle ratio of data leads to the problems of increased cache capacity and uncontrolled scheduling when data with the same priority are transmitted in the same direction at the same time.Therefore,the heuristic algorithm of gating scheduling is optimized and improved,and the problems of insufficient cache capacity and delay jitter are solved by adopting technologies such as data cycle sensing and output cache length sensing cycle.The simulation results show that,compared with the traditional heuristic algorithm,the algorithm can effectively reduce the storage space of the gate control list by 90% when the data cycle ratio exceeds 60 times,and the average delay jitter is reduced by about 50% under the same priority data transmission.
关 键 词:时间敏感网络 网络传输 门控调度 门控列表 启发式算法 时延抖动
分 类 号:TP393.11[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15