Cart (Loading....) | Create Account
Close category search window
 

Multiobjective Metaheuristics for Traffic Grooming in Optical Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rubio-Largo, A. ; Dept. of Comput. & Commun. Technol., Univ. of Extremadura, Caceres, Spain ; Vega-Rodriguez, M.A. ; Gomez-Pulido, J.A. ; Sanchez-Perez, J.M.

Currently, wavelength division multiplexing technology is widely used for exploiting the huge bandwidth of optical networks. It allows simultaneous transmission of traffic on many nonoverlapping channels (wavelengths). These channels support traffic demands in the gigabits per second (Gb/s) range; however, since the majority of devices or applications only require a bandwidth of megabits per second (Mb/s), this is a waste of bandwidth. This problem is efficiently solved by multiplexing a number of low-speed traffic demands (Mb/s) onto a high-speed wavelength channel (Gb/s). This is known as the traffic grooming problem. Since traffic grooming is an NP-hard problem, in this paper, we propose two novel multiobjective evolutionary algorithms for solving it. The selected algorithms are multiobjective variants of the standard differential evolution (DEPT) and variable neighborhood search. With the aim of ensuring the performance of our proposals, we have made comparisons with the well-known fast Nondominated Sort Genetic Algorithm (NSGA-II), Strength Pareto Evolutionary Algorithm 2, and other approaches published in the literature. After performing diverse comparisons, we can conclude that our novel approaches obtain promising results, highlighting in particular the performance of the DEPT algorithm.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:17 ,  Issue: 4 )

Date of Publication:

Aug. 2013

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.