The Community for Technology Leaders
2013 IEEE International Conference on Granular Computing (GrC) (2007)
San Jose, California
Nov. 2, 2007 to Nov. 4, 2007
ISBN: 0-7695-3032-X
pp: 471
Constrained QoS multicast routing for Networks is an NP-hard problem. Classical approaches of multicast routing consider a tree path whose computational cost entails high use of resources such as time and memory. This paper presents a chaotic optimization adaptive genetic algorithm applied to the multicast routing problem, in which no tree is built. The major objectives of this study are: To modify the encoding to be suitable for the multicast routing problem ;To develop a adaptive solution to this problem, New options of fitness functions, variation and selection operators were proposed to increase the ability to generate feasible routes; To compare the performance of the proposed algorithm with some existing multicast routing algorithm. The simulations were performed for several networks with different network and multicast sizes. The results suggest promising performance for this approach. Keyword ?multicast routing; quality of service; chaotic optimization; adaptive genetic algorithm
Changbing Li, Yong Wang, Maokang Du, Changjiang Yue, "Multicast Routing Scheme Based on Chaotic Optimization Adaptive Genetic Algorithm", 2013 IEEE International Conference on Granular Computing (GrC), vol. 00, no. , pp. 471, 2007, doi:10.1109/GrC.2007.65
89 ms
(Ver 3.3 (11022016))