| 时延受限低代价的一种组播路由动态算法 |
| |
| 引用本文： | 王新红,刘富强. 时延受限低代价的一种组播路由动态算法[J]. 通信学报, 2006, 27(5): 41-46 |
| |
| 作者姓名： | 王新红 刘富强 |
| |
| 作者单位： | 同济大学,电子与信息工程学院,上海,200092 |
| |
| 基金项目： | 科技部国际科技合作项目 |
| |
| 摘 要： | 提出了一种适合目的节点动态加入的、时延受限低代价多播路由的启发式算法DLHMA算法。该算法基于MPH算法的基本思想进行扩展,在满足时延限制条件和多播树代价增加最小的基础上,逐步将目的节点添加到多播树上。最后,证明了算法的正确性,分析了算法的动态性,并进行了仿真实验。结果表明,该算法可以实现新加目的节点的动态加入,并保证所获得多播树的低代价。
|
| 关 键 词： | 时延 代价 多播 路由 |
| 文章编号： | 1000-436X（2006）05-0041-06 |
| 收稿时间： | 2005-08-11 |
| 修稿时间： | 2006-02-11 |
Dynamic algorithm for delay-constrained low-cost multicast routing |
| |
| WANG Xin-hong,LIU Fu-qiang. Dynamic algorithm for delay-constrained low-cost multicast routing[J]. Journal on Communications, 2006, 27(5): 41-46 |
| |
| Authors: | WANG Xin-hong LIU Fu-qiang |
| |
| Affiliation: | College of Electronic and Information Engineering, Tongji University, Shanghai 200092, China |
| |
| Abstract: | A heuristic algorithm,DLHMA,was proposed,which was adapted to destination nodes joining the multicast tree dynamically.This algorithm was based on MPH algorithm.It added the destination node to the tree step by step based on satisfying the delay constraint and increasing the multicast tree cost least.At last,the validity was proven,the dynamic was analyzed,and the simulation was done.The results show that the new destination node can be added dynamically and the cost of the multicast tree is low. |
| |
| Keywords: | delay cost multicast routing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|
