This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 IEEE International Conference on Granular Computing (GRC 2007)
Multicast Routing Scheme Based on Chaotic Optimization Adaptive Genetic Algorithm
San Jose, California
November 02-November 04
ISBN: 0-7695-3032-X
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
Citation:
Changbing Li, Yong Wang, Maokang Du, Changjiang Yue, "Multicast Routing Scheme Based on Chaotic Optimization Adaptive Genetic Algorithm," grc, pp.471, 2007 IEEE International Conference on Granular Computing (GRC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.