Delay-constrained multicast routing algorithm based on optimized path selection
Yuanchen Li · Journal of Computer Applications · 2011
A fast and effective delay-constrained multicast routing algorithm was put forward according to the generation of delay-constrained multicast tree.Referencing KPP,this algorithm designed a new path selection function which can balance cost and delay.In the mean time,this algorithm guaranteed the performance of multicast tree and has lower complexity while considering the optimization of cost and delay.The simulation results show that this algorithm can not only construct delay-constrained multicast tree correctly,but also has a less cost and a lower computational complexity than KPP.