Research on Shared Path First Heuristic Algorithm
共享路径优先组播路由算法

The minimum cost multicast tree may boil down to Steiner tree problem which is NP-Complete.Inmulticast applications,heuristic algorithms are commonly used to calculate the suboptimal tree.In this paper,anew heuristic algorithm named Shared Path First Heuristic(SPFH)is proposed.In this algorithm,whendestination nodes are joined into the multicast tree,two factors are considered.One is the distance between thedestination nodes and the multicast tree,the other is the influence of earlier joined nodes to the later joined nodes.Among the nearest nodes to the constructing multicast tree,the node which can reduce the joining cost of othernodes are first chosen to join the tree.The simulation result shows that SPFH achieves the preferable performance.