Adaptive genetic algorithm for multiple QoS anycast routing

As a new network addressing and routing scheme, anycast has been defined as a standard communication model in IPv6. The multiple QoS constrained anycast routing problem is a nonlinear combination optimization problem, which is proved to be a NP complete problem. This paper studies anycast routing technology with multiple QoS constraints and proposes a multiple QoS anycast routing algorithm based adaptive genetic algorithm. This algorithm uses adaptive probabilities of crossover and mutation over and over again in simple genetic algorithm. Fitness scaling can guarantee the diversity of populations, which is beneficial to find global optimal solution. Simulation results show the efficiency of our algorithm. It can satisfy the constrained condition of multiple QoS, balance network load fairly, and improve the quality of network service.