An Improved Ant Colony Algorithm for Probabilistic QoS Routing
- 10.2991/csss-14.2014.105How to use a DOI?
- ant colony algorithm; probability; QoS; routing algorithm
The actual dynamic network environment urgently requires us to give full consideration to the non-precision of the network state when we design the QoS routing algorithm. Mainly by substituting the piecewise function for the probability constant which is chosen by ants when a route is selected, changing pheromone update rule and introducing definition of the ant age, this paper improves the ant colony algorithm for probabilistic QoS routing. Under the case study, the simulation shows that the improved algorithm can find the optimal solution 100% if the case has the best one. This result is much better than the one obtained by the basic ant colony algorithm. The improved algorithm can solve the probabilistic QoS network routing problem effectively.
- © 2014, 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/).
Cite this article
TY - CONF AU - Ding Genhong AU - Guo Dongwei AU - Ding Yuchen PY - 2014/06 DA - 2014/06 TI - An Improved Ant Colony Algorithm for Probabilistic QoS Routing BT - Proceedings of the 3rd International Conference on Computer Science and Service System PB - Atlantis Press SP - 447 EP - 450 SN - 1951-6851 UR - https://doi.org/10.2991/csss-14.2014.105 DO - 10.2991/csss-14.2014.105 ID - Genhong2014/06 ER -