Anycast QoS Routing Algorithm Based on Genetic Algorithm with Chaos
To overcome the problem of tending to converge to part in anycast QoS routing based on Genetic Algorithm, the paper proposed a new improved anycast QoS routing algorithm based on Generic Algorithm which adopt the chaotic disturbance operator and the idea of dissimilarity. The simulated result shows that this algorithm has a good ability of global search > and it can also find a set of low-cost paths with bandwidth constraints and delay requirements efficiently and quickly. By comparing the simulation data to prove that the algorithm has a faster convergence rate, and improved the success rate of finding the optimal solutions.
Chaos Anycast Genetic Algorithm Qos Dissimilarity
Shi Rui Zhao Hui
Computing Center Henan University Kaifeng, P.R. China
国际会议
太原
英文
16-19
2011-02-26(万方平台首次上网日期,不代表论文的发表时间)