Title of article :
Routing to reduce the cost of wavelength conversion Original Research Article
Author/Authors :
Thomas Erlebach، نويسنده , , Stamatis Stefanakos، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Pages :
13
From page :
2911
To page :
2923
Abstract :
We consider all-optical networks that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their capacity usage. We investigate the effect of allowing reroutings on the number of necessary wavelength converters. We disprove a claim of Wilfong and Winkler [G. Wilfong, P. Winkler, Ring routing and wavelength translation, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’98, 1998, pp. 333–341] according to which reroutings do not have any effect on the number of necessary wavelength converters on bidirected networks. We show that there exist (bidirected) networks on image nodes that require image converters without reroutings, but only image converters if reroutings are allowed. We also address the cases of undirected networks and networks with shortest-path routings. In each case, we resolve the complexity of computing optimal placements of converters.
Keywords :
Graph algorithms , Sufficient set , Path coloring , Wavelength assignment , Optical networks
Journal title :
Discrete Applied Mathematics
Serial Year :
2008
Journal title :
Discrete Applied Mathematics
Record number :
886876
Link To Document :
بازگشت