Applying an evolutionary algorithm to telecommunication network design

This paper deals with the application of evolutionary computation to telecommunication network design. Design of a two-layer network is considered, where the upper-layer (UL) network uses resources of the lower-layer (LL) network. UL links determine demands for the LL and are implemented using LL paths (admissible paths). Within a fixed LL network topology, given the demands and admissible paths, we aim to find the LL link capacities for implementing the UL links, minimizing the cost of the LL. Robust design issues are also taken into consideration, allowing for failure of a certain part of the LL and postulating that, after some re-allocation in the LL, demands are still realized to an assumed extent. An algorithm based on an evolutionary technique is introduced, with problem-specific genetic operators to improve computing efficiency. A theoretical study of properties of the operators is made and several experiments are performed to tune the parameters of the algorithm. Finally, its performance is compared with other design techniques, including integer programming.

[1]  Piet Demeester,et al.  A genetic algorithm for solving the capacitated survivable network design problem , 1997 .

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  T. Back.  Selective pressure in evolutionary algorithms: a characterization of selection mechanisms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[4]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Artur Tomaszewski,et al.  A Lower Bound Based Approach to the Design of Meshed Networks with Protected Transmission Paths , 1994 .

[7]  Emile H. L. Aarts,et al.  Global optimization and simulated annealing , 1991, Math. Program..

[8]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

[9]  S. Kozdrowski,et al.  Population initialization in the context of a biased, problem-specific mutation , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[10]  Schloss Birlinghoven,et al.  How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .

[11]  Michal Pióro,et al.  Solving multicommodity integral flow problems by simulated allocation , 1997, Telecommun. Syst..

[12]  Mark Weiss.  Algorithms, Data Structures, and Problem Solving With C++ , 1996 .

[13]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[14]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[15]  Deep Medhi,et al.  A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..

[16]  J. Reed,et al.  Simulation of biological evolution and machine learning. I. Selection of self-reproducing numeric patterns by data processing machines, effects of hereditary control, mutation type and crossing. , 1967, Journal of theoretical biology.

[17]  K. R. Krishnan,et al.  Unified Models of Survivability for Multi-Technology Networks , 1994 .