Computer networks (3rd ed.)
Ant-like agents for load balancing in telecommunications networks
AGENTS '97 Proceedings of the first international conference on Autonomous agents
Communications of the ACM
On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem
IEEE Transactions on Computers
Introduction to Algorithms
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
Genetic Algorithms for Autonomic Route Discovery
DIS '06 Proceedings of the IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
A genetic algorithm for the multiple destination routing problems
IEEE Transactions on Evolutionary Computation
Improved neural heuristics for multicast routing
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
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms
Journal of Network and Computer Applications
Hi-index | 0.00 |
The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in solving routing problems. Then it proposes a novel algorithm called the distance complete ant colony system (DCACS), which is aimed at solving the multicast routing problem by utilizing the ants to search for the best routes to send data packets from a source node to a group of destinations. The algorithm bases on the framework of the ant colony system (ACS) and adopts the Prim's algorithm to probabilistically construct a tree. Both the pheromone and heuristics influence the selection of the nodes. The destination nodes in the multicast network are given priority in the selection by the heuristics and a proper reinforcement proportion to the destination nodes is studied in the case experiments. Three types of heuristics are tested, and the results show that a modest heuristic reinforcement to the destination nodes can accelerate the convergence of the algorithm and achieve better results.