Date of Award


Publication Type

Master Thesis

Degree Name



Computer Science


Computer Science.




The routing problem in Wavelength-division multiplexing (WDM) networks, on a given logical topology, is to find an optimum scheme for data communication so that the network may handle all traffic requirements in an efficient manner and minimize the network congestion. This problem is typically solved using a Linear Programming (LP) formulation using the node-arc representation and a LP solver such as the CPLEX. As the network size increases, the time taken by a tool like CPLEX to find a solution to the routing problem becomes unacceptable. This thesis investigates a novel technique, using the arc-chain formulation for representing the logical topology, to speed up the solution of the routing problem. We use eta-factorization with the generalized upper bound (GUB) technique to solve such problems. Experiments show that our approach significantly outperforms the standard LP techniques based on a node-arc formulation, in terms of the time required to generate an optimal solution.Dept. of Computer Science. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2005 .K35. Source: Masters Abstracts International, Volume: 44-03, page: 1403. Thesis (M.Sc.)--University of Windsor (Canada), 2005.