An efficient delay-constrained multicast routing algorithm

We propose a simple multicast routing heuristic for delay-sensitive applications. The running complexity of it is O(m|V), where m is the number of group members and |V is the number of nodes in the network. Experimental results through simulations show that the DCMA achieves good performance.