On anycast routing based on parallel evolutionary algorithm

Anycast is a new communication service for the transmission of data from a source node to (any) one member in a group of designated recipients in a network. Using anycast services may considerably simplify some applications. In this paper, an anycast routing algorithm based on parallel evolutionary algorithm (ARBPEA) is proposed. According to the formulation of anycast routing problem, the initial population is divided into several sub-populations in accordance with the size of anycast group, and a migration strategy for transferring the elitist routes among sub-populations is presented to obtain the optimum route. In the meanwhile, better penalty functions of QoS constraints are introduced to evaluate a route´s satisfaction degree of clients´ QoS requirements. At last, Simulation results show that our algorithm can achieve better performance on the delay and bandwidth.