Routing and wavelength assignment strategies in optical networks

We consider the routing and wavelength assignment (RWA) problem on wavelength division multiplexing (WDM) networks without wavelength conversion. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In WDM optical networks, there is need to maximize the number of connections established and to minimize the blocking probability using limited resources. This paper presents efficient RWA strategies, which minimizes the blocking probability. Simulation results show that the performance of the proposed strategies is much better than the existing strategy.

[1]  Oliver W. W. Yang,et al.  A Lagrangean relaxation and subgradient framework for the routing and wavelength assignment problem in WDM networks , 2004, IEEE Journal on Selected Areas in Communications.

[2]  Ajay K. Sharma,et al.  Restoration approach in WDM optical networks , 2007 .

[3]  Paramjeet Singh,et al.  Distributed control based survivability strategy for WDM optical networks , 2004 .

[4]  Emmanuel Dotaro,et al.  Routing and wavelength assignment of scheduled lightpath demands , 2003, IEEE J. Sel. Areas Commun..

[5]  A.K. Sharma,et al.  Routing and wavelength assignment in WDM optical networks , 2006, 2006 IFIP International Conference on Wireless and Optical Communications Networks.

[6]  A.K. Sharma,et al.  Survivability strategy with congestion control in WDM optical networks , 2007, 2007 International Symposium on High Capacity Optical Networks and Enabling Technologies.