Motivated by the increasing importance of multifiber WDM networks we study a routing and wavelength assignment problem in such networks. In this problem the number of wavelengths per fiber is given and the goal is to minimize the cost of fiber links that need to be reserved in order to satisfy a set of communication requests; we introduce a generalized setting where network pricing is non-unifo...

The routing and wavelength assignment problem is one of the most important issues in optical transport networks based on the Wavelength Division Multiplexing (WDM) technique. In this paper, a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths is proposed. The performance of the proposed algorithm is compared with that of the bounded greedy approach fo...

We address the problem of routing and wavelength assignment (RWA) considering differentiated reliability (DiR) in WDM mesh networks. The backup resource can be shared by the primary lightpaths. However, both the primary-backup sharing and the different levels of fault tolerance requirement have never been considered together in the literature. In the paper, we consider the dynamic character of ...

We propose a novel method for combined Routing and Wavelength Assignment (RWA) in optical networks by reformulation to an equivalent Pseudo-Boolean Satisfiability (PB-SAT) problem. We introduce edge observability variables to represent whether an edge is on the optimal route, combined with either a simple or a hierarchical SAT encoding to select a wavelength for that edge only when the edge is ...

SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and wavelength assignment of the traffic streams. Following previous work, we consider the problem where the route of each traffic stream is given as input, and we need to assign wavelengths so as to minimize the total nu...

In this paper, we investigate the problem of routing and wavelength assignment as well as the problem of the placement of wavelength converters in all-optical networks. In particular, we present a general framework, based on the blocking island (BI) paradigm, to illustrate how it can be used to solve these problems in a unified way. We first give a brief introduction about the BI graph network ...

We introduce Colored Resource Allocation Games as a new model for selfish routing and wavelength assignment in multifiber all-optical networks. Colored Resource Allocation Games are a generalization of congestion and bottleneck games where players have their strategies in multiple copies (colors). We focus on two main subclasses of these games depending on the player cost: in Colored Congestion...

This document provides a model of information needed by the Routing and Wavelength Assignment (RWA) process in Wavelength Switched Optical Networks (WSONs). The purpose of the information described in this model is to facilitate constrained optical path computation in WSONs. This model takes into account compatibility constraints between WSON signal attributes and network elements but does not ...

Power demand in networking equipment is expected to become a main limiting factor and hence a fundamental challenge to ensure bandwidth scaling in the next generation Internet. Environmental effects of human activities, such as CO2 emissions and the consequent global warming have risen as one of the major issue for the ICT sector and for the society. Therefore, it is not surprising that telecom...

4