An Improved Ant Colony Based Algorithm for Dynamic Routing and Wavelength Assignment Scheme in Optical Networks
Dynamic routing and wavelength assignment (RWA)is a key problem in intelligent optical networks.This paper presents an improved ant colony algorithm to solve the RWA problem which introduced link idle as constraint into the ant transition probability.At the same time,the random disturbance is added to prevent premature convergence into local optimal path.Simulation shows that the modified algorithm decreases the blocking probability and increases the resources utilization comparing with the traditional Dijkstra+FF algorithm,respectively.
Intelligent Optical Network Routing and Wavelength Assignment Ant Colony Algorithm Blocking Probability Resource Utilization
Jianhua Shen Xi Cheng
College of Communication and Information Engineering Nanjing University of Posts &Telecommunications Nanjing,China,210003
国际会议
沈阳
英文
69-71
2012-07-27(万方平台首次上网日期,不代表论文的发表时间)