J4 ›› 2010, Vol. 32 ›› Issue (3): 28-30.doi: 10.3969/j.issn.1007130X.2010.
• 论文 • 上一篇 下一篇
赵娟, 潘耘
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
作者简介:
zhao Juan, BO Yun
Received:
Revised:
Online:
Published:
Contact:
摘要：
本文研究了Overlay网络中带有度约束的最小带宽多播路由问题，建立了相应的数学优化模型，设计了求解模型的启发式算法，对算法的复杂性进行了分析，并进行了数值模拟。
关键词: Overlay多播, 度约束, 最小带宽, 启发式算法
Abstract:
In this paper, we investigate the degreeconstrained 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.
Key words: Overlay multicast;degreeconstrained;minimal bandwidth;heuristic algorithm
中图分类号:
TP393
赵娟, 潘耘. Overlay多播网络中带度约束的最小带宽多播树的求解[J]. J4, 2010, 32(3): 28-30.
ZIAO Juan, BO Yun. On the Degree Constrained Minimal Bandwidth Multicast Routing Problem in Overlay Networks[J]. J4, 2010, 32(3): 28-30.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/10.3969/j.issn.1007130X.2010.
http://joces.nudt.edu.cn/CN/Y2010/V32/I3/28
