Anycast Routing Algorithm With The chaotic Disturbance

DOI

10.2991/icmmita-15.2015.13How to use a DOI?

Keywords

Anycast; Genetic Algorithm; Chaos; Convergence Rate

Abstract

There is a problem of partial convergence in anycast routing based on genetic algorithm, therefore an improved anycast routing algorithm is proposed in this paper. The chaotic disturbance operator is adopted in the improved algorithm. The simulation results show that the proposed algorithm has a faster convergence rate, better ability of global search, and a set of low-cost paths with band constraints. The problem of partial convergence based on genetic algorithm is better solved. By comparing the simulation data, the success rate for finding the optimal solutions is improved, its advantage is more obvious for the larger networks.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Baolong Zhang
AU  - Haiyan Huang
PY  - 2015/11
DA  - 2015/11
TI  - Anycast Routing Algorithm With The chaotic Disturbance
BT  - Proceedings of the 2015 3rd International Conference on Machinery, Materials and Information Technology Applications
PB  - Atlantis Press
SP  - 58
EP  - 61
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmita-15.2015.13
DO  - 10.2991/icmmita-15.2015.13
ID  - Zhang2015/11
ER  -