By Topic

Scalable network planning for elastic optical orthogonal frequency division multiplexing (OFDM) 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
$33 $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)
Wei Lu ; School of Information Science and Technology, University of Science and Technology of China, Hefei, China ; Xiang Zhou ; Long Gong ; Zuqing Zhu

We propose to achieve scalable O-OFDM network planning with a genetic algorithm (GA) that operates in an adaptive way for high optimization efficiency. When the network topology and lightpath requests are given, the GA encodes the routing, spectrum and modulation assignments (RSMA) as genes and optimizes them iteratively. Both the crossover and mutation schemes in our proposed GA operate adaptively based on the fitness of individuals. Specifically, when the individuals are not fit yet, their genes can be modified significantly with crossover and mutation. On the other hand, for individuals that are already fit, we limit the crossover and mutation rate to avoid chromosomal disruption. The simulation results with the NSFNET topology and up to 1000 lightpath requests show that the proposed adaptive GA converges faster with better optimization performance, when comparing to a non-adaptive one. For the 1000-request case, the proposed algorithm can converge with a relatively small population size (e.g. 50) within 80 generations.

Published in:

Communication Systems, Networks & Digital Signal Processing (CSNDSP), 2012 8th International Symposium on

Date of Conference:

18-20 July 2012