Premium
Minimizing number of wavelengths in multicast routing trees in WDM networks
Author(s) -
Li Deying,
Du Xiufeng,
Hu Xiaodong,
Ruan Lu,
Jia Xiaohua
Publication year - 2000
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/1097-0037(200007)35:4<260::aid-net4>3.0.co;2-p
Subject(s) - multicast , computer science , wavelength division multiplexing , computer network , tree (set theory) , routing (electronic design automation) , routing and wavelength assignment , distributed computing , wavelength , mathematics , optics , combinatorics , physics
In a WDM network under multihop architecture, each link is associated with a set of wavelengths available for channel connections, and in the network, the number of wavelengths that can be used is limited. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay. Given a multicast connection, routing is to construct a tree for the connection that is rooted from the source and connects all destinations. In this paper, we consider the problem of constructing a routing tree with a minimal number of wavelengths on the tree. We first prove that this problem is NP‐hard and then propose an approximation algorithm, which produces a routing tree that has not only a small number of wavelengths but also a short delay from the source to all destinations. © 2000 John Wiley & Sons, Inc.