Optimal placement of wavelength converters in WDM optical networks with a general tree of rings topology

Author

Chen, Guangting ; Li, Guojun ; Xue, Guoliang

Author_Institution

Dept. of Comput. Sci., Vermont Univ., Burlington, VT, USA

fYear

2000

fDate

2000

Firstpage

606

Lastpage

611

Abstract

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 (1998) as the minimum sufficient set problem. This problem is NP-complete in general WDM networks. Wan et al. (1999), showed that the problem is tractable if every edge in the network is bi-directed and the skeleton of the network is a tree of rings. We show that the minimum sufficient set problem is tractable in any directed graph with a general tree of rings skeleton

Keywords

directed graphs; minimisation; network topology; optical fibre networks; optical wavelength conversion; set theory; telecommunication network routing; trees (mathematics); wavelength division multiplexing; NP-complete problem; WDM; directed graph; minimum sufficient set problem; network topology; optical networks; optimal placement; tree of rings skeleton; wavelength converters; wavelength routing; Computer science; Intelligent networks; Optical fiber networks; Optical wavelength conversion; Skeleton; Tree graphs; WDM networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 2000. Proceedings. Ninth International Conference on

Conference_Location

Las Vegas, NV

ISSN

1095-2055

Print_ISBN

0-7803-6494-5

Type

conf

DOI

10.1109/ICCCN.2000.885551

Filename

885551