TY - JOUR
T1 - Wavelength assignment for multicast in all-optical WDM networks with splitting constraints
AU - Wang, Jianping
AU - Qi, Xiangtong
AU - Chen, Biao
PY - 2006/2
Y1 - 2006/2
N2 - Multicast is an important application in all-optical WDM networks. The wavelength assignment problem for WDM multicast is to assign a set of wavelengths to the links of a given multicast tree. In an all-optical WDM network without wavelength conversions, wavelength assignment is the key to guarantee the quality of service and to reduce communication costs. In this paper, we study wavelength assignment for WDM multicast with two criteria, to cover the maximum number of destinations, and to minimize the wavelength costs. The computational complexity of the problem is studied. Three heuristic algorithms are proposed and the worst-case approximation ratios for some heuristic algorithms are given. We also derive a lower bound of the minimum total wavelength cost and an upper bound of the maximum number of reached destinations. The efficiency of the proposed heuristic algorithms and the effectiveness of the derived bounds are verified by the simulation results. © 2006 IEEE.
AB - Multicast is an important application in all-optical WDM networks. The wavelength assignment problem for WDM multicast is to assign a set of wavelengths to the links of a given multicast tree. In an all-optical WDM network without wavelength conversions, wavelength assignment is the key to guarantee the quality of service and to reduce communication costs. In this paper, we study wavelength assignment for WDM multicast with two criteria, to cover the maximum number of destinations, and to minimize the wavelength costs. The computational complexity of the problem is studied. Three heuristic algorithms are proposed and the worst-case approximation ratios for some heuristic algorithms are given. We also derive a lower bound of the minimum total wavelength cost and an upper bound of the maximum number of reached destinations. The efficiency of the proposed heuristic algorithms and the effectiveness of the derived bounds are verified by the simulation results. © 2006 IEEE.
KW - Heuristics
KW - NP-complete
KW - Wavelength assignment
KW - WDM multicast
UR - http://www.scopus.com/inward/record.url?scp=33144470470&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33144470470&origin=recordpage
U2 - 10.1109/TNET.2005.863481
DO - 10.1109/TNET.2005.863481
M3 - RGC 21 - Publication in refereed journal
SN - 1063-6692
VL - 14
SP - 169
EP - 182
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 1
ER -