检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周伟[1] 罗青松[1] 谢晓兰[2,3] 敬超[2,3] 程小辉[2,3] 潘必韬 ZHOU Wei;LUO Qingsong;XIE Xiaolan;JING Chao;CHENG Xiaohui;PAN Bitao(The 34th Research Institute of CETC,Guilin Guangxi 541004,China;College of Computer Science and Engineering,Guilin University of Technology,Guilin Guangxi 541000,China;Guangxi Key Laboratory of Embedded Technology and Intelligent System,Guilin Guangxi 541000,China;State Key Laboratory of Information Photonics and Optical Communications,Beijing University of Posts and Telecommunications,Beijing 100876,China)
机构地区:[1]中国电子科技集团公司第三十四研究所,广西桂林541004 [2]桂林理工大学计算机科学与工程学院,广西桂林541000 [3]桂林理工大学广西嵌入式技术与智能系统重点实验室,广西桂林541000 [4]北京邮电大学信息光子学与光通信国家重点实验室,北京100876
出 处:《光通信技术》2024年第5期51-59,共9页Optical Communication Technology
基 金:2024年广西重点研发计划项目(批准号:2023AB07026)资助。
摘 要:为了进一步解决多星及星地间通信和计算系统资源的高度整合与互馈增强问题,提出了一种基于卫星间光链路光业务单元(OISL-OSU)的通算一体卫星路由优化算法——OISL-DDPG算法。该算法采用深度确定性策略梯度(DDPG)优化方法,提高了卫星光网络QoS性能。仿真实验表明:采用基于时间窗口的网络切片方法符合国内低轨星座真实网络运行状态;与最小跳数算法相比,所提出的算法以增加微小时延为代价,获得更高的链路利用率和链路占用率;与多约束最短路由优先(MCSPF)算法相比,该算法的收敛性更好,时延和丢包率更低。In order to tackle the issue of high integration and mutual feedback enhancement of the resources of multi-satellite and inter-satellite communication and computing systems,an integrated satellite routing algorithm OISL-DDPG is proposed based on optical inter-satellite link-optical service unit(OISL-OSU).OISL-DDPG adopts the deep deterministic policy gradient(DDPG)optimization method to enhance the quality of service(QoS)performance of satellite optical networks.The simulation experiments indicat that the network slicing method based on time windows is consistent with the actual network operation status of domestic low-orbit constellations.Additionally,the proposed algorithm achieves higher link utilization and link occupancy rates at the cost of increasing slight delay than the minimum hop algorithm,and gets a better convergence rate,lower latency,and lower packet loss rate than the multi-constrained shortest path first(MCSPF)algorithm.
分 类 号:TN256[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33