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

Abstract

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. © the authors.