Journal of Northeastern University ›› 2007, Vol. 28 ›› Issue (10): 1446-1449.DOI: -

• OriginalPaper • Previous Articles     Next Articles

QoS multicast routing based on chaotic genetic algorithm

Yue, Cheng-Jun (1); Zheng, Xiu-Ping (1); Jing, Yuan-Wei (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2007-10-15 Published:2013-06-26
  • Contact: Yue, C.-J.
  • About author:-
  • Supported by:
    -

Abstract: To overcome the drawback that the premature convergence is liable to take place in the process of optimal multicast tree searching by genetic algorithm, a chaotic genetic algorithm is proposed to inhibit the premature. Introducing the intrinsic stochastic property and ergodicity of chaos, the algorithm proposed employs the chaotic perturbation in GA to operate the population with a mutation-like chaotic perturbation when judging that the premature happens. Thus, the population becomes more diverse and the premature convergence can be overcome effectively with GA's ability in global search kept and algorithm performance greatly improved. Simulation results showed that the proposed algorithm can also build an optimal multicast tree efficiently and quickly to meet the requirement of QoS restriction.

CLC Number: