一种解决光网络中动态RWA问题的改进蚁群算法  

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

作　　者：付依俊 陆月明[1] 

机构地区：[1]北京邮电大学可信分布式计算与服务教育部重点实验室,北京100876

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

基　　金：国家"八六三"计划资助项目(2011AA01A204)

摘　　要：动态RWA(路由与波长分配)问题是光网络中的重要问题,关系到网络的服务质量。文章提出一种改进ACO(蚁群优化)算法,通过对蚂蚁进行编组,实现组内最优解的信息素加强,且按组内最优解收敛,增强了全局信息对蚁群的指导作用,以取得更优结果。仿真结果表明,相比于传统ACO算法,该改进算法能显著降低阻塞率,提高网络的服务质量。Dynamic Routing and Wavelength Assignment （RWA） is important in optical networks, which have a direct bearing on their QoS. This paper presents an improved Ant Colony Optimization （ACO） algorithm for this issue, which enhances the optimum pheromones of the ant colonies and converges them in accordance with the optimal solution in these colonies and in- creases the guiding role of the global information for them so as to achieve still better results. Simulation results indicate that compared with the conventional ACO algorithms, this improved one significantly reduces the blocking rate and improves the network QoS.

关 键 词：光网络 波分复用 动态路由与波长分配 蚁群优化算法 阻塞率 

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