A graph model for dynamic waveband switching in WDM mesh networks

Author

Li, Mengke ; Ramamurthy, Byrav

Author_Institution

Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA

Volume

3

fYear

2004

fDate

20-24 June 2004

Firstpage

1821

Abstract

The problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests is investigated. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multigranular optical crossconnect (MG-OXC), we construct an auxiliary graph. Based on the auxiliary graph, we develop two heuristic on-line WBS algorithms with different grouping policies, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Our results show that the WFAUG algorithm outperforms the BFAUG algorithm.

Keywords

graph theory; mesh generation; optical fibre networks; telecommunication traffic; wavelength division multiplexing; WDM mesh networks; auxiliary graph; dynamic traffic requests; graph model; grouping policies; heuristic on-line WBS algorithms; multigranular optical crossconnect; waveband switching; wavelength-division multiplexing; wavelength-first WBS algorithm; Costs; Heuristic algorithms; Intelligent networks; Mesh networks; Optical fiber networks; Performance analysis; Routing; Telecommunication traffic; WDM networks; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2004 IEEE International Conference on

Print_ISBN

0-7803-8533-0

Type

conf

DOI

10.1109/ICC.2004.1312822

Filename

1312822