| 支持延时约束的覆盖多播路由协议的研究 |
| |
| 引用本文： | 吴家皋,杨音颖,陈益新,叶晓国.支持延时约束的覆盖多播路由协议的研究[J].通信学报,2005,26(9):13-20. |
| |
| 作者姓名： | 吴家皋 杨音颖 陈益新 叶晓国 |
| |
| 作者单位： | 1. 东南大学 计算机科学与工程系,江苏,南京,210096
2. 计算机网络和信息集成教育部重点实验室(东南大学),江苏,南京,210096 |
| |
| 基金项目： | 国家自然科学基金资助项目(901040009)，国家“973”重点基础研究发展计划基金资助项目(2003CB314801) |
| |
| 摘 要： | 研究有度和延时约束的覆盖多播路由问题,提出了一个新的覆盖多播路由协议-延时受限的树协议(DBTP)。该协议采用分布式和树优先的策略,使多播组成员之间能自组织地构建一棵基于源的覆盖多播树。DBTP协议采用了一种新的启发式局部优化算法,通过调节启发因子,能灵活地在延时和代价之间进行折衷。仿真实验表明,无论在静态还是动态节点模型下,选择适当的启发参数,DBTP都能获得较高的节点接纳率。
|
| 关 键 词： | 覆盖多播 路由协议 启发式算法 延时约束 |
| 文章编号： | 1000-436X（2005）09-0013-08 |
| 收稿时间： | 2004-12-03 |
| 修稿时间： | 2005-04-11 |
Delay constraint supported overlay multicast routing protocol |
| |
| WU Jia-gao,YANG Yin-ying,CHEN Yi-xin,YE Xiao-guo.Delay constraint supported overlay multicast routing protocol[J].Journal on Communications,2005,26(9):13-20. |
| |
| Authors: | WU Jia-gao YANG Yin-ying CHEN Yi-xin YE Xiao-guo |
| |
| Affiliation: | 1. Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China; 2. Key Laboratory of Computer Network and Information Integration(Southeast University |
| |
| Abstract: | The degree and delay constrained routing problem in overlay multicast was studied, and a new overlay multicast routing protocol called delay bounded tree protocol (DBTP) was proposed. Adopted distributed and tree-first strategies, the protocol enabled members of a multicast group to self-organize into a sourced-based overlay multicast tree. DBTP used a new heuristic local optimum algorithm, which could make trade-off between delay and cost of the multicast tree by adjusting a heuristic parameter. The simulation result shows that DBTP can both achieve the admission rate of members highly under whether static or dynamic node model through choosing a proper value of the heuristic parameter. |
| |
| Keywords: | overlay multicast routing protocol heuristic algorithm delay constraint |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|
