DocumentCode
525994
Title
Notice of Retraction
An improved ant colony optimization algorithm for multiple QoS anycast routing
Author
Taoshen Li ; Meng Xiao
Author_Institution
Sch. of Comput., Guangxi Univ., Nanning, China
Volume
3
fYear
2010
fDate
12-13 June 2010
Firstpage
544
Lastpage
547
Abstract
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.
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.
Keywords
computational complexity; mobile communication; optimisation; quality of service; telecommunication network routing; transport protocols; IPv6; NP-complete problem; QoS constraints; ant colony optimization algorithm; anycast communication; global-best solution; local optimal path; multimedia information; multiple QoS anycast routing; network blocking probability; network traffic; polynomial time; standard communication model; Educational institutions; Ant colony optimization; Anycast; Quality of service (QoS); Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Communication Technologies in Agriculture Engineering (CCTAE), 2010 International Conference On
Conference_Location
Chengdu
Print_ISBN
978-1-4244-6944-4
Type
conf
DOI
10.1109/CCTAE.2010.5544351
Filename
5544351
Link To Document