[1]喻建平,李汉兵,谢维信.一种新的广域网组播树生成算法[J].深圳大学学报理工版,2001,18(2):10-18.
 YU Jian-ping,LI Han-bing and XIE Wei-xin.A New Algorithm for Multicast Tree Generation in Wide Area Networks[J].Journal of Shenzhen University Science and Engineering,2001,18(2):10-18.
点击复制

一种新的广域网组播树生成算法()
分享到:

《深圳大学学报理工版》[ISSN:1000-2618/CN:44-1401/N]

卷:
第18卷
期数:
2001年2期
页码:
10-18
栏目:
化学与化工
出版日期:
2001-06-30

文章信息/Info

Title:
A New Algorithm for Multicast Tree Generation in Wide Area Networks
文章编号:
1000-2618(2001)02-0010-09
作者:
喻建平1 李汉兵2 谢维信1
1)深圳大学信息工程学院, 深圳518060
2)北京邮电大学, 北京100876
Author(s):
YU Jian-ping1 LI Han-bing2 and XIE Wei-xin1
1) College of Information Engineering Shenzhen University, Shenzhen 518060 , P .R .China
2) Beijing University of Posts and Telecommunications Beijing , 100876 P .R .China
关键词:
组播路由近似算法计算机网络Steiner 树
Keywords:
multicast routing approximate algorithm computer networks Steiner tree
分类号:
TN 916.2 ; TP 393
文献标志码:
A
摘要:
提出了一种性能可以调节的组播树生成算法.这种算法提供了一个调节参数κ,即每次随机选择的端节点的个数. 通过改变参数κ,可在组播树的费用和运行时间之间进行权衡选择, 以适应不同应用场合的需要. 为了仿真, 还提出了一种使节点平均点度非常精确的随机网络产生方法. 分析和仿真结果表明,只用较小的κ值就可得到较为理想的组播树费用,同时算法能保持较高的计算效率.与算法SCTF(Selective Closest Terminal First)相比, 在计算效率相同时, 本算法费用值更低.
Abstract:
A fast algorithm for multicast tree is presented and a generating method for random networks is given. In our algorithm, a parameter κ, the random selective terminal number is provided. Using parameter κ, trade-off selection between the cost of multicast tree and the running time of the algorithm can be made for different situations. The analysis and simulating results show that using a low κ gives nearly best possible expected tree cost while maintaining acceptable run time efficiency. Comparing with SCTF (Selective Closest Terminal First), our heuristic algorithm gains more run time efficiency with the same tree cost. Our algorithm can compute faster with relatively smaller cost compared with SCTF .

相似文献/References:

[1]顾燕红.有宽容交货期的加权超前延误工件数问题[J].深圳大学学报理工版,2006,23(3):278.
 GU Yan-hong.Minimizing weighted number of early and tardy jobs with a common due window[J].Journal of Shenzhen University Science and Engineering,2006,23(2):278.

更新日期/Last Update: 2015-11-27