Multicast Routing Based on Ant Algorithm with Multiple Constraints

We present an efficient QoS multicast routing algorithm based on ant algorithm. It considers multiple QoS metrics, e.g., bandwidth, delay, delay jittter. Our approach of constructing a multicast tree is to find the shortest paths from the source to each destination separately by ant algorithm and then merge the resulting paths to form a multicast tree. Simulation results show that the proposed algorithm can find the optimal or near-optimal solution quickly.