An Anycast Routing Algorithm Based on the Combination of Genetic Algorithm and Ant Colony Algorithm

Article Preview

Abstract:

To solve anycast routing problem with multiple QoS constraints, a improved hybrid algorithm which combines genetic algorithm and ant colony algorithm is proposed. In the initial period of hybrid algorithm, genetic algorithm was used to distribute pheromones in links and code and optimize control parameters of ant colony algorithm. Through judgment function, this algorithm can judge the time to combine the genetic algorithm with ant colony algorithm, and initialize the pheromones and start the ant colony algorithm at the last period of hybrid algorithm. To avoid hybrid algorithm falling into local optimal solution, a mutation operator was introduced in algorithm hybrid to update local pheromones of new path produced by mutation operation and reduced pheromones concentration on optimal path in time. The NS2 simulation results show that this algorithm can commendably solve the anycast routing problem with multiple QoS constraints, and its performance is better than other two algorithms.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1324-1330

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S. Deering S, R. Hinden. Internet protocol Version 6 (IPv6) Specification, RFC 2460, Dec. (1998).

DOI: 10.17487/rfc2460

Google Scholar

[2] X. N. Wang: Source International Journal of Network Management, Vol. 18(2008), p.315.

Google Scholar

[3] W. J. Jia, D. Xuan, and W. Zhao: IEEE Communications Magazine, Vol. 38(2000), p.48.

Google Scholar

[4] C. P. Low, C. L. Tan: International Journal on Computer Communications, Vol. 26(2003), p.1541.

Google Scholar

[5] W. Krzysztof: Proceedings of 5th International Conference on Computational Science (2005), p.1092.

Google Scholar

[6] T. S. Li, S. Q. Chen, Y. Chen and J. E. Chen: Journal of Communication and Computer, Vol. 2(2005), p.54.

Google Scholar

[7] J. H. Holland. Adaptation in Natural and artificial Systems. Ann Arbor: The University of Michigan Press, (1975).

Google Scholar

[8] Y. H. Zhang, Y. B. Rao, M. T. Zhou: The Proceedings of 8th International Conference on Computer-Aided Industrial Design and Comceptual Design(2007), p.250.

Google Scholar

[9] M. Dorigo and C. Blumb: Theoretical Computer Science, Vol. 344(2005), p.243.

Google Scholar

[10] J. Carrillo, L. Marzo, L. Fabrege, and et al: Lecture Notes in computer science(2004), p.418.

Google Scholar

[11] L. Zhi, G. Z. Zhao, F. J. Su: 5th World Congress on Intelligent Control and Automation(2004), p.2694.

Google Scholar

[12] Y. T. Hsiao, C. L. Chuang and C. C. Chien: 12th IEEE International Conference on Network (2004), p.313.

Google Scholar

[13] M. Xiao, T. S. Li: Proceedings of 2009 4th International Conference on Computer Science and Education(2009), p.135.

Google Scholar

[14] J. L. Ding,Z. Q. Chen and Z. Z. , Yuan: Journal of Computer Research and Development, Vol. 40(2003), p.1351.

Google Scholar

[15] Dong Y F, Gu J H, Li N N, and et al: Proceedings of the Sixth International Conference on Machine Learning and Cybernetics(2007), p.999.

Google Scholar