Title of article
Simulation Study of a Heuristic Near-Maximum Ant-Based Dynamic Routing
Author/Authors
Tan, Chin Multimedia University - Faculty of Information Technology, Malaysia , Fouad, Abbou Alcatel Network Systems, Malaysia , Ewe, Tat Multimedia University - Faculty of Information Technology, Malaysia
From page
230
To page
233
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
Journal title
The International Arab Journal of Information Technology (IAJIT)
Journal title
The International Arab Journal of Information Technology (IAJIT)
Record number
2543513
Link To Document