Multicast routing using genetic algorithm seen as a permutation problem

Autor:	Cícero Garrozi, A.R.G.A. Leitao, Aluizio F. R. Araújo, M.M. Gouvea
Rok vydání:	2006
Předmět:	Tree (data structure) Static routing Multicast Protocol Independent Multicast Computer science Wide area network Distributed computing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Genetic algorithm Distance Vector Multicast Routing Protocol Xcast Routing (electronic design automation)
Zdroj:	AINA (1)
DOI:	10.1109/aina.2006.237
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2569d5d4163e62f6b3054b505af96229 https://doi.org/10.1109/aina.2006.237 Zobrazit plný text záznamu