Title :
Approximation Algorithms for Multicast Routing and Wavelength Assignment in Multi-hop Optical WDM Networks
Author :
Shuai, Tianping ; Ai, Wenbao
Author_Institution :
Sch. of Sci., Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
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.
Keywords :
approximation theory; multicast communication; optical fibre networks; telecommunication network routing; wavelength assignment; wavelength division multiplexing; MC-RWA algorithm; NP-hard problem; RWA algorithm; bifactor approximation algorithm; multicast routing; multicast routing and wavelength assignment problem; multihop optical WDM networks; routing-wavelength assignment algorithm; wavelength conversion; Algorithm design and analysis; Approximation algorithms; Optical wavelength conversion; Routing; Steiner trees; WDM networks; Wavelength assignment; WDM network; approximation algorithm; multicast; routing; wavelength assignment;
Conference_Titel :
Computational Sciences and Optimization (CSO), 2011 Fourth International Joint Conference on
Conference_Location :
Yunnan
Print_ISBN :
978-1-4244-9712-6
Electronic_ISBN :
978-0-7695-4335-2
DOI :
10.1109/CSO.2011.93