原创力文档- 1、本文档共4页，可阅读全部内容。
- 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
查看更多
局部搜索最小路径费用算法
5 Vol .28 No. 5
2000 5 ACTA ELECTRONICA SINICA Ma 2000
1 2 2
李汉兵, 喻建平, 谢维信
( 1 , 710071; 2 , 518060)
: MPH( Minimum Path Cost Heuristic) , , MPH
: LSMPH( Locall Searching MPH) LSMPH:
STMPH( Shortest Terminal MPH) . , . , LSMPH
. , STMPH.
: NP ; ; ;
: TN393 : A : ( 2000) 0509204
Locally Searching Minimum Path Cost Heuristic
1 2 2
LI Hanbing , YU Jianping ,XIE Weixin
( 1School of Electronic Engineering , X idi an University , X i an 710071, China;
2School of I nf ormation Engi neering , Shenz hen University , Shenz hen 518060, Chi na )
Abstract : On the basis of MPH ( Minimum Path Cost Heuristic) , The method of subpath adding to the partiall constructed
multicast tree is modified. Thus two algorithms are adopted, one is locall 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 relativel smaller cost increasing. If much shorter computing time is needed,
STMPH is more suitable than LSMPH.
Key words: NPcomplete; routing algorithm; multicast tree; networks
1 . ,
5 , ( unicast ) , ( multi MPH . ,
cast) , ( concast ) , ( multipoint to multipoint) LSMPH STMPH . ,
( broadcast) . , . . , .
( source) ( terminal) 2
. , 21
, . ,
文档评论（0）