【摘要】 会议电视是一种非常受欢迎的多媒体业务，如何选择合适的会议路由、优化会议的配置，以减少开支，成为会议电视业务推广使用的关键．针对会议电视的特点，介绍了基于Ｓｔｅｉｎｅｒ树的动态多播算法以及动态贪婪算法，指出了两种算法的不足，提出了一种动态启发式最小生成树多播路由算法，给出了算法的实现步骤，对该算法的性能、可行性进行了分析，并论证了该算法是合适可行的．实验数据表明，该算法生成的最小生成树的线路开销接近最优．更多还原

【Abstract】 Video conference is a welcome multimedia service.How to choose appropriate conference routes and optimize the configuration of conference for reducing cost of conference is key to popularize the video conference service.Aims at characteristics of video conference, introduces a multicast algorithm based on Steiner tree and dynamic greedy algorithm, points out their lack.Then, the paper presents a dynamic heuristic minimal spanning tree multicast routing algorithm, gives its implementation steps, analyzes its performances, and proves that the algorithm is appropriate and feasible.The experimental results show that the cost of spanning tree by the algorithm is a close approximation to optimization.更多还原