Routing Optimization By Concurrent Genetic Algorithms
Price
Free (open access)
Volume
11
Pages
8
Published
1995
Size
798 kb
Paper DOI
10.2495/ASE950081
Copyright
WIT Press
Author(s)
A. Genco, S. Lopes, G. Lo Re & M. Tartamella
Abstract
A parallel implementation of genetic algorithms is applied to routing protocols with low bandwidth consumption. In particular, the paper discusses the (LSP) link state packet protocols. The first part of the paper deals with network topology and transmission parameters, together with the structure for storing the network. The second part discusses the Genetic Algorithm implementation. To this end, it considers the generation of the initial population that is a subset of all the possible paths connecting couples of nodes. As far as the mating and mutation policy is concerned, a strategy is proposed that allows the algorithm to replace segments of the
Keywords