Abstract: A new algorithm for dynamic delay-constrained multicast routing directed at ensuring real time requirement of multicast tree and for efficiency of network resource using is proposed. The algorithm takes into account of the influence of path delay to tree cost and makes use of the method finding the k shortest paths and the function of selecting path to create multicast tree. When the delay constraint is satisfied, the algorithm will get the low cost tree quickly and can update multicast tree based on adding/deleting requirements of nodes. A large number of simulations demonstrate that the algorithm has nice cost performance and can satisfy the real time requirement of network.

Key words: delay constraint, multicast routing, quality of service, dynamic