Abstract: According to the delay and delay difference constraint multicast routing optimization problem, an optimal cost multicast routing algorithm is proposed. The algorithm which adjusts the new nodes priority through indicator function, uses a greedy strategy based on Dijkstra Shortest Path Tree(SPT) algorithm and local information to construct lower cost multicast tree. It offers a good balance between tree cost, delay and delay difference. Simulation results show that the algorithm can correctly constructs a multicast tree to meet the delay and delay difference constraint, and has good comprehensive performance such as low time complexity, high success rate and so on.
delay and delay difference constraint,
Dijkstra Shortest Path Tree(SPT),
Quality of Service(QoS),
link selection function