IEEE/ACM Transactions on Networking (TON)
Adaptive wavelength routing in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Dynamic wavelength routing using congestion and neighborhood information
IEEE/ACM Transactions on Networking (TON)
Tabu Search
Multiwavelength Optical Networks: A Layered Approach
Multiwavelength Optical Networks: A Layered Approach
Wavelength Assignment for Dynamic Traffic in Multi-fiber WDM Networks
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
IEEE Journal on Selected Areas in Communications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Ant-based survivable routing in dynamic WDM networks with shared backup paths
The Journal of Supercomputing
A new algorithm for the distributed RWA problem in WDM networks using ant colony optimization
ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
Performance analysis of nature inspired heuristics for survivable virtual topology mapping
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
An ant-based algorithm for distributed routing and wavelength assignment in dynamic optical networks
IEEE Journal on Selected Areas in Communications
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
This study considers the routing and wavelength assignment problem (RWA) in optical wavelength-division-multiplexed networks. The focus is dynamic traffic, in which the number of wavelengths per fiber is fixed. We minimize connection blocking using an ant-colony-optimization (ACO) algorithm that quantifies the importance of combining path-length and congestion information in making routing decisions to minimize total network connection blocking. The ACO algorithm achieves lower blocking rates than an exhaustive search over all available wavelengths for the shortest path.