Multicast routing using genetic algorithm seen as a permutation problem

Classical approaches of multicast routing consider a tree path whose computational cost entails high use of resources such time and memory in the optimization process. This paper presents a genetic algorithm model applied to the multicast routing problem, in which no tree is built. The solution aims...

Full description

Saved in:
Bibliographic Details
Published in20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06) Vol. 1; pp. 6 pp. - 484
Main Authors Araujo, A.F.R., Garrozi, C., Leitao, A.R.G.A., Gouvea, M.M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2006
Subjects
Computational efficiency
Costs
Genetic algorithms
Informatics
Performance evaluation
Space exploration
Testing
Wavelength division multiplexing
Wavelength routing
Wide area networks
Online AccessGet full text

Cover

More Information
Summary:Classical approaches of multicast routing consider a tree path whose computational cost entails high use of resources such time and memory in the optimization process. This paper presents a genetic algorithm model applied to the multicast routing problem, in which no tree is built. The solution aims to maximize common paths in source-destinations routes and to minimize the route sizes. New options of fitness functions, variation and selection operators were proposed to increase the ability to generate feasible routes. The simulations were performed in two networks: the 33-node European GEANT WAN network to assess the capacity to find viable solutions and a 100-node network to test the capacity to handle larger networks. The results suggest promising performance for this approach.
ISBN:9780769524665
0769524664
ISSN:1550-445X
2332-5658
DOI:10.1109/AINA.2006.237