Coupling wavelength assignment in bidirectional lightpath: Is it worth the extra cost?

The introduction of end-to-end (multi hop) optical circuits (lightpaths) is often seen as the natural extension of a point-to-point (single hop) wavelength division multiplexing (WDM) transmission system, spanning across optical cross-connect nodes. Conventionally, a bidirectional lightpath (whether single or multi hop) comprises two lambda channels in fibers with opposite directions of signal propagation, which are assigned the same wavelength. This constraint is referred to as identical wavelength in bidirectional lightpath (IWBL). While IWBL is a natural and historical choice in point-to-point system, the authors are going to demonstrate that IWBL may unnecessarily increase the number of wavelength converters (WCs), which are required to establish lightpaths in the WDM network when the wavelength continuity constraint cannot be met. In the study, the IWBL constraint is relaxed, thus allowing the assignment of two distinct wavelengths to the same lightpath, one for each direction. A wavelength assignment (WA) algorithm is designed to both take advantage of the IWBL constraint relaxation and minimize the required number of WCs to establish a given set of lightpaths. The algorithm is then applied to a number of network topologies. The outcome is quite surprising, in that the amount of WC reduction obtained by relaxation of the IWBL constraint may be significant under certain conditions.

[1]  Andrea Fumagalli,et al.  The PlaNet-OTN module: A double layer design tool for optical transport networks , 2009, 2009 11th International Conference on Transparent Optical Networks.

[2]  Luca Valcarenghi,et al.  Challenges and requirements for introducing impairment-awareness into the management and control planes of ASON/GMPLS WDM networks , 2006, IEEE Communications Magazine.

[3]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[4]  Ioannis Tomkos,et al.  Impairment Aware Based Routing and Wavelength Assignment in Transparent Long Haul Networks , 2007, ONDM.

[5]  Klaus Jansen,et al.  The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..

[6]  Rahul Simha,et al.  The Partition Coloring Problem and its Application to Wavelength Routing and Assignment , 2000 .

[7]  J.P. Heritage,et al.  Connection provisioning with transmission impairment consideration in optical WDM networks with high-speed channels , 2005, Journal of Lightwave Technology.

[8]  Bo Li,et al.  A dynamic RWA algorithm in a wavelength-routed all-optical network with wavelength converters , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Hussein Al-Omari,et al.  New Graph Coloring Algorithms , 2006 .

[10]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[11]  Imrich Chlamtac,et al.  Lightpath (Wavelength) Routing in Large WDM Networks , 1996, IEEE J. Sel. Areas Commun..