By Topic

Efficient Impairment-Constrained 3R Regenerator Placement for Light-Trees in Optical 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

4 Author(s)
Yi Zhu ; Comput. Sci. Dept., Univ. of Texas at Dallas, Dallas, TX, USA ; Xiaofeng Gao ; Weili Wu ; Jue, J.P.

Light-trees can efficiently guarantee point-to-multipoint connection in optical networks for many widely used multicast applications, such as Internet protocol television (IPTV). The establishment of a light-tree requires the placement of 3R regenerators along the tree due to the wavelength continuity constraint and physical impairments. Thus, the problem is to establish a light-tree and to assign wavelengths such that the number of regenerators is minimized. We call this problem the efficient 3R regenerator placement (ERP) problem. If we fix the routing of the multicast tree, then how to place a minimum number of regenerators and assign wavelengths to links becomes a subproblem of ERP, which is named the wavelength assignment and regenerator placement (WARP) problem. We find that ERP is NP-hard, and then provide an approximation algorithm named SPT-ReWa, which has a subroutine named ReWa which can solve WARP optimally. We prove that ReWa can find an optimal solution for WARP, and we analyze the approximation ratio of SPT-ReWa for ERP. Finally, we illustrate several simulation scenarios to show the efficiency of SPT-ReWa.

Published in:

Optical Communications and Networking, IEEE/OSA Journal of  (Volume:3 ,  Issue: 4 )