Multicast routing approach with delay-constrained minimum-cost
Xuan Liu · Computer Engineering and Applications Journal · 2007
This paper puts forward a multicast routing algorithm which satisfies time-delay limitation of point-to-point.This algorithm is based on the constucting method of network parameter weighting steiner tree.When the time-delay of the destination node is not limited,steiner tree is MST of prim algorithm.On the other hand,when time-delay is limited,this algorithm motifies weight parameter of expense and time-delay to approach optimum relation.This paper points out the problem in construction of milticast routing tree by the example of current algorithm,and proposes a method to ensure the optimization of steiner tree.According to the result of emulation,this algorithm improves the method of constructing multicast routing tree efficiently.