An iterative distributed algorithm for multi-constraint multicast routing

In this paper, we propose a group computation based distributed algorithm for solving the problem of multi-constraint multicast routing. This algorithm is fully distributed and can generate within acceptable time and message complexities a multicast routing tree, which not only satisfies the required multiple QoS constraints but also has a sub-optimal network cost. The results of the simulations show that the multicast routing tree generated by our algorithm has better performance than the previous well-known results.