Research on Optimal Routing Algorithm with End-to-End Delay Bounded

This paper researches the problem of minimization of delay under the multicast end-to-end delay bounded and presents a new multicast routing algorithm. This algorithm using anew strategy based on Optimized_Floyd algorithm modifies the paths from the source node to the destinations, the nodes whose delay are smaller than the average achieves a new delay as big as possible and the nodes whose delay are above the average achieves a new delay as small as possible. So it also offers a good balance between tree cost and delay. Simulation results show that the algorithm has low cost, less time complexity and good comprehensive performance, can be used in actual network environment.