scholarly journals A comparative study of multiobjective computational intelligence algorithms to find the solution to the RWA problem in WDM networks

DYNA ◽  
2015 ◽  
Vol 82 (194) ◽  
pp. 221-229
Author(s):  
Bryan Montes Castañeda ◽  
Jorge Patiño Garzón ◽  
Gustavo Puerto Leguizamón

This paper presents a comparative study of multiobjective algorithms to solve the routing and wavelength assignment problem in optical networks. The study evaluates five computational intelligence algorithms, namely: the Firefly Algorithm, the Differential Evolutionary Algorithm, the Simulated Annealing Algorithm and two versions of the Particle Swarm Optimization algorithm. Each algorithm is assessed based on the performance provided by two different network topologies under different data traffic loads and with a different number of wavelengths available in the network. The impact of implementing wavelength conversion processes is also taken into account in this study. Simulated results show that, in general, the evaluated algorithms appropriately solve the problem in small-sized networks in which a similar performance was found. However, key differences were found when the size of the network is significant. This means that more suitable algorithms optimize the search space and the fall into local minimums is avoided.

2016 ◽  
Vol 36 (1) ◽  
pp. 111-117 ◽  
Author(s):  
Jorge Patiño ◽  
Bryan Montes ◽  
Gustavo Puerto

<p>This paper presents an evaluation performance of computational intelligence algorithms based on the multiobjective theory for the solution of the Routing and Wavelength Assignment problem (RWA) in optical networks. The study evaluates the Firefly Algorithm, the Differential Evolutionary Algorithm, the Simulated Annealing Algorithm and two versions of the Particle Swarm Optimization algorithm. The paper provides a description of the multiobjective algorithms; then, an evaluation based on the performance provided by the multiobjective algorithms versus mono-objective approaches when dealing with different traffic loads, different numberof wavelengths and wavelength conversion process over the NSFNet topology is presented. Simulation results show that monoobjective algorithms properly solve the RWA problem for low values of data traffic and low number of wavelengths. However, the multiobjective approaches adapt better to online traffic when the number of wavelengths available in the network increases as well as when wavelength conversion is implemented in the nodes.</p>


2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Harpreet Kaur ◽  
Munish Rattan

AbstractWith the overwhelming use of the Internet, the wavelength division multiplexing (WDM) optical networks have become the major mode of communication for wide applications. Hence, the routing and wavelength assignment (RWA) for a given traffic in WDM networks is the chief challenge in optical networks. This paper presents the RWA problem in WDM networks using the hybrid algorithm of flower pollination (FP) and simulated annealing (SA) algorithm (FA+SA) with and without wavelength conversion capability at the nodes of the network. Comparative analysis with techniques presented in literature is also carried out, i. e. differential evolution algorithm (DEA), firefly algorithm (FA), particle swarm optimization with less number of informers (Psolbest), SA and genetic algorithm (GA). The results prove that hybrid algorithm of FP and SA is potentially more efficient than algorithms present in literature for the light path establishment in an optical network.


2014 ◽  
Vol 35 (4) ◽  
Author(s):  
A. F. Santos ◽  
R. C. Almeida ◽  
K. D. R. Assis

AbstractIn this paper we propose to use an iterative algorithm for optimizing the fixed-alternate shortest path routing in the dynamic routing and wavelength assignment (RWA) problem in wavelength routing optical networks. The algorithm performance is compared, in terms of blocking probability, with the Dijkstra and Yen traditional algorithms, as well as with the recently proposed best among the shortest routes (BSR) algorithm. The results suggest that it is feasible to choose an appropriate set of routes for each pair of nodes (source, destination), among the shortest paths and efficiently balance the network load. For all studied scenarios, the proposed heuristic achieved superior performance.


Sign in / Sign up

Export Citation Format

Share Document