TY - GEN
T1 - Optimal placement of wavelength converters in WDM optical networks with a general tree of rings topology
AU - Chen, Guangting
AU - Li, Guojun
AU - Xue, Guoliang
N1 - Funding Information:
* Department of Computer Science, The University of Vermont, Burlington, VT 05405. Email: gtchen@cs.uvm.edu. Also from the School of Science and Arts, Hangzhou Institute of Electronic Engineering, Hangzhou 310037, P.R.China. The research of this author is supported in part by ARO grant DAAH04-96-1-0233 and by NSF of China grant 19971078. t Department of Computer Science, The University of Vermont, Burlington, VT 05405. Email: gjli@cs.uvm.edu. Also from the Department of Mathematics, Shandong University, Jinan 250100, China. The research of this author is supported in part by ARO grant DAAH04-96-1-0233 and by the National Natural Science Foundation of China. $Corresponding author. Department of Computer Science, The University of Vermont, Burlington, VT 05405. Email: xue@cs.uvm.edu. The re- search of this author is supported in part by ARO grant DAAH04-96-1-0233 and NSF grants ASC-9409285 and OSR-9350540.
Publisher Copyright:
© 2000 IEEE.
PY - 2000
Y1 - 2000
N2 - In wavelength routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. The problem of placing a minimum number of wavelength converters in a WDM network so that any routing can be satisfied using no more wavelengths than if there were wavelength converters at every node was raised by Wilfong and Winkler as the minimum sufficient set problem. This problem is NP-complete in general WDM networks. In a recent paper, Wan, Liu and Frieder showed that the problem is tractable if every edge in the network is bi-directedand the skeleton of the network is a tree of rings. In this paper, we show that the minimum sufficient set problem is tractable in any directed graph with a general tree of rings skeleton.
AB - In wavelength routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. The problem of placing a minimum number of wavelength converters in a WDM network so that any routing can be satisfied using no more wavelengths than if there were wavelength converters at every node was raised by Wilfong and Winkler as the minimum sufficient set problem. This problem is NP-complete in general WDM networks. In a recent paper, Wan, Liu and Frieder showed that the problem is tractable if every edge in the network is bi-directedand the skeleton of the network is a tree of rings. In this paper, we show that the minimum sufficient set problem is tractable in any directed graph with a general tree of rings skeleton.
KW - General tree of rings
KW - WDM optical networks
KW - Wavelength converters
UR - http://www.scopus.com/inward/record.url?scp=1842669573&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1842669573&partnerID=8YFLogxK
U2 - 10.1109/ICCCN.2000.885551
DO - 10.1109/ICCCN.2000.885551
M3 - Conference contribution
AN - SCOPUS:1842669573
T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN
SP - 606
EP - 611
BT - Proceedings - 9th International Conference on Computer Communications and Networks, ICCCN 2000
A2 - Engbersen, Ton
A2 - Park, E. K.
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 9th International Conference on Computer Communications and Networks, ICCCN 2000
Y2 - 16 October 2000 through 18 October 2000
ER -