Routing and Wavelength Assignment in WDM Networks with Bounded-Degree Tree and Tree of Rings Topologies

Shaoqiang  Zhang; Gang  Hou; Chunyong  Ding

1st International ICST Conference on Communications and Networking in China

Research Article

Routing and Wavelength Assignment in WDM Networks with Bounded-Degree Tree and Tree of Rings Topologies

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2006.344755,
    author={Shaoqiang  Zhang and Gang  Hou and Chunyong  Ding},
    title={Routing and Wavelength Assignment in WDM Networks with Bounded-Degree Tree and Tree of Rings Topologies},
    proceedings={1st International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2007},
    month={4},
    keywords={},
    doi={10.1109/CHINACOM.2006.344755}
}

Shaoqiang Zhang
Gang Hou
Chunyong Ding
Year: 2007
Routing and Wavelength Assignment in WDM Networks with Bounded-Degree Tree and Tree of Rings Topologies
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2006.344755

Shaoqiang Zhang¹^,*, Gang Hou¹, Chunyong Ding¹

1: College of Computer and Information Engineering, Tianjin Normal University, Tianjin, 300387, China

*Contact email: sqzhang@mail.tjnu.edu.cn

Abstract

In all-optical networks that use wavelength division multiplexing (WDM) technique, a challenging problem called the routing and wavelength assignment problem (RWA) is modelled as that connection requests must be assigned paths and wavelengths such that intersecting paths receive different wavelengths, and the goal is to minimize the number of wavelengths used. Besides the tree, another popular network topology is the tree of rings which is obtained by interconnecting rings in a tree structure such that any two rings share at most one node. A polynomial-time optimal algorithm and an approximation algorithm are given for the RWA problem in bounded-degree tree and tree of rings networks, respectively.

Published: 2007-04-10
Publisher: IEEE

: http://dx.doi.org/10.1109/CHINACOM.2006.344755