Abstract

In this article we solve the Routing and Spectre Assignment problem for elastic, static, without wavelength conversion networks with ring topology. The problem is to find a route for each connection and assign the same portion of spectrum in each link of the route. The proposed solution minimizes the cost of the network, represented as the sum of frequency slot units used on each link. An integer programming model it’s used to represent the described problem. As a method of resolution we propose a solving strategy in two stages to first find the shortest path for each connection and then use the integer programming model, using only the proposed routes. The results of two types of instances are displayed and compared with the results of Shortest Path-First Fit. The proposed method achieves up to 22 % savings.