The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the
dimensioning and management of a next-generation of optical transport networks, called …

In this thesis, we study a variant of the Routing and Spectrum Assignment problem (RSA),
namely the Constrained-Routing and Spectrum Assignment (C-RSA). The C-RSA problem is …

In this work, we focus on a complex variant of the so-called Routing and Spectrum
Assignment problem (RSA), namely the Constrained-Routing and Spectrum Assignment (C …

The constrained-routing and spectrum assignment (C-RSA) problem is a key issue when
dimensioning and designing an optical network. Given an optical network G and a multiset …

Abstract The Constrained-Routing and Spectrum Assignment (C-RSA) problem arises in the
design of 5 G telecommunication optical networks. Given an undirected, loopless, and …

Abstract We consider the Constrained-Routing and Spectrum Assignment (C-RSA) problem.
Given an undirected, loopless, and connected graph G, an optical spectrum S of available …

With the ever increasing demand for optical networks, many decisions about network
planning are becoming increasingly challenging. One of these crucial decisions is the …

The emergence of Elastic Optical Networks allowed a more flexible spectrum allocation for
routing traffic demands within telecommunication networks. From this context arises the …

Abstract The Min Slot-Continuity Capacity Loss (MSCL) algorithm is listed in the literature as
a powerful algorithm to solve the spectrum assignment (SA) problem in elastic optical …

The routing and spectrum allocation (RSA) problem arises in the context of flexible grid
optical networks, and consists in routing a set of demands through a network while …