Ant Colony Algorithm for Solving the Multicast Routing Problem with QoS Constraints
- https://doi.org/10.2991/isrme-15.2015.434How to use a DOI?
- Multicast Routing Algorithm; Multicast Tree; Ant Colony Algorithms
With the development of multimedia network, more and more real-time multimedia applications require a network capable of satisfying QoS constraints such as delay and bandwidth bound so that the messages reach each destination node at almost the same time within a certain specified time limit. Therefore, an Ant colony algorithm for solving multicast routing problem with QoS constraints is proposed. In the algorithm, group ants carry out searching separately and alternate information after one search. After a period of time, the rotary table is adapted to choosing a path and avoids stagnation, and the optimal one is selected from the paths by combining with multi-constrained QoS. Computer experiments show that the algorithm has a better performance and establish the multicast tree quickly.
- © 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/).
Cite this article
TY - CONF AU - Shengli Du PY - 2015/04 DA - 2015/04 TI - Ant Colony Algorithm for Solving the Multicast Routing Problem with QoS Constraints BT - Proceedings of the 2015 International Conference on Intelligent Systems Research and Mechatronics Engineering PB - Atlantis Press SP - 2095 EP - 2098 SN - 1951-6851 UR - https://doi.org/10.2991/isrme-15.2015.434 DO - https://doi.org/10.2991/isrme-15.2015.434 ID - Du2015/04 ER -