A novel distributed algorithm to solve self-organizing network of multicast routing

Multicast routing is a very important research issue in self-organizing networks and distributed systems. It is also a challenging and hard problem for high-performance networks of the next generation. Due to it is NP-completeness, many heuristic methods have been employed to solve the problem. This paper proposes distributed algorithm for optimized self-organizing network of multicast routing (DOSMR). Because self-organizing networks have a dynamic nature, the algorithm of solving this problem is required to meet the dynamic characteristics. The proposed algorithm node information is stored in the routing table to calculate the hops of multicast tree routing. The simulation results show the proposed algorithm superiority to the methods based on DCMPH.