A heuristic algorithm for minimum cost multicast routing in OTN network

Abstract

It is important to support the multicast in the OTN network since multicast services are becoming more popular and multicasting will result in the improvement of resource utilization rate. 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 multicast routing in OTN, a new minimum cost tree heuristic algorithm is brought forward by us, which takes account of path sharing and load balancing. The simulation results show that the proposed multicast routing algorithm can achieve the preferable performance.