An Ant-Based Research on RWA in Optical Networks

The RWA problem is one of the most important issues in WDM optical networks. Most of conventional RWA (routing and wavelength assignment) approaches are based on the centralized communication policy, but the dynamic routing information included in the network can not be thoroughly obtained. In this paper, we propose an improved algorithm which integrates ant-colony and FF algorithm to solve the RWA problem. The algorithm is applied for the simple network with 9 nodes in physical topology. From the analytic and experimental results, our distributed routing policy can realize the task of path selection with lower blocking probability and higher resources utilization in an acceptable time performance.