Multicast Routing Using Genetic Algorithm Seen as a Permutation Problem

Authors:
Aluizio F. R. Araujo;Cicero Garrozi;Andre R. G. A. Leitao;Maury M. Jr Gouvea
Affiliations:
Federal University of Pernambuco, Brazil;Federal University of Pernambuco, Brazil;Federal University of Pernambuco, Brazil;Pontifical Catholic University, Minas Gerais, Brazil
Venue:
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Year:
2006

Citing 0
Cited 3

MulRoGA: A Multicast Routing Genetic Algorithm approach considering multiple objectives

Applied Intelligence
A novel multi-objective evolutionary algorithm for shortest path routing problem

International Journal of Communication Networks and Distributed Systems
A nondominated sorting genetic algorithm solution for shortest path routing problem in computer networks

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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 GÉANT 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.