Multi-Constrained Anycast Routing Based on Ant Algorithm

[1]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[2]  Kagan Tumer,et al.  An Introduction to Collective Intelligence , 1999, ArXiv.

[3]  Weijia Jia,et al.  A Routing Protocol for Anycast Messages , 2000, IEEE Trans. Parallel Distributed Syst..

[4]  Stephen E. Deering,et al.  Internet Protocol, Version 6 (IPv6) Specification , 1995, RFC.

[5]  Marco Dorigo,et al.  Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..

[6]  Charles E. Perkins,et al.  Service Location Protocol , 1997, RFC.

[7]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[8]  Ying Wang,et al.  Ant colony optimization for multicast routing , 2000, IEEE APCCAS 2000. 2000 IEEE Asia-Pacific Conference on Circuits and Systems. Electronic Communication Systems. (Cat. No.00EX394).

[9]  Hiroshi Matsuo,et al.  Accelerated Ants Routing in Dynamic Networks , 2001 .

[10]  Lianyuan Li,et al.  A new dynamic distributed routing algorithm on telecommunication networks , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[11]  E. Gustafsson,et al.  A literature survey on traffic dispersion , 1997, IEEE Netw..

[12]  Masahito Yamamoto,et al.  Multiple Ant Colonies Algorithm Based on Colony Level Interactions , 2000 .

[13]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[14]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[15]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[16]  Weijia Jia,et al.  Integrated routing algorithms for anycast messages , 2000 .

[17]  Mostafa Ammar,et al.  QoS routing for anycast communications: motivation and an architecture for DiffServ networks , 2002, IEEE Commun. Mag..