Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Lightpath establishment in wavelength-routed WDM optical networks
Optical networks
Optical networks
Allocation of wavelength converters in all-optical networks
Optical networks
Crosstalk-Aware Wavelength Assignment in Dynamic Wavelength-Routed Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Benefits of Link Protection at Connection Granularity
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Benefits of wavelength conversion in optical WDM mesh networks with dynamic routing
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Benefits of partial reconfigurability in circuit-switched WDM networks
Journal of High Speed Networks
Power-efficient multi-layer networking: design and evaluation
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Wavelength assignment for satisfying maximal number of requests in all-optical networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Approximate analysis of limited-range wavelength conversion all-optical WDM networks
Computer Communications
Applying MOEAs to solve the static Routing and Wavelength Assignment problem in optical WDM networks
Engineering Applications of Artificial Intelligence
| Hi-index | 0.01 |
We propose an on-line wavelength assignment algorithm for multi-fiber WDM networks, in which lightpaths are established and released dynamically. For a given number of fibers per link and number of wavelengths per fiber, the algorithm aims to minimize the blocking probability. It may also be used to reduce the number of wavelengths required for a given tolerable blocking probability. Simulation results show that our wavelength assignment algorithm performs better than other previously proposed algorithms (in the cases we studied). As the number of fibers per link increases, the benefit of having wavelength converters decreases dramatically, and the performance improvement of our algorithm over others increases. Our results also show that in case a preferred path is not available, rerouting along a node-disjoint backup path can significantly reduce the blocking probability.