蚁群优化算法
计算机科学
路由和波长分配
Dijkstra算法
阻塞(统计)
布线(电子设计自动化)
启发式
趋同(经济学)
波分复用
窗口(计算)
交叉口(航空)
路径(计算)
计算机网络
波长
数学优化
算法
最短路径问题
工程类
数学
人工智能
光学
理论计算机科学
图形
物理
航空航天工程
经济
经济增长
操作系统
作者
Yi Dong,Shanghong Zhao,Hao Ran,Yongjun Li,Zihang Zhu
出处
期刊:Journal of Optical Communications and Networking
[The Optical Society]
日期:2015-09-16
卷期号:7 (10): 995-995
被引量:40
标识
DOI:10.1364/jocn.7.000995
摘要
Ant colony optimization (ACO) with the small window strategy is put forward to solve the routing and wavelength assignment problem in satellite optical networks. The intersatellite distance, link duration, and wavelength idle ratio are introduced as the heuristic functions, and the small window strategy is used to promote the convergence speed. By calculating the intersection of idle wavelengths on adjacent links, the algorithm can accomplish routing selection and wavelength assignment on a single ant. The results show that, compared with the Dijkstra+FF algorithm, the blocking probability of ACO can decrease by 50% at most, and improvement of the resource utilization ratio can reach 45%.
科研通智能强力驱动
Strongly Powered by AbleSci AI