检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:林佳烁 王涛[1] 王卓薇[2] 詹双平 成剑 LIN Jia-shuo;WANG Tao;WANG Zhuo-wei;ZHAN Shuang-ping;CHENG Jian(School of Automation,Guangdong University of Technology,Guangzhou 510006,China;School of Computer Science and Technology,Guangdong University of Technology,Guangzhou 510006,China;Department of Broadband Communication,Peng Cheng Laboratory,Shenzhen 518055,China)
机构地区:[1]广东工业大学自动化学院,广东广州510006 [2]广东工业大学计算机学院,广东广州510006 [3]鹏城实验室宽带通信研究部,广东深圳518055
出 处:《计算机工程与设计》2023年第11期3214-3221,共8页Computer Engineering and Design
基 金:广东省重点领域研发计划基金项目(2020B010164001);广东省自然科学基金项目(2020A1515010890);中国高校产学研创新基金项目(2021FNA02010);广东省自然资源厅特别基金项目(GDNRC[2020]024)。
摘 要:针对时间敏感网络的流调度问题,提出一种基于网络周期的在线流调度算法。基于网络周期将调度结果分散到各个网络周期中以提高网络的可调度性,增加实时流的调度数量;根据每个网络周期的可调度空间,提出重合度指标及基于该指标的离线调度算法,使用禁忌搜索算法,提高可调度空间,有利于后续的在线调度过程。实验结果表明,该算法能够有效增加网络的可调度流数量,其在线调度计算时间在毫秒级,满足算法在线运行实时性。A flow scheduling algorithm was proposed for time sensitive networking based on network cycle.A network-cycle mechanism was introduced and the traffic was distributed to each network cycle to improve schedulability of the network.Based on the schedulable space at each network cycle,a metric of coincidence degree was proposed and an offline scheduling algorithm was proposed to optimize this metric.Tabu search was adopted in the offline scheduling algorithm and the schedulable space was improved,which was beneficial for future scheduling.The simulation results show that the algorithm can effectively increase the number of scheduled flows in the network,and for each flow,the scheduling computation time is at millisecond level,which satisfies the real-time requirement of the algorithm in online operation.
关 键 词:时间敏感网络 确定性网络 流量调度 网络周期 禁忌搜索算法 流量工程 离线调度
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.167.59