Solution for multicast routing problem using particle swarm optimization

As the communication networks rapidly increases it leads to the problem of multicast routing problem (MRP). In this paper, the technique particle swarm optimization (PSO) is used along with the bi-velocity coding technique. This bi-velocity scheme is used to denote the nodes in the networks by a coded string 0/1. If the node is coded with 1, then the node is used for the construction of the multicast tree, 0 otherwise. By using the learning mechanism of particle swarm optimization technique, the velocity and the position are updated. The global search ability of the original PSO is maintained along with its faster convergence speed. Based on this technique, a minimal cost multicast tree is constructed.