A dynamic heuristic algorithm for minimum cost multicast routing in OTN network

It is important to support the multicast in the OTN network since multicast services are becoming more and more popular. To support multicast in a cost-effective way, the multicast of OTN should be realized in electronic domain based on ODU-level rather than optical domain in our point of view. In order to implement dynamic multicast routing in OTN, a new minimum cost tree heuristic algorithm is brought forward by us, which takes account of delay constraint and load balancing. The simulation results show that the proposed multicast routing algorithm has a high performance of load balancing in constructing delay-constrained low-cost dynamic multicast tree with a very low time complexity.