An efficient delay-constrained multicast routing algorithm based on shared tree strategy
Fan Xiu · Journal of the China Railway Society · 2001
An efficient delay constrained multicast routing algorithm based on shared tree strategy(STMA) was proposed in this paper. The running complexity of it is O(m|V| 2) , where m is the number of group members, | V | is the number of nodes in network. Experimental results through simulations show that STMA achieves good performance with moderate running complexity.