## Efficient Impairment-Constrained 3R Regenerator Placement for Light-Trees in Optical Networks |

Journal of Optical Communications and Networking, Vol. 3, Issue 4, pp. 359-371 (2011)

http://dx.doi.org/10.1364/JOCN.3.000359

Enhanced HTML Acrobat PDF (464 KB)

### Abstract

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.

© 2011 OSA

**OCIS Codes**

(060.4255) Fiber optics and optical communications : Networks, multicast

(060.4256) Fiber optics and optical communications : Networks, network optimization

(060.4264) Fiber optics and optical communications : Networks, wavelength assignment

**ToC Category:**

Research Papers

**History**

Original Manuscript: August 2, 2010

Revised Manuscript: January 4, 2011

Manuscript Accepted: January 5, 2011

Published: March 31, 2011

**Citation**

Yi Zhu, Xiaofeng Gao, Weili Wu, and Jason P. Jue, "Efficient Impairment-Constrained 3R Regenerator Placement for Light-Trees in Optical Networks," J. Opt. Commun. Netw. **3**, 359-371 (2011)

http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-3-4-359

Sort: Year | Journal | Reset

### References

- Y. Morita, H. Hasegawa, K. Sato, Y. Sone, K. Yamada, and M. Jinno, "Optical multicast tree construction algorithm considering SNR constraint and 3R regeneration," Proc. of ECOC, 2008, pp. 1‒2.
- S. Sankaranarayanan and S. Subramaniam, "Comprehensive performance modeling and analysis of multicasting in optical networks," IEEE J. Sel. Areas Commun. 21, (9), 1399‒1413 (2003). [CrossRef]
- D. Li, X. Du, X. Hu, L. Ruan, and X. Jia, "Minimizing number of wavelengths in multicast routing trees in WDM networks," Networks 35, (4), 260‒265 (2000). [CrossRef]
- T. Durhuus, C. Joergensen, B. Mikkelsen, R. J. S. Pedersen, and K. E. Stubkjaer, "All optical wavelength conversion by SOA’s in a Mach–Zehnder Configuration," IEEE Photon. Technol. Lett. 6, (1), 53‒55 (1994). [CrossRef]
- M. Hamad and A. E. Kamal, "Efficient power-aware network provisioning for all-optical multicasting in WDM mesh networks," Proc. of IEEE GLOBECOM, 2008, pp. 1‒5.
- M. Scheffel, "Regenerator allocation strategies for optical transparency domains considering transmission limitations," Proc. of IEEE ICC, 2005, pp. 1771‒1776.
- S. W. Kim, W. W. Seo, and S. C. Kim, "Regenerator placement algorithms for connection establishment in all-optical networks," Proc. of IEEE GLOBECOM, 2000, pp. 1205‒1209.
- G. Shen, W. D. Grover, T. H. Chen, and S. K. Bose, "Sparse placement of electronic switching nodes for low blocking in translucent optical networks," J. Opt. Netw. 1, (12), 424‒441 (2002).
- X. Yang and B. Ramamurthy, "Dynamic routing in translucent WDM optical networks: the intradomain case," J. Lightwave Technol. 23, (3), 955‒971 (2005). [CrossRef]
- B. Chen and J. Wang, "Efficient routing and wavelength assignment for multicast in WDM networks," IEEE J. Sel. Areas Commun. 20, (1), 97‒109 (2002). [CrossRef]
- I. Chlamtac, A. Farago, and T. Zhang, "Lightpath (wavelength) routing in large WDM networks," IEEE J. Sel. Areas Commun. 14, (5), 909‒913 (2003). [CrossRef]
- W. Liang and H. Shen, "Multicasting and broadcasting in large WDM networks," Proc. of IPPS/SPDP, 1998, pp. 516‒523.
- H. Shen, F. Chin, and Y. Pan, "Efficient fault-tolerant routing in multihop optical WDM networks," IEEE Trans. Parallel Distrib. Syst. 10, (10), 1012‒1025 (1999). [CrossRef]
- T. F. Znati, T. Alrabiah, and R. Melhem, "Low-cost, delay-bounded point-to-point communication to support multicasting over WDM networks," Comput. Netw. 38, (4), 423‒445 (2002). [CrossRef]
- http://en.wikipedia.org/wiki/Power_budget
- R. Libeskind-Hadas, "Efficient collective communication in WDM networks with a power budget," Proc. of IEEE ICCCN, 2000, pp. 612‒616.
- Y. Xin and G. N. Rouskas, "Multicast routing under optical layer constraints," Proc. of IEEE INFOCOM, 2004, pp. 2731‒2742.
- R. Libeskind-Hadas and R. Melhem, "Multicast routing and wavelength assignment in multihop optical networks," IEEE/ACM Trans. Netw. 10, (5), 621‒629 (2002). [CrossRef]
- S. Gao, X. Jia, X. Hu, and D. Li, "Wavelength requirements and routing for multicast connections in lightpath and light-tree models of WDM networks with limited drops," IEE Proc.-Commun. 148, (6), 363‒367 (2001). [CrossRef]
- X. D. Hu, T. P. Shuai, X. Jia, and M. H. Zhang, "Multicast routing and wavelength assignment in WDM networks with limited drops," Proc. of IEEE INFOCOM, 2004, pp. 487‒494.
- A. M. Hamad and A. E. Kamal, "Routing and wavelength assignment with power aware multicasting in WDM networks," Proc. of IEEE BROADNETS, 2005, pp. 31‒40.
- S. Pachnicke, T. Paschenda, and P. M. Krummrich, "Physical impairment based regenerator placement and routing in translucent optical networks," Proc. of OSA OFC/NFOEC, 2008, pp. 1‒3.
- Y. Peng, W. Hu, W. Sun, X. Wang, and Y. Jin, "Impairment constraint multicasting in translucent WDM networks: architecture, network design and multicasting routing," Photonic Network Commun. 13, (1), 93‒102 (2007). [CrossRef]
- L. Sahasrabuddhe and B. Mukherjee, "Light trees: optical multicasting for improved performance in wavelength routed networks," IEEE Commun. Mag. 37, (2), 67‒73 (1999). [CrossRef]
- Y. Yang, J. Wang, and C. Qiao, "Nonblocking WDM multicast switching networks," IEEE Trans. Parallel Distrib. Syst. 11, (12), 1274‒1287 (2000). [CrossRef]
- H. Takahashi and A. Matsuyama, "An approximate solution for the steiner problem in graphs," Math. Japonica 24, (6), 573‒577 (1980).
- Edward F. Moore, "The shortest path through a maze," Proc. of the Int. Symp. on the Theory of Switching, Vol. 2, 1959, pp. 285‒292.
- C. Y. Lee, "An algorithm for path connection and its applications," IRE Trans. Electron. Comput. 10, (3), 346‒365 (1961). [CrossRef]
- E. W. Dijkstra, "A note on two problems in connexion with graphs," Numer. Math. 1, (1), 269‒271 (1959). [CrossRef]

## Cited By |
Alert me when this paper is cited |

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article | Next Article »

OSA is a member of CrossRef.