摘要
本文在MPH(MinimumPathCostHeuristic)的基础上 ,改进了端节点的加入过程 ,得到了两种改进的MPH算法 :局部搜索最小路径费用算法LSMPH(LocallySearchingMPH)和简化的LSMPH :最短端节点最小路径费用算法STMPH(ShortestTerminalMPH) .在随机网络模型的基础上 ,我们进一步进行了仿真 .仿真结果表明 ,LSMPH以相对较小的费用增加换取更快的计算速度 .如果要求更快的速度 ,可以采用STMPH .
On the basis of MPH (Minimum Path Cost Heuristic),The method of subpath adding to the partially constructed multicast tree is modified.Thus two algorithms are adopted,one is locally searching minimum path cost heuristic (LSMPH) and the other is shortest terminal minimum path cost heuristic (STMPH),the simplified version of LSMPH.With the random graph model,the simulation shows that LSMPH can compute faster with relatively smaller cost increasing.If much shorter computing time is needed,STMPH is more suitable than LSMPH.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2000年第5期92-95,共4页
Acta Electronica Sinica
基金
广东省自然科学基金!(No.9841 1 4 )
