Low-cost Shortest Path Tree Algorithm

In order to optimize the cost of the shortest path tree(SPT),a path-driven idea is proposed.The path-driven idea means that the computing node optimizes the multicast tree cost by sharing link with those nodes which are in the path for the destination to the information source.Based on the idea and through improving the search procedure,a path-driven multicast routing algorithm of the low-cost shortest path tree(LCSPT) is presented.The LCSPT algorithm can establish and maintain a multicast tree which minimizes the total cost and simultaneously guarantees the shortest path for each receiver node.The two simulation results show that the LCSPT algorithm not only produces a SPT correctly but also has the best optimization performance among all the SPT algorithms.