Approximation Algorithms for Multicast Routing and Wavelength Assignment in Multi-hop Optical WDM Networks

• Published in: 2011 Fourth International Joint Conference on Computational Sciences and Optimization pp. 1291 - 1295
• Main Authors: Tianping Shuai, Wenbao Ai
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.04.2011
• Subjects: Algorithm design and analysis; approximation algorithm; Approximation algorithms; multicast; Optical wavelength conversion; Routing; Steiner trees; Wavelength assignment; WDM network; WDM networks
• ISBN: 9781424497126; 1424497124
• DOI: 10.1109/CSO.2011.93

Existing research has demonstrated that effective Routing and Wavelength Assignment (RWA) algorithm and wavelength conversion are two primary vehicles for improving the networks performance. In this paper, we consider the multicast routing and wavelength assignment problem (MC-RWA) in multi-hop optical WDM networks, where requests arrives one by one. Specially, we first analyze this problem under the objective of minimizing maximum hops, an efficient MC-RWA algorithm was proposed in this case. But for minimizing the total number of wavelength conversions, the problem turns out to be NP-hard, hence we propose an efficient approximation MC-RWA algorithm. At last, combine the the two objectives, we propose a bi-factor approximation algorithm to minimize the total wavelength conversions and the maximum hops in the system simultaneously.