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

has been cited by the following article:

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

  AUTHORS: Chunde Yang, Xin Zhao

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

  JOURNAL NAME: Communications and Network, Vol.6 No.1, February 13, 2014

  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.