DocumentCode :
1686304
Title :
Multicast routing using genetic algorithm seen as a permutation problem
Author :
Araújo, Aluizio F R ; Garrozi, Cícero ; Leitao, André R G A ; Gouvea, Maury M., Jr.
Author_Institution :
Center of Informatics, Univ. Fed. de Pernambuco, Recife, Brazil
Volume :
1
fYear :
2006
Abstract :
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.
Keywords :
genetic algorithms; multicast communication; telecommunication network routing; wide area networks; European GEANT WAN network; genetic algorithm; multicast routing; permutation problem; source-destination routes; wide area network; Computational efficiency; Costs; Genetic algorithms; Informatics; Performance evaluation; Space exploration; Testing; Wavelength division multiplexing; Wavelength routing; Wide area networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Information Networking and Applications, 2006. AINA 2006. 20th International Conference on
ISSN :
1550-445X
Print_ISBN :
0-7695-2466-4
Type :
conf
DOI :
10.1109/AINA.2006.237
Filename :
1620235
Link To Document :
بازگشت