An efficient routing strategy for WDM networks.

Wavelength Division Multiplexing (WDM) in optical communication networks is the technology that can satisfy the ever-increasing bandwidth demands of network users. It has been proved that WDM technology based on wavelength routing can bridge the bandwidth mismatch between users and fiber equipments. The problem in routing in a WDM network is to send the required traffic from the sources to their respective destinations by ensuring the most optimum usage of network resources. Routing problem in WDM is a multi-commodity network flow problem, which is typically solved using Linear Programming (LP) formulation using a LP solver such as the CPLEX. In a network of moderate size, the number of variables and constraints in the corresponding LP is not unmanageably large and straightforward LP solver, such as the CPLEX, gives the optimal solution. But when we consider a large network, the size of the basis becomes so large that CPLEX cannot handle it. This thesis has investigated the routing problem in WDM networks, and has used the arc-chain formulation for routing in WDM networks. A LP formulation has been developed to minimize the congestion of a WDM network using the arc-chain method and the generalized upper bound technique. Finally, the thesis has explored a number of approaches to expedite the solution process and has reported experiments to handle the routing problem in WDM networks. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2004 .D49. Source: Masters Abstracts International, Volume: 43-03, page: 0873. Adviser: Subir Bandyopadhyay. Thesis (M.Sc.)--University of Windsor (Canada), 2004.