Delay-constrained multicast routing algorithm based on shared edges
Weiqun Liu · Journal of Computer Applications · 2009
In order to optimize cost and decrease time complexity,the delay-constrained Steiner tree problem was discussed. The implementation of Minimum Path Heuristic (MPH) algorithm was analyzed firstly,then a delay-constrained multicast routing algorithm based on shared edges named ESAMPH was presented. ESAMPH preferentially selected the nodes through which more shortest path was contained when constructing a multicast routing tree,therefore,the next node to the multicast tree may be also the shortest path through these nodes to reduce the cost of multicast tree. Simulation results show that ESAMPH balances cost,delay and computing time and has better overall performance.