Topological design of the wavelength-division optical network (original) (raw)

Algorithmic aspects of optical network design

Optical network design problems fall in the broad category of network optimization problems. We give a short introduction on network optimization and general algorithmic techniques that can be used to solve complex and difficult network design problems. We apply these techniques to address the static Routing and Wavelength Assignment problem that is related to planning phase of a WDM optical network. We present simulation result to evaluate the performance of the proposed algorithmic solution.

Network Design Problems in Wavelength Division Multiplexing Optical Networks

In this study, we analyze a network design problem arising in Wavelength Division Multiplexing (WDM) networks where traffic is static, wavelength interchanging is allowed and the location and number of the wavelength interchangers are to be determined. Given a topology and traffic data, we try to find the fiber and wavelength interchanger configuration with the minimum cost, that can establish all given connections. We present different formulations of the problem and some valid inequalities. Finally, we propose a heuristic method of generating feasible solutions, apply the method on three different topologies with varying traffic data, and present the results. The method is based on the idea of partitioning the problem into two; routing problems and wavelength assignment and interchanger location problem. Our results prove to be close to the lower bounds we generate, and indicate that the fiber cost performance of the case where all nodes are wavelength interchangers can be attained using a relatively small number of wavelength interchangers.