Implementation of genetic algorithms in optical wavelength ring routed network design.

The design process of the ring routed wavelength optical network encompasses the search for a layout order of nodes such that the total overall traffic is minimized in terms of distant communication and traffic frequencies. The optimal solution is a member of a massive domain set reaching sizes in the order of n!, where n is the number of nodes in the network; typically n = 100. A brute force, linear search algorithm can be implemented, but when executed in search for an optimal solution, the algorithm is a computational challenge as it becomes time consuming and renders itself unfeasible in realistic design time criteria. In researching a suitable search algorithm with the flexibility to adapt to changing network traffic parameters and render a near optimal solution in reasonable design time constraints, the genetic algorithm presents a candidate solution to be tested. The goal of this thesis is to implement a custom genetic algorithm and examine its potential in reaching near optimal solutions in the optical design application framework. The course of work was divided into three major development stages. In the first stage, a simple object oriented GA model was developed (SGA). Then the model was customized to the ring routed network design application, known as the Simple Optical Genetic Algorithm (SOGA) and finally the revised algorithm is implemented and termed the Optical Genetic Algorithm (OGA). In smaller networks (up to 12 nodes) the GA is compared to a brute force linear algorithm to test its performance. For larger networks, the GA was compared to a random search algorithm to test its effectiveness. In both cases, the GA has shown to surpass the other algorithms in generating a pool of near optimal solutions in reasonable time constraints. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1999 .K63. Source: Masters Abstracts International, Volume: 40-03, page: 0724. Adviser: Subic Bandgopadhyay. Thesis (M.Sc.)--University of Windsor (Canada), 1999

Power-Aware Logical Topology Design Heuristics in Wavelength-Routing Networks

Abstract—Wavelength-Routing (WR) networks are the most common solution for core networks. With the access segment moving from copper to Passive Optical Networks (PON), core networks will become one of the major culprits of Internet power consumption. However, WR networks offer some design flexibility which can be exploited to mitigate their energy requirements. One of the main steps which has to be faced in designing WR networks is the planning of the Logical Topology (LT) starting from the matrix of traffic requests. In this paper, we propose a Mixed Integer Linear Programming (MILP) formulation to find power-wise optimal LTs. In addition, due to the complexity of the MILP approach we propose a greedy heuristic and a genetic algorithm (GA) ensuring performance close to the one achieved by the MILP formulation. I

Energy-efficient traffic engineering

The energy consumption in telecommunication networks is expected to grow considerably, especially in core networks. In this chapter, optimization of energy consumption is approached from two directions. In a first study, multilayer traffic engineering (MLTE) is used to assign energy-efficient paths and logical topology to IP traffic. The relation with traditional capacity optimization is explained, and the MLTE strategy is applied for daily traffic variations. A second study considers the core network below the IP layer, giving a detailed power consumption model. Optical bypass is evaluated as a technique to achieve considerable power savings over per-hop opticalelectronicoptical regeneration. Document type: Part of book or chapter of boo