Notice of RetractionAn improved ant colony optimization algorithm for multiple QoS anycast routing

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

Anycast communication has been defined as a standard communication model of IPv6. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can´t get satisfying results when using the precise method in polynomial time. In this paper, a QoS anycast routing algorithm based on ant colony optimization is proposed. This algorithm regulates the pheromone on the best path and adopts resetting method and candidate set strategy to avoid falling into local optimal path and expand searching space of ant colony. The simulation results show that the algorithm can find the global-best solution satisfied the QoS constraints quickly, and balance network traffic reasonably. It can reduce network blocking probability and improve transmitting capacity of multimedia information.