| 一种时延受限的多播路由算法 |
| |
| 引用本文： | 张锁太,顾乃杰,刘刚,刘小虎.一种时延受限的多播路由算法[J].计算机工程,2007,33(20):113-115. |
| |
| 作者姓名： | 张锁太 顾乃杰 刘刚 刘小虎 |
| |
| 作者单位： | 中国科学技术大学计算机科学与技术系,合肥,230027;安徽省计算与通信软件重点实验室,合肥,230027 |
| |
| 基金项目： | 中国科学院软件研究所计算机科学重点实验室开放课题基金 |
| |
| 摘 要： | 很多实时多媒体应用要求通信网络提供多播服务支持，而且往往需要传输的信息满足源端到目的端的时延约束。该文对时延约束的多播路由问题进行了研究，基于原有的从源端到目的端的时延受限路径构造算法，提出了一种时延受限多播路由算法。该算法能够快速构建满足时延约束的多播树。理论分析表明，该算法的时间复杂度和CDKS算法相同。仿真实验结果表明，该算法所构建的多播树代价低于CDKS算法。
|
| 关 键 词： | 多播路由 时延约束 受限的Steiner树 |
| 文章编号： | 1000-3428(2007)20-0113-03 |
| 修稿时间： | 2006年10月25 |
Delay-constrained Multicast Routing Algorithm |
| |
| ZHANG Suo-tai,GU Nai-jie,LIU Gang,LIU Xiao-hu.Delay-constrained Multicast Routing Algorithm[J].Computer Engineering,2007,33(20):113-115. |
| |
| Authors: | ZHANG Suo-tai GU Nai-jie LIU Gang LIU Xiao-hu |
| |
| Affiliation: | (1. Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027; 2. Anhui Province Key Laboratory of Computing and Communication Software, Hefei 230027) |
| |
| 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. |
| |
| Keywords: | multicast routing delay constraint constrained Steiner tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
