Multicast Routing Based on Information Entropy Multi-population Genetic Algorithm
Yuanwei Jing · Jisuanji gongcheng · 2009
Taking account of the uncertain information and the unbalance of link results in the congestion of network,a Genetic Algorithm(GA) with the information entropy is presented to solve the problem in the multicast routing.The algorithm begins from a least-delay tree,searches the max information entropy multicast tree in the multi-population,and gets final multicast tree satisfying delay constraint and the least balance.The results show that the proposed algorithm performs better in terms of delaying a running time against existing heuristics algorithm,and constructs optimal delay-constrained and balance multicast tree efficiently.