Skip to Main Content
This paper addresses the problem of dynamic multicast routing and wavelength assignment in delay constrained wavelength-routed WDM network. Current algorithms focus in minimizing blocking probability or wavelength numbers used, but not on the number of wavelength conversions. Wavelength conversions on either optical or electronics plane are costly and time consuming, hence should be minimized to ensure good transmission quality and manageable cost. In this paper, we proposed an algorithm on generic layered auxiliary graph to construct delay constrained dynamic multicast trees with minimal conversions and low blocking, and compared it with existing optimal algorithms through simulations. The results indicate that our proposed algorithm is able to achieve near optimal performance in terms of blocking, wavelength conversions and delays between source and members.