北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 1999, Vol. 22 ›› Issue (3): 68-72.

• 研究报告 • 上一篇    下一篇

动态启发式最小生成树多播路由算法

龙元香, 廖建新, 陈俊亮   

  1. 北京邮电大学程控交换技术与通信网国家重点实验室, 北京 100876
  • 收稿日期:1999-01-29 出版日期:1999-07-10
  • 基金资助:
    国家自然科学基金重大课题资助项目(69896244)

Dynamic Heuristic Minimal Spanning Tree Multicast Routing Algorithm

Long Yuanxiang, Liao Jianxin, Chen Junliang   

  1. National Laboratory of Switching Technology and TelecommunicationNetworks,Beijing University of Posts and Telecommunications, Beijing 100876
  • Received:1999-01-29 Online:1999-07-10

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

关键词: 智能网, 会议电视, 多播

Abstract: Video conference is a welcome multimedia service.Howto choose appropriate conference routes and optimize the configuration of conference for reducing cost of conference is key to popularize the video conferenceservice.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.

Key words: intelligent network, video conference, multicast

中图分类号: