中文摘要：

为了在真实的网络环境中寻找一棵延迟受限、耗费最小的组播转发树，以便更好地支持组播通信，提出了一个可以动态优化的分布式纽播路由算法，该算法利用蚁群思想解决上述纽播路由问题。由于不同代的蚂蚁之间可以通过信息素来实现间接通信，而信息素又是一种可以反映环境变化的媒介质，因此，该算法能够根据网络环境的变化及时做出调整。结合实际的网络拓扑，进行仿真实验，实验结果表明，通过蚂蚁一代代的进化，算法可以找到一棵满足延迟约束并且耗费尽可能小的组播树。

英文摘要：

A distributed multicast routing algorithm which can be dynamically optimized is proposed to find a delay constrained multicast forwarding tree with minimum cost in real network environment, so as to support multicast communication in a better way. Ant colony theory is utilized in this algorithm to resolve the multicast routing problem above. Because ants of differeut generations can communicate indirectly using pheromone, which is a medium reflecting the change of environment, the algorithm can adjust in time according to network changes. Simulation results under real network topology demonstrates that this algorithm is able to find a delay constrained tree with minimum cost via evolution of generation of ants.