Routing and wavelength assignment over WDM optical networks: a comparison between MOACOs and classical approaches

Authors:
Adolfo Arteta;Benjamí/n Bará/n;Diego Pinto
Affiliations:
Catholic University of Asunció/n, Asunció/n/ Paraguay;National University of Asunció/n, Catholic University of Asunció/n, San Lorenzo/ Paraguay;National University of Asunció/n, San Lorenzo/ Paraguay
Venue:
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
Year:
2007

Citing 11
Cited 6

Some principles for designing a wide-area WDM optical network

IEEE/ACM Transactions on Networking (TON)
The ant colony optimization meta-heuristic

New ideas in optimization
MAX-MIN Ant system

Future Generation Computer Systems
A Population Based Approach for ACO

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations

Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results

Evolutionary Computation
Solving multiobjective multicast routing problem with a new ant colony optimization approach

LANC '05 Proceedings of the 3rd international IFIP/ACM Latin American conference on Networking
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
WDM optical communication networks: progress and challenges

IEEE Journal on Selected Areas in Communications
Dynamic routing and assignment of wavelength algorithms in multifiber wavelength division multiplexing networks

IEEE Journal on Selected Areas in Communications
A survey of multicasting protocols for broadcast-and-select single-hop networks

IEEE Network: The Magazine of Global Internetworking

Routing and wavelength assignment with crankback re-routing extensions by means of ant colony optimization

IEEE Journal on Selected Areas in Communications
A multiobjective gravitational search algorithm applied to the static routing and wavelength assignment problem

EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
Tackling the static RWA problem by using a multiobjective artificial bee colony algorithm

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Using a multiobjective OpenMP+MPI DE for the static RWA problem

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
An evolutionary programming algorithm for survivable routing and wavelength assignment in transparent optical networks

Information Sciences: an International Journal
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

The increasing demand of bandwidth has found an answer in Optical Transport Networks (OTN). To take advantage of the different resources that OTNs offer, several parameters need to be optimized to obtain good performance. Therefore, this work studies the Routing and Wavelength Assignment (RWA) problem in a multiobjective context. MultiObjective Ant Colony Optimization (MOACO) algorithms are implemented to simultaneously optimize the hop count and number of wavelength conversion for a set of unicast demands, considering wavelength conflicts. This way, a set of optimal solutions, known as Pareto Set, is calculated in one run of the proposed algorithm, without a priori restrictions on some objective. The proposed MOACO algorithms were compared to classical RWA heuristics using several performance metrics. Although, there is not a clear superiority, simulation results indicate that considering most of the performance metrics, MOACO algorithms obtain promising results when compared to the classical heuristics.