Genetic Algorithm Based on Compression Critical Cost Path for Solving QOS Multicast Tree
This paper aims at the poor efficiency problem that real-time construct a better performance QOS multicast tree as nodes are changed dynamically in real network,presents a genetic algorithm based on compressing critical cost path. The algorithm adjusts nodes on the critical cost path in a way of memory and intelligence to increase the probability of searching a high-performance multicast tree. In this paper,improved genetic algorithm with based on compressing critical path of cost is algorithm with high performance,high efficiency and high reliability,It has obvious effect for solving the problem of QOS multicast tree. Many simulation experiments have shown that proposed algorithm is better than general genetic algorithm in convergence rate of globe searching,when the nodes are changed dynamically in the network.
QOS Multicast tree Genetic Algorithm Critical Cost path Compressing Critical cost path
Ma Haibo He Qing
Software Technology Institute,Dalian Jiaotong University,Dalian 116028,China
国际会议
南宁
英文
74-77
2010-12-10（万方平台首次上网日期，不代表论文的发表时间）