%0 Journal Article
%T An Improved MPH-Based Delay-constrained Steiner Tree Algorithm
%A Chun-De Yang
%A Kang Huan
%J Communications and Network
%P 127-132
%@ 1947-3826
%D 2011
%I Scientific Research Publishing
%R 10.4236/cn.2011.33015
%X In order to optimize cost and decrease complexity with a delay upper bound, the delay-constrained Steiner tree problem is addressed. Base on the new delay-constrained MPH (DCMPH_1) algorithm and through improving on the select path, an improved MPH-based delay-constrained Steiner tree algorithm is presented in this paper. With the new algorithm a destination node can join the existing multicast tree by selecting the path whose cost is the least; if the path¡¯s delay destroys the delay upper bound, the least-cost path which meets the delay upper bound can be constructed through the least-cost path, and then is used to take the place of the least-cost path to join the current multicast tree. By the way, a low-cost multicast spanning tree can be constructed and the delay upper bound isn¡¯t destroyed. Experimental results through simulations show that the new algorithm is superior to DCMPH_1 algorithm in the performance of spanning tree and the space complexity.
%K Multicast Tree
%K Delay-Constrained
%K Steiner Tree
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=6773