A heuristic algorithm for lightpath scheduling in next-generation WDM optical networks

Authors:
Goran Marković;Vladanka Aćimović-Raspopović;Valentina Radojičić
Affiliations:
Department of Telecommunication Traffic and Networks, The Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia 11000;Department of Telecommunication Traffic and Networks, The Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia 11000;Department of Telecommunication Traffic and Networks, The Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia 11000
Venue:
Photonic Network Communications
Year:
2012

Citing 10
Cited 1

Virtual-topology adaptation for WDM mesh networks under dynamic traffic

IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in optical networks

IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks based on the bee colony optimization

AI Communications - Network Analysis in Natural Sciences and Engineering
Survivable scheduled service provisioning in WDM optical networks with iterative routing

Optical Switching and Networking
Resource provisioning for survivable WDM networks under a sliding scheduled traffic model

Optical Switching and Networking
Toward automated provisioning of advance reservation service in next-generation optical internet

IEEE Communications Magazine
A practical approach for routing and wavelength assignment in large wavelength-routed optical networks

IEEE Journal on Selected Areas in Communications
Routing and wavelength assignment of scheduled lightpath demands

IEEE Journal on Selected Areas in Communications
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks

IEEE Journal on Selected Areas in Communications - Part Supplement
Network Dimensioning under Scheduled and Random Lightpath Demands in All-Optical WDM Networks

IEEE Journal on Selected Areas in Communications - Part Supplement

Applying MOEAs to solve the static Routing and Wavelength Assignment problem in optical WDM networks

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the routing and wavelength assignment (RWA) problem of scheduled lightpath demands (SLDs) in all-optical wavelength division multiplexing networks with no wavelength conversion capability. We consider the deterministic lightpath scheduling problem in which the whole set of lightpath demands is completely known in advance. The objective is to maximize the number of established lightpaths for a given number of wavelengths. Since this problem has been shown to be NP complete, various heuristic algorithms have been developed to solve it suboptimally. In this paper, we propose a novel heuristic RWA algorithm for SLDs based on the bee colony optimization (BCO) metaheuristic. BCO is a newborn swarm intelligence metaheuristic approach recently proposed to solve complex combinatorial optimization problems. We compare the efficiency of the proposed algorithm with three simple greedy algorithms for the same problem. Numerical results obtained by numerous simulations performed on the widely used realistic European Optical Network topology indicate that the proposed algorithm produces better-quality solutions compared to those obtained by greedy algorithms. In addition, we compare the results of the BCO---RWA---SLD algorithm with four other heuristic/metaheuristic algorithms proposed in literature to solve the RWA problem in the case of permanent (static) traffic demands.