QoS Constraints_Based Multicast Routing Algorithm Using CACO

DOI

10.2991/iccasm.2012.234How to use a DOI?

Keywords

QoS, QoS constraints, multicast routing, ACO, CACO, MANET

Abstract

QoS (Quality of Service) constraints_based multicast routing is one of major issues in distributed multimedia on the network. An improved algorithm based CACO (Chaos Ant Colony Optimization) is proposed in this paper for solving some routing problems such as the convergence speed, packet loss rate and bandwidth, etc. The algorithm utilizes the pheromone positive feedback effect to guide chaos search. The advantage of this scheme is that chaos initialization is adopted to improve individual quality and chaos perturbation is utilized to avoid the search being trapped in local optimum, meanwhile improve the packet delivery ratio and reduce the end-to-end delay. The experimental results show that the efficiency of the algorithm.

Copyright

© 2012, 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  - Hao Yang
AU  - Zhengzheng Xian
AU  - Lei Yang
PY  - 2012/08
DA  - 2012/08
TI  - QoS Constraints_Based Multicast Routing Algorithm Using CACO
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 919
EP  - 922
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.234
DO  - 10.2991/iccasm.2012.234
ID  - Yang2012/08
ER  -