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

Abstract:

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.

• Periodical: Applied Mechanics and Materials (Volumes 556-562)
• Pages: 4159-4162
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.556-562.4159
• Online since: May 2014
• Authors: Yuan Chen Li*, Wei Qun Liu
• Keywords: End-to-End Delay Bounded, MPH Algorithm, Routing Optimization, Steiner Tree

References

[1] Kompella V P, Pasqual J C, Polyzos G C. Multicast routing for multimedia communication [J]. IEEE/ACM Trans on Networking , 1993, 1(3): 286-292.

DOI: 10.1109/90.234851

[2] S. Kapoor and S. Raghavan. Improved Multicast Routing with Delay and Delay Variation Constraints[J]. IEEE Conference on Global Telecomm, 2000: 476-480.

DOI: 10.1109/glocom.2000.892050

[3] V.J. Rayward-Smith, A. Clare. On finding Steiner vertices [J]. Networks, 1986, 16: 283-294.

DOI: 10.1002/net.3230160305

[4] Li Yuanchen, Liu Weiqun. Delay-constrained multicast routing algorithm based on shared edges[J]. Journal of Computer Applications, 2009, 11(29): 1213-1215.

DOI: 10.3724/sp.j.1087.2009.02901

[5] Li hongbo and Wang Maobo. Dynamic Optimum of Shortest Path's Algorithm Devised by Floyd [J]. Computer engineering and Applications, 2006, 11(34): 60-63.