Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 1999, Vol. 22 ›› Issue (3): 68-72.

Previous Articles     Next Articles

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

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

CLC Number: