Abstract: Based on the analysis of the algorithm for routing multicast with the constraint of QoS using the edge selection function, the paper discusses the construction of multicast tree when any change occurs in the destination or network cost. From the practical requirements, a new algorithm is proposed for selecting the edge that considers destination cost and network cost simultaneously. The algorithm provides a new method for link selection, improves the node search, and optimizes the destination and network cost. Simulation results are given, indicating that the cost and average delay of the proposed algorithm are better than destination-driven shortest path(DDSP).


Key words: destination-drive
n shortest path(DDSP), edge selection function, time-constraint, multicast routing