A Graph Model for DynamicWaveband Switching in WDM Mesh Networks

Authors

Mengke Li, University of Nebraska-LincolnFollow
Byrav Ramamurthy, University of Nebraska-LincolnFollow

Date of this Version

2004

Comments

Published in IEEE International Conference on Communications, 2004 Volume: 3. Copyright 2004 IEEE. Used by permission.

Abstract

We investigate the problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multi-granular optical cross-connect (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.