Improved anycast QoS routing algorithm based on genetic algorithm

2010 ◽  
Author(s):  
Shi Rui ◽  
Bai Chen-Xi ◽  
Shen Shi-Lei ◽  
He Xin
Keyword(s):  
Genetic Algorithm ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Qos Routing Algorithm

An Improved Anycast QoS Routing Algorithm Based on Chaos Genetic Algorithm

2014 ◽  
Vol 513-517 ◽  
pp. 2157-2160
Author(s):  
Rui Shi ◽  
Hui Zhao
Keyword(s):  
Genetic Algorithm ◽  
Low Cost ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Optimal Solutions ◽  
Simulation Data ◽  
Good Ability ◽  
Qos Routing Algorithm ◽  
Cost Paths ◽  
Chaos Genetic Algorithm

To overcome the problem of tending to converge to part in anycast QoS routing based on Genetic Algorithm, a new improved anycast QoS routing algorithm based on Genetic Algorithm is proposed which adopt the improved chaotic disturbance operator. The simulated result shows that this algorithm has a good ability of global search, and it can find a set of low-cost paths with bandwidth constraints and delay requirements efficiently and quickly. By comparing the simulation data, the success rate of finding the optimal solutions is improved, and the larger network scale, its advantage is more obvious.

Sign in / Sign up

Export Citation Format

Share Document