Simulation Study of a Heuristic Near-Maximum Ant-Based Dynamic Routing
Tan Chin1, Fouad Abbou2, and Ewe Tat1
1Faculty of Information Technology, Multimedia University, Malaysia
2Alcatel Network Systems, Kuala Lumpur, Malaysia
Abstract: A new ant-based routing is proposed for solving dynamic routing and wavelength assignment in mesh WDM network under the wavelength continuity constraint. The ant algorithm favors paths with maximum number of available wavelengths between two nodes, resulting in improved load balancing and less congested shortest path. The simulation results showed that the proposed ant-based routing algorithm is highly reliable in the sense that the number of ants used is predictable to achieve a steady performance in terms of blocking probability.
Keywords: Ant colony optimization, ACO, dynamic routing, WDM. Received October 16, 2006; accepted April 17, 2007