It is well known that multicast routing is combinatorial problem finds the optimal path
between source destination pairs. Traditional approaches solve this problem by …

Multicast routing (MR) is a technology for delivering network data from some source node (s)
to a group of destination nodes. The objective of the minimum cost MR (MCMR) problem is …

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 …

In this paper, some improvements on Ant Colony Optimisation (ACO) are presented and we
use the improved algorithm to solve the multicast routing problem. The improvements are …

Ant colony optimization (ACO) is a new optimization algorithm, and has the limitation of
stagnation. In this paper, the performance of ACO is improved and the improved ACO is …

Dijkstra's and Prim's algorithms are well established methods for implementing multicast
routing. We have emphasized a different approach'Ant Colony System (ACS)'for multicast …

A new QoS (quality of service) multicast routing problem based on ant colony algorithm is
presented. The route selection strategy and the control parameters of the ant colony are …

In the distributed networks, many applications send information from a source node to
multiple destination nodes. To support these applications requirements, the paper presents …

Based on the principle of ant colony algorithm this paper proposes a new ant colony
algorithm based on trees, and applies it to the solution of multi-constraints QoS network …

For the search of the optimal path and the establishment of the multicast tree which meets
QoS constraints in multicast routing, an improved ant colony algorithm is proposed in the …