|
|
|
| An Anycast Routing Based on Improved Ant Colony Algorithm |
| Li Ling-zhi①②; Zheng Hong-yuan①; Ding Qiu-lin① |
| ①College of Infor. Sci. and Tech., Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China; ②College of Comp. Sci. and Tech., Soochow University, Suzhou 215006, China |
|
|
|
|
Abstract In order to implement multi-destination and multi-path anycast routing on the heavy load network, an anycast routing based on improved ant colony algorithm is proposed in this paper according to the similar between ant searching path and anycast routing. When the pheromone trails is simulated by the history information of the forwarded packet, it is added that the food distributing smells is simulated by the destination address flooding load information, so every node can receive the latest information of links and servers. Tables of probabilities are created by nodes based on pheromone, smell and visibility. Tables act as the basis that the succeeding ants choose the routes. This routing algorithm is simulated by NS-2. The test result indicates that it can reduce the delay of transmission, decrease the fluctuating range of severs load, implement the load-balancing of links, increase the capability of networks transmission, and improve the scalability of anycast service.
|
|
Received: 22 June 2005
|
|
|
|
|
|
|
|
|
2007, Vol. 29 
