A Multiple QoS Anycast Routing Algorithm based Adaptive Genetic Algorithm

摘要

The anycast is a new network addressing and routing scheme, and has been defined as a standard communication model in IPv6. By analyzing the characters of anycast service, an anycast routing model with multiple QoS constraints and a felicitous estimate function of the optimal route path are presented in this paper, and a multiple QoS anycast routing algorithm based adaptive genetic algorithm is proposed. This algorithm uses adaptive probabilities of crossover and mutation to solve the problem of computing probabilities of crossover and mutation over and over again in simple genetic algorithm. Using fitness scaling can guarantee the diversity of populations in process of running, and is beneficial to global optimal solution. The results of network experiment show that this algorithm is effective and available. It can satisfy the constrained condition of multiple QoS, balance network load fairly, and improve the quality of network service.