共享路径优先组播路由算法
doi: 10.3724/SP.J.1146.2005.00874
Research on Shared Path First Heuristic Algorithm
-
摘要: 求解开销最小组播树在数学上归结为Steiner树问题，但由于寻找最优的Steiner树问题是NP-Complete问题，因此在组播应用中，采用启发式算法获得次优的组播树是常见的方法。该文提出了一种新的的启发式组播路由算法(Shared Path First Heuristic，SPFH)该算法在选择目的节点加入组播树时，既考虑到目的节点到树上的距离，又考虑到先加入的节点对后续加入节点的影响。算法从距离当前组播树近的目的节点中挑选节点加入组播树，选择的规则是，把能够减小其它目的节点加入组播树开销的节点先加入树。仿真结果表明，SPFH算法能找到开销接近于最优解的组播树。Abstract: The minimum cost multicast tree may boil down to Steiner tree problem which is NP-Complete. In multicast applications, heuristic algorithms are commonly used to calculate the suboptimal tree. In this paper, a new heuristic algorithm named Shared Path First Heuristic (SPFH) is proposed. In this algorithm, when destination nodes are joined into the multicast tree, two factors are considered. One is the distance between the destination 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 other nodes are first chosen to join the tree. The simulation result shows that SPFH achieves the preferable performance.
-
[1] Karp R M. Reducibility among combinatorial problems[A]. In Miller and Thatcher(Eds), Complexity of Computer Computations[C]. New York, Plenum Press, 1972: 85-103. [2] Pawel Winter. Steiner problem in networks: A survey[J].Networks.1987, 17:129-167 [3] 余燕平. 组播路由算法的研究[D]. [博士论文]. 浙江: 浙江大学, 2002年11月. [4] Rayward-Smith V J and Clare A. On finding steiner vertices[J].Networks.1986, 16:283-294 [5] Vob S. Steiners problem in graphs: Heuristic methods. Discrete Applied Mathematics, 1992, 40(1): 43-72. -
计量
- 文章访问数: 3370
- HTML全文浏览量: 94
- PDF下载量: 814
- 被引次数: 0
下载:
