检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:冯泽坤 龚龙庆[1] 徐丹妮[1] 刘扬 FENG Ze-kun;GONG Long-qing;XU Dan-ni;LIU Yang(Xi′an Microelectronics TechnologyInstitute,Xi′an 710054,Shaanxi China)
出 处:《微电子学与计算机》2021年第6期33-37,共5页Microelectronics & Computer
摘 要:针对目前时间敏感网络(Time Sensitive Network,TSN)中多采用离线调度,在处理动态需求时调度开销过大的问题,提出了一种适用于TSN的基于整数线性规划(Integer Linear Programming,ILP)的动态流量均衡调度算法.该算法以已生成的离线调度表为基础,通过一种增量计算方式,有效降低拓扑和业务变化带来的开销;同时,针对链路负载可能出现的极端情况,制订了流量均衡策略,避免出现延时瓶颈问题,进而提升通信实时性.实验数据表明,与传统静态调度算法相比,在处理动态流量时的运算时间减少,链路负载更加均衡.In order to solve the problem that off-line scheduling is often used in Time Sensitive Network(TSN),and the scheduling overhead is too high when dealing with dynamic demands,a dynamic flow balancing scheduling algorithm based on integer linear programming(ILP)for TSN is proposed.Based on the generated offline scheduling table,the algorithm can effectively reduce the overhead caused by topology and service changes through an incremental calculation method.At the same time,according to the extreme situation of the link load,the traffic balancing strategy is formulated to avoid the delay bottleneck problem,and then improve the real-time communication performance.Experimental data shows that compared with the traditional static scheduling algorithm,the computing time is greatly reduced and the link load is balanced better.
关 键 词:TSN ILP 动态均衡调度 链路负载 运算时间
分 类 号:TP393.11[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90