|
|
|
| Research on Shared Path First Heuristic Algorithm |
| Yang Fan①; Qiu Zhi-liang①; Li Zhi-bing①; Liu Zeng-ji①; Chang Yue-e② |
| ①National Key Lab of Integrated Service Networks, Xidian Univ, Xi’an 710071, China;②Shaanxi Huajing Micro-electronic LTD., Xi’an 710065, China |
|
|
|
|
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.
|
|
Received: 18 July 2005
|
|
|
|
|
|
|
|
|
2007, Vol. 29 
