The Research on QoS Routing Algorithm Based on Improved Optimization Sorting Ant Colony Algorithm

DOI

10.2991/nceece-15.2016.88How to use a DOI?

Keywords

Ant colony algorithm; QoS; Optimized sequence

Abstract

In ordering to resolve the slow convergence problem of ant colony algorithm in QoS routing, this paper presents a sort of ant colony algorithm which based on optimized sequence. In global pheromone updating, this algorithm weakens the influence of a single iteration solution and adopt a combination of the optimal solution within the scope of the iteration, which could make ant still choose the best path toward a particular direction when a poor solution occurs. At last, the simulation experiments proves that convergence rate of this improved ant colony algorithm works significantly faster, and stability has been greatly improved.

Copyright

© 2016, 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  - ChunHui Qiu
AU  - Yue Gong
AU  - KaiXi Zhou
PY  - 2015/12
DA  - 2015/12
TI  - The Research on QoS Routing Algorithm Based on Improved Optimization Sorting Ant Colony Algorithm
BT  - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering
PB  - Atlantis Press
SP  - 448
EP  - 452
SN  - 2352-5401
UR  - https://doi.org/10.2991/nceece-15.2016.88
DO  - 10.2991/nceece-15.2016.88
ID  - Qiu2015/12
ER  -