检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:朱晓荣[1] 贺楚闳 ZHU Xiaorong;HE Chuhong(College of Telecommunication and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)
机构地区:[1]南京邮电大学通信与信息工程学院,南京210003
出 处:《电子与信息学报》2024年第7期2773-2782,共10页Journal of Electronics & Information Technology
基 金:国家自然科学基金(92367102,92067101);江苏省重点研发计划(BE2021013-3)。
摘 要:为了平衡新型电力系统中大规模多模Mesh网络的传输可靠性和效率,该文在对优化问题进行描述和分析的基础上提出一种基于强化学习的大规模多模Mesh网络联合路由选择及资源调度算法,分为两个阶段。在第1阶段中,根据网络拓扑结构信息和业务需求,利用一种多条最短路径路由算法,输出所有最短路径。在第2阶段中,提出一种基于多臂老虎机(MAB)的资源调度算法,该算法基于得到的最短路径集合构建MAB的摇臂,然后根据业务需求计算回报,最终给出最优的路由选择及资源调度方式用于业务传输。仿真结果表明,所提算法能够满足不同的业务传输需求,实现端到端路径的平均时延和平均传输成功率的高效平衡。In order to balance the transmission reliability and efficiency of large-scale multi-mode mesh networks in the new power system,a two-stage algorithm is proposed based on reinforcement learning for joint routing selection and resource scheduling in large-scale multi-mode mesh networks,building upon the description and analysis of optimization problems.In the first stage,based on the network topology information and service requirements,a multi shortest path routing algorithm is utilized to generate all the shortest paths.In the second stage,a resource scheduling algorithm based on Multi-Armed Bandit(MAB)is proposed.The algorithm constructs the arms of the MAB based on the obtained set of shortest paths,then calculates the reward according to the service demands,and finally gives the optimal route selection and resource scheduling mode for service transmission.Simulation results show that the proposed algorithm can meet different service transmission requirements,and achieve an efficient balance between the average end-to-end path delay and the average transmission success rate.
关 键 词:MESH网络 路由选择 资源调度 多臂老虎机 强化学习
分 类 号:TN915.85[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.15.189.231