Improving network migration optimization utilizing memetic algorithms

In this paper we describe the basics of the network migration problem, as well as the solution of the problem using meta heuristics. The class of heuristics described and applied in this paper is called memetic algorithms. Those are explained and results regarding network migration are presented. To evaluate potential algorithm candidates a generic TSP has been implemented and tested. The mapping of the network migration problem to memetic algorithms and to the algorithm library GALib is explained as well. Our main goal is the optimization of network migration costs, by respecting increasing demands over the migration period, while device costs per bit are decreasing. The mapping of the specified problem to the heuristic variants is also of major interest.

[1]  Jeffrey Horn,et al.  The nature of niching: genetic algorithms and the evolution of optimal, cooperative populations , 1997 .

[2]  I ScottKirkpatrick.  Optimization by Simulated Annealing: Quantitative Studies , 1984 .

[3]  Ole J. Mengshoel,et al.  Generalized crowding for genetic algorithms , 2010, GECCO '10.

[4]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[5]  Mohit Chamania,et al.  Network planning, control and management perspectives on dynamic networking , 2009, 2009 35th European Conference on Optical Communication.

[6]  Scott Kirkpatrick,et al.  Optimization by simulated annealing: Quantitative studies , 1984 .

[7]  Ralf Lehnert,et al.  Network migration using ant colony optimization , 2010, 2010 9th Conference of Telecommunication, Media and Internet.

[8]  Adrian Hopgood.  Genetic Algorithms for Optimization , 2011 .

[9]  Ralf Lehnert,et al.  Approaches for the migration of optical backbone networks towards Carrier Ethernet , 2009, 2009 IEEE Globecom Workshops.

[10]  Sofie Verbrugge.  Strategic planning of optical telecommunication networks in a dynamic and uncertain environment , 2007 .

[11]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[12]  Bo Yuan.  Deterministic crowding, recombination and self-similarity , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[13]  Rico Radeke,et al.  Optimization of Energy Efficient Network Migration Using Harmony Search , 2011, EUNICE.

[14]  Ying Liu,et al.  Network Migration Optimization Using Genetic Algorithms , 2012, EUNICE.