Multi-hour network planning based on domination between sets of traffic matrices
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new approach to optical networks security: attack-aware routing and wavelength assignment
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks
Photonic Network Communications
(Non-)reconfigurable virtual topology design under multihour traffic in optical networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converters. The objective is to minimize the number of wavelengths used. This problem has been shown to be NP-complete so heuristic algorithms have been developed to solve it suboptimally. Suggested is a tabu search algorithm along with two simple and fast greedy algorithms for the RWA SLD problem. We compare the proposed algorithms with an existing tabu search algorithm for the same problem and with lower bounds derived in this paper. Results indicate that the suggested algorithms not only yield solutions superior in quality to those obtained by the existing algorithm, but have drastically shorter execution times