Download now Free registration required
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.
- Format: PDF
- Size: 300.6 KB