A two-stage genetic algorithm for the multi-multicast routing

Authors:
Xuan Ma;Limin Sun;Yalong Zhang
Affiliations:
School of Automation and Information Enginerring, Xi'an University of Technology, Xi'an, China;School of Automation and Information Enginerring, Xi'an University of Technology, Xi'an, China;School of Automation and Information Enginerring, Xi'an University of Technology, Xi'an, China
Venue:
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Year:
2007

Citing 5
Cited 0

Hierarchical Distributed Genetic Algorithms: A Fuzzy Logic Controller Design Application

IEEE Expert: Intelligent Systems and Their Applications
A Degree-Delay-Constrained Genetic Algorithm for Multicast Routing Tree

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
A genetic-inspired multicast routing optimization algorithm with bandwidth and end-to-end delay constraints

ICONIP'06 Proceedings of the 13th international conference on Neural information processing - Volume Part III
A genetic algorithm for the multiple destination routing problems

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multi-multicast routing problem is to find a set of multicasts which allows transmission and routing of packets from many sources to many destinations. Due to the amount of residual bandwidth of a link, the problem becomes complicated. This paper presents an approach to solve the problem based on a two-stage genetic algorithm. The problem is decomposed into two objectives, the primary objective is to find a multicast group from a source to its destinations satisfied bandwidth and delay constraints, and the secondary objective is to find an optimal combinatorial solution in all multicasts. For the objectives, two evolving modules are designed. In the first module a method of encoding tree-like chromosome, and corresponding crossover and mutation operator are presented. The numerical simulation shows that the algorithm is efficient to solve the multi-multicast routing problem.