A Transceiver Saving Auxiliary Graph Model for Dynamic Traffic Grooming in WDM Mesh Networks

This paper addresses the dynamic traffic grooming problem in wavelength-division-multiplexed (WDM) mesh optical networks subject to wavelength constraint and transceiver constraint. As an improvement over the existing link bundled auxiliary graph (LBAG) model which thinks all traffic streams must go though the grooming fabric before entering the wavelength switch fabric, we introduce a transceiver saving auxiliary graph (TSAG) model and propose the TSAG method. In the TSAG model, we can determine whether a traffic stream should consume grooming ports or not. Various grooming policies are achieved by assigning the weight value of different edges in the auxiliary graph and their blocking performance are compared through simulations. Results show that the TSAG model has a lower blocking probability than LBAG while consuming the less running time, and TSAG can reduce the number of transceivers utilized while improving the wavelength utilization

[1]  Biswanath Mukherjee,et al.  A comprehensive study on next-generation optical grooming switches , 2003, IEEE J. Sel. Areas Commun..

[2]  Biswanath Mukherjee,et al.  Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming , 2003, IEEE Netw..

[3]  Arun K. Somani,et al.  Analysis of optical networks with heterogeneous grooming architectures , 2004, IEEE/ACM Transactions on Networking.

[4]  Biswanath Mukherjee,et al.  Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[5]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[6]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[7]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[8]  Bin Wang,et al.  A heuristic logical topology design algorithm for multi-hop dynamic traffic grooming in WDM optical networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[9]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..

[10]  B. Ramamurthy,et al.  A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks , 2005, IEEE Journal on Selected Areas in Communications.