A distributed delay-bounded constraint multicast routing algorithm based on ant algorithm

This paper studies the problem of multicast routing with end to end delay constraint in high speed packet switched computer networks A novel approach using ant algorithm is proposed to optimize the multicast routes and this approach is fully distributed The simulation results show that the network cost of the routing trees generated by our approach is better than the other major existing algorithms,and flexible in multicast membership changes