| Overlay多播网络中带度约束的最小带宽多播树的求解 |
| |
| 引用本文： | 赵娟,潘耘.Overlay多播网络中带度约束的最小带宽多播树的求解[J].计算机工程与科学,2010,32(3):28-30. |
| |
| 作者姓名： | 赵娟 潘耘 |
| |
| 作者单位： | 1. 咸阳师范学院计算机科学系,陕西,咸阳,712000
2. 中国传媒大学计算机学院,北京,100024 |
| |
| 基金项目： | 咸阳师范学院人才引进项目(06XSYK281) |
| |
| 摘 要： | 本文研究了Overlay网络中带有度约束的最小带宽多播路由问题,建立了相应的数学优化模型,设计了求解模型的启发式算法,对算法的复杂性进行了分析,并进行了数值模拟。
|
| 关 键 词： | Overlay多播 度约束 最小带宽 启发式算法 |
| 收稿时间： | 2009-05-25 |
| 修稿时间： | 2009-10-21 |
On the Degree Constrained Minimal Bandwidth Multicast Routing Problem in Overlay Networks |
| |
| ZHAO Juan,PAN Yun.On the Degree Constrained Minimal Bandwidth Multicast Routing Problem in Overlay Networks[J].Computer Engineering & Science,2010,32(3):28-30. |
| |
| Authors: | ZHAO Juan PAN Yun |
| |
| Affiliation: | 1.Department of Computer Science/a>;Xianyang Normal University/a>;Xianyang 712000/a>;2.School of Computer Science/a>;Communication University of China/a>;Beijing 100024/a>;China |
| |
| Abstract: | In this paper,we investigate the degree-constrained minimal bandwidth multicast routing problem in overlay networks,build a corresponding optimization model,and design a heuristic algorithm and a genetic algorithm for the problem.The complexity analysis and numerical experiments according to these two algorithms are also presented.Both the results of theoretical analysis and that of simulations suggest our proposed model and algorithms are practical and effective. |
| |
| Keywords: | Overlay multicast degree-constrained minimal bandwidth heuristic algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
