Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

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 heurist...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2006-08, Vol.24 (8), p.2-15
Main Author: Skorin-Kapov, N.
Format: Article
Language:English
Subjects:
Algorithms
Demand
Heuristic algorithms
Heuristic methods
Intelligent networks
Marketing
Optical communication
Optical fiber networks
Optical wavelength conversion
Routing (telecommunications)
Scheduling algorithm
Superluminescent diodes
Tabu search
Telecommunication network topology
Wavelength assignment
Wavelength division multiplexing
Wavelength routing
Wavelengths
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2006.1677251