| 一种路径时延约束下构造最低代价多播树的探索算法 |
| |
| 引用本文： | 陈望都,陈鹏之,张顺颐. 一种路径时延约束下构造最低代价多播树的探索算法[J]. 南京邮电大学学报(自然科学版), 2001, 21(1): 14-18 |
| |
| 作者姓名： | 陈望都 陈鹏之 张顺颐 |
| |
| 作者单位： | 南京邮电学院信息网络技术研究所,;南京邮电学院院长办公室, |
| |
| 摘 要： | 提出了一种新的探索算法 ,它根据源与目的节点间的时延约束 ,构造最低代价的多播树。并且可以在网络节点请求加入或离开时 ,通过更新现有的多播树 ,实现多播树的动态维护。对该算法进行了仿真 ,并与现有的一些算法进行了比较
|
| 关 键 词： | 多播 多播路由 Steiner树 |
| 文章编号： | 1000-1972(2001)01-0014-05 |
| 修稿时间： | 2000-03-13 |
A Heuristic Algorithm for Constructing Mininum-cost Multicast Trees with Bounded Path Delay |
| |
| CHEN Wang-du ,CHEN Peng-zhi ,ZHANG Shun-yi .Information Network Technology Institute,Nanjing University of Posts And Telecommunications,Nanjing ,China .Presidents Offices,Nanjing University of Posts and Telecommunications,Nanjing. A Heuristic Algorithm for Constructing Mininum-cost Multicast Trees with Bounded Path Delay[J]. JJournal of Nanjing University of Posts and Telecommunications, 2001, 21(1): 14-18 |
| |
| Authors: | CHEN Wang-du CHEN Peng-zhi ZHANG Shun-yi .Information Network Technology Institute Nanjing University of Posts And Telecommunications Nanjing China .Presidents Offices Nanjing University of Posts Telecommunications Nanjing |
| |
| Affiliation: | CHEN Wang-du 1,CHEN Peng-zhi 1,ZHANG Shun-yi 2 1.Information Network Technology Institute,Nanjing University of Posts And Telecommunications,Nanjing 210003,China 2.Presidents Offices,Nanjing University of Posts and Telecommunications,Nanjing 2100 |
| |
| Abstract: | A new heuristic algorithm is proposed to construct a minimum-cost multicast tree.Subject to the bounded path delay from source node to each destination node.When any node in the network requests to join or leave,the multicast tree can be maintained dynamically by updating the existing tree.Emulation has been done and comparison with existing algorithms has been conducted. |
| |
| Keywords: | Multicast Multicast routing Steiner tree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
