A Dynamic Multicast Routing Algorithm with Delay Bounded
Xu Zhengquan · Jisuanji gongcheng · 2005
This paper proposes a multicast routing algorithm with delay-bounded, the algorithm employs label and least path technique, it achieves feasible multicast routing tree by replacing partial paths with other paths that has less path delay. Simulation shows that the algorithm can obtain less cost and mean path delay, it also has low time complexity.