摘要： 很多实时多媒体应用要求通信网络提供多播服务支持，而且往往需要传输的信息满足源端到目的端的时延约束。该文对时延约束的多播路由问题进行了研究，基于原有的从源端到目的端的时延受限路径构造算法，提出了一种时延受限多播路由算法。该算法能够快速构建满足时延约束的多播树。理论分析表明，该算法的时间复杂度和CDKS算法相同。仿真实验结果表明，该算法所构建的多播树代价低于CDKS算法。

关键词: 多播路由, 时延约束, 受限的Steiner树

Abstract: In real-time multimedia applications, multicast, especially the demand of delay constraint from source to destination end during information transmission, is required. This paper concentrates on multicast routing problem with end-to-end delay bounded. Based on the original algorithm which constructs the delay-constrained path from source end to destination end, this paper presents an algorithm to solve DMR (delay-constrained multicast routing) problem. The algorithm can construct delay-constrained multicast tree efficiently. Theoretical analyses indicate the time complexity of the algorithm is the same as that of CDKS. Besides, simulation results prove that this algorithm can construct a multicast tree whose cost is lower than CDKS.

Key words: multicast routing, delay constraint, constrained Steiner tree

中图分类号: 

• TP393