A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges

Chunde Yang, Xin Zhao

College of Computer Science and Technology, Chongqing University of Posts and Telecommunication, Chongqing, China.
College of Computer Science and Technology, Chongqing University of Posts and Telecommunication, Chongqing, China;Institute of System Theory and Application, Chongqing University of Posts and Telecommunication, Chongqing, China.

DOI: 10.4236/cn.2014.61006                

Abstract

In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.

Keywords

Multicast Routing Algorithm; Shared Edges; Quality of Service Constraint; Delay Constraint

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	Y.-H. Min, “A Survey on Computer Network Routing,” Chinese Journal of Computers, Vol. 6, 2003.
[2]	D. T. Lotarev and A. P. Uzdemir, “Conversion of the Steiner Problem on the Euclidean Plane to the Steiner Problem on Graph,” Automation and Remote Control, Vol. 66, No. 10, 2005, pp. 1603-1613. http://dx.doi.org/10.1007/s10513-005-0194-y
[3]	P. Winter, “Steiner Problem in Networks: A Survey,” Networks, Vol. 17, No. 2, 1987, pp. 129-167. http://dx.doi.org/10.1109/90.234851
[4]	V. P. Kompella, J. C. Pasquale and G. C. Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ ACM Transaction on Networking, Vol. 1, No. 3, 1993, pp. 286-292. http://dx.doi.org/10.1109/90.234851
[5]	M. Parsa, Q. Zhu and J. J. Garcia-Luna-Aceves, “An Iterative Algorithm for Delay-Constrained Minimum Cost Multicasting,” IEEE/ACM Transaction on Networking, Vol. 6, No. 4, 1998, pp. 461-474. http://dx.doi.org/10.1109/90.720901
[6]	Q. Sun and H. Langendorfer, “Efficient Multicast Routing for Delay-Sensitive Applications [EB/OL],” 1995. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.57.4260&rep=rep1&type=pdf
[7]	Y. C. Li and W. Q. Liu, “Delay-Constrained Multicast Routing Algorithm Based on Shared Edges,” Journal of Computer Applications, Vol. 29, No. 11, 2009, pp. 1213-1215. http://dx.doi.org/10.3724/SP.J.1087.2009.02901
[8]	L. Zhou and Y. M. Sun, “A Delay-Constrained Steiner Tree Algorithm Using MPH,” Journal of Computer Research and Development, Vol. 45, No. 5, 2008, pp. 810-816.
[9]	B. M. Waxman, “Routing of Multipoint Connections,” IEEE Journal on Selected Areas in Communications, Vol. 6, No. 9, 1988, pp. 1617-1622. http://dx.doi.org/10.1109/49.12889