An improved ACO algorithm for multicast routing

Authors:
Ziqiang Wang;Dexian Zhang
Affiliations:
School of Information Science and Engineering, Henan University of Technology, Zheng Zhou, China;School of Information Science and Engineering, Henan University of Technology, Zheng Zhou, China
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 5
Cited 0

Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
QoS routing based on genetic algorithm

Computer Communications
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multicast routing problem with quality of service (QoS) constraints is a key requirement of computer networks supporting multimedia applications. In order to resolve Qos multicast routing effectively and efficiently, an improved ant colony optimization (ACO) algorithm is proposed to resolve this problem.The core idea of improved ACO algorithm is mainly realized through pheromone local and global updating rule.Experimental results show that this algorithm can find optimal solution quickly and has a good scalability.