TY - JOUR
T1 - On the optimal placement of wavelength converters in WDM networks
AU - Jia, Xiao-Hua
AU - Du, Ding-Zhu
AU - Hu, Xiao-Dong
AU - Huang, He-Jiao
AU - Li, De-Ying
PY - 2003/6/2
Y1 - 2003/6/2
N2 - An important goal of the design of wavelength division multiplexing (WDM) networks is to use less wavelengths to serve more communication needs. According to the wavelength conflict rule, we know that the number of wavelengths required in a WDM network is at least equal to the maximal number of channels over a fiber (called maximal link load) in the network. By placing wavelength converters at some nodes in the network, the number of wavelengths needed can be made equal to the maximal link load. In this paper, we study the problem of placing the minimal number of converters in a network to achieve that the number of wavelengths in use is equal to the maximal link load. For duplex communication channels, we prove that the optimal solution can be obtained in polynomial-time. For unidirectional communication channels, which was proved to be NP-complete, we develop a set of lemmas which lead to a simple approximation algorithm whose theoretically guaranteed performance ratio is at most two. © 2002 Elsevier Science B.V. All rights reserved.
AB - An important goal of the design of wavelength division multiplexing (WDM) networks is to use less wavelengths to serve more communication needs. According to the wavelength conflict rule, we know that the number of wavelengths required in a WDM network is at least equal to the maximal number of channels over a fiber (called maximal link load) in the network. By placing wavelength converters at some nodes in the network, the number of wavelengths needed can be made equal to the maximal link load. In this paper, we study the problem of placing the minimal number of converters in a network to achieve that the number of wavelengths in use is equal to the maximal link load. For duplex communication channels, we prove that the optimal solution can be obtained in polynomial-time. For unidirectional communication channels, which was proved to be NP-complete, we develop a set of lemmas which lead to a simple approximation algorithm whose theoretically guaranteed performance ratio is at most two. © 2002 Elsevier Science B.V. All rights reserved.
KW - Converter placement
KW - Multihop systems
KW - Wavelength assignment
KW - Wavelength conversion
KW - WDM networks
UR - http://www.scopus.com/inward/record.url?scp=0038417992&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0038417992&origin=recordpage
U2 - 10.1016/S0140-3664(02)00191-3
DO - 10.1016/S0140-3664(02)00191-3
M3 - 21_Publication in refereed journal
VL - 26
SP - 986
EP - 995
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
IS - 9
ER -