A destination-driven shortest path tree algorithm

Shortest path tree (SPT) is the most widely-used multicast tree type due to its simplicity and low per-destination cost. An SPT is constructed by the union of the shortest paths from the source node to each destination. However, SPT does not consider overall network resource utilization. We propose a destination-driven shortest path tree algorithm, which aims to construct a low-cost SPT by considering link sharing between different destinations. The computational complexity of the presented algorithm is O(|E|log|V|), where |E| and |V| are the number of edges and nodes in a network respectively. Simulation results are used to demonstrate the high performance of the proposed algorithm.