Abstract
The minimum Steiner tree problem is an NP-complete problem in multicast routing algorithms. In this paper, an improved algorithm called the prior nodes minimum cost path heuristic (PNMPH) algorithm is presented according to the shortage of the minimum cost path heuristic (MPH) algorithm, in which some paths that pass through prior destination nodes are selected first. It partly shares links in the network and decreases the cost of the multicast routing tree. It is also closer to the optimal solution with the time complexity O(n 3 ). The simulation results on the existing networks show that the cost of the PNMPH algorithm is lower than that of the MPH algorithm in the case of more than 90%.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
