摘要
动态RWA(路由与波长分配)问题是智能光网络的核心问题。文章提出一种解决动态RWA问题的改进蚁群算法,在转移概率中加入了链路的空闲率作为约束条件,同时还引入了随机扰动防止搜索过早收敛于局部最优路径。仿真结果表明,改进算法与传统Dijkstra+FF(首次命中)算法相比,可以显著降低阻塞率,提高资源利用率。
Dynamic Routing and Wavelength Assignment（RWA） is a key issue in intelligent optical networks.This paper presents an improved ant colony algorithm to tackle this issue,in which link idleness probability is added to the ant transition probability as a constraint and simultaneously random disturbances are introduced to prevent premature convergence of searches into the optimal local path.Simulation results show that compared with the conventional Dijkstra＋FF algorithm,the modified algorithm significantly decreases the blocking probability and increases the resources utilization rate.
出处
《光通信研究》
北大核心
2011年第5期1-3,共3页
Study on Optical Communications
关键词
智能光网络
路由与波长分配
蚁群算法
阻塞率
intelligent optical network
RWA
ant colony algorithm
blocking probability
