By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tianping Shuai ; Sch. of Sci., Beijing Univ. of Posts & Telecommun., Beijing, China ; Wenbao Ai

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.

Published in:

Computational Sciences and Optimization (CSO), 2011 Fourth International Joint Conference on

Date of Conference:

15-19 April 2011