A Delay-Constrained Dynamic Algorithm for Multicast Routing
Yamin Sun · Jisuanji fangzhen · 2006
The issue of the delay-constrained multicast routing under dynamic environment was addressed firstly, and then a delay-constrained dynamic greedy algorithm (DCDG) was proposed to construct a serial of dynamic multicast trees based on the greedy strategy. By DCDG, a computing destination node can join the multicast tree by selecting the path which meets the delay requirement and has the least cost value to the existing multicast tree; if the path delay destroys the delay upper bound, the path based on the destination-driven shortest path algorithm (DDSP) will be merged into the existing tree to construct a multicast tree. The simulation results show that DCDG has a high performance in constructing low-cost dynamic multicast routing trees with a very low computing complexity of O(n). And more, it can achieve a high success ratio under strict delay constrain.