论文部分内容阅读
在组播树生成算法中 ,MPH(m inim um path cost heuristic)的费用性能几乎是最好的 ,但它的计算时间相对较长 .提出了两种新的组播树生成算法 :TNS- MPH(tree- node started minim um- cost path heuristic)和 NTDS-MPH(non- tree- destination started m inimum- cost path heuristic) .同时提出了一种使节点平均度非常精确的随机网络产生模型 .新算法的仿真结果表明 ,新算法能用较少的费用性能恶化来换取更快的计算速度 .新算法比SCTF(selective closest terminal first)算法有更好的扩展性
In the multicast tree generation algorithm, the cost performance of mHim path cost heuristic (MPH) is almost the best, but its calculation time is relatively long. Two new multicast tree generation algorithms are proposed: TNS-MPH (tree-node started minimium-cost path heuristic) and NTDS-MPH (non tree-destination started m inimum-cost path heuristic) .An algorithm for generating random networks with very accurate average nodes is proposed. The simulation results show that the new algorithm can get faster computational speed with less cost performance degradation.The new algorithm has better scalability than the SCTF (selective closest terminal first) algorithm