The purpose of the research reported in this chapter is to meet the increasing and rapidly changing communication demands in a private telecommunication network. The goal is to improve the performance of a telecommunication system just by changes in its software components. The network topology and the trunk capacities are viewed as fixed parameters, because a change in these components is very expensive. The algorithm of how to use this network is stored in a routing table that consists of alternative paths between the nodes that are supposed to be connected. So the goal of the evolutionary algorithm is to find a routing table that increases the performance of the network by reducing the probability of end-to-end-blocking. The investigated non-hierarchical networks require a fixed alternate routing (FAR) with sequential office control (SOC). The chapter presents a new approach based on evolutionary algorithms to solve this problem.
[1]
Thomas Bäck,et al.
Evolutionary Algorithms in Theory and Practice
,
1996
.
[2]
Thomas Bäck,et al.
Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms
,
1996
.
[3]
Andre Girard,et al.
Routing and Dimensioning in Circuit-Switched Networks
,
1990
.
[4]
Lawrence Davis,et al.
A Genetic Algorithm for Survivable Network Design
,
1993,
International Conference on Genetic Algorithms.
[5]
David B. Fogel,et al.
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
,
1995
.
[6]
Zbigniew Michalewicz,et al.
Genetic Algorithms + Data Structures = Evolution Programs
,
1996,
Springer Berlin Heidelberg.