一种基于改进蚁群算法的光网络动态RWA机制  

An improved ant colony algorithm-based scheme for dynamic routing and wavelength assignment in optical networks

作　　者：程希[1] 沈建华[1] 杨帆[1] 梁兵[1] 于飞[1] 

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003

出　　处：《光通信研究》2011年第5期1-3,共3页Study on Optical Communications

摘　　要：动态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.

关 键 词：智能光网络 路由与波长分配 蚁群算法 阻塞率 

分 类 号：TN915[电子电信—通信与信息系统]