A New Delay Constraint Multicast Routing Algorithm
Weisheng Li · Computer Technology and Development · 2006
A new algorithm for delay-constrained minimum-cost multicast routing directed at ensuring real time requirement and resource usage of multicast tree is proposed.The algorithm is based on an algorithm of creating minimum-cost multicast tree,changes the delays among nodes dynamically,finds shortest path which satisfies delay constraint,and gets delay-constrained minimum-cost tree quickly.A large number of simulations demonstrate that the algorithm has nice creating speed and nice cost performance,and can satisfy the real time requirement of network.