局部搜索最小路径费用算法.PDF

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 , . ,