Research On Anycast Routing Algorithm With Multiple QoS Parameters Constraint

Anycast is a new kind of network services in the Internet, and it is a new feature of IPv6. Through anycast address, users access to the closest server host of sets, which are denoted by this anycast address. With the rapid development of network technology, some businesses about audio, video and other streaming media have higher requirement for quality of service (QoS). How to implement many QoS in anycast networks has becomes a research hotspot.The current anycast routing algorithms cann't meet the demand for real-time business for characteristic of network, such as delay, delay jitter and packet loss rate, etc. Therefore, the researches in this thesis focus on the anycast route.Anycast QoS routing algorithm balancing Network load based tabu search is proposed. In view of the more network nodes, the worse QoS will be, the algorithm import value transform function. Which transform two dimensions values with bandwidth and delay-constrained into one dimension value. That simplifies the complexity of solving object function and improves searching precision. During searching, the algorithm use value of network and load balancing as object function, so that routing cost is less and the distribution of load balancing is better, thus enhancing the efficient of network resources, reducing network costs, and improve network performance.Anycast routing algorithm with solution of multiple QoS constraints bases on hybrid genetic algorithm(HGA) is proposed. According to the difference of adaptive degree is not obvious in HGA's latter part of biological evolution, the algorithm adopt simulated annealing algorithem to converge high advantage, and improve adaptive degree, in order to increase the difference of adaptive degree in biological individual latter. Therefore the algorithm can select excellent individual to inherit. This algorithm speed up the convergence rate and improve local convergence performance of genetic algorithm, and has a good solution effects. It can find minimum cost anycast routing tree which meets the delay, and delay jitter requirements.Simulation results prove that the delay which the first algorithm calculated is almost same as Anycast-Routing, but the first algorithm can balance the efficient of network resources, improve network performance and reduce network cost. Evolutional algebra which the Second algorithm calculated is also same as MDA algorithm; the second algorithm can meet the request of multi-constrained Qos anycast, in order to entirely convergence. Therefore, the two algorithms are effective and feasible.