Routing and wavelength assignment by partition colouring
TF Noronha, CC Ribeiro - European Journal of Operational Research, 2006 - Elsevier
The problem of routing and wavelength assignment in all-optical networks may be solved by
a combined approach involving the computation of alternative routes for the lightpaths …
a combined approach involving the computation of alternative routes for the lightpaths …
A biased random-key genetic algorithm for routing and wavelength assignment
The problem of routing and wavelength assignment in wavelength division multiplexing
optical networks consists in routing a set of lightpaths and assigning a wavelength to each of …
optical networks consists in routing a set of lightpaths and assigning a wavelength to each of …
Routing and wavelength assignment in optical networks using bin packing based algorithms
N Skorin-Kapov - European Journal of Operational Research, 2007 - Elsevier
This paper addresses the problem of routing and wavelength assignment (RWA) of static
lightpath requests in wavelength routed optical networks. The objective is to minimize the …
lightpath requests in wavelength routed optical networks. The objective is to minimize the …
Routing and wavelength assignment in optical networks from edge disjoint path algorithms
P Manohar, D Manjunath… - IEEE Communications …, 2002 - ieeexplore.ieee.org
Routing and wavelength assignment (RWA) problems in wavelength-routed optical
networks are typically solved using a combination of integer programming and graph …
networks are typically solved using a combination of integer programming and graph …
Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks
N Skorin-Kapov - IEEE Journal on selected areas in …, 2006 - ieeexplore.ieee.org
This paper addresses the problem of routing and wavelength assignment (RWA) of
scheduled lightpath demands (SLDs) in wavelength routed optical networks with no …
scheduled lightpath demands (SLDs) in wavelength routed optical networks with no …
A branch‐and‐cut algorithm for partition coloring
Abstract Let G=(V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of
edges, and Q={Q1,…, Qq} is a partition of V into q subsets. We refer to Q1,…, Qq as the …
edges, and Q={Q1,…, Qq} is a partition of V into q subsets. We refer to Q1,…, Qq as the …
Routing and wavelength assignment over WDM optical networks: a comparison between MOACOs and classical approaches
The increasing demand of bandwidth has found an answer in Optical Transport Networks
(OTN). To take advantage of the different resources that OTNs offer, several parameters …
(OTN). To take advantage of the different resources that OTNs offer, several parameters …
Routing and wavelength assignment in all optical networks using differential evolution optimization
The routing and wavelength assignment (RWA) problem, known to be an NP-complete
problem, seeks to optimally establish routes and adequate wavelengths for the requested …
problem, seeks to optimally establish routes and adequate wavelengths for the requested …
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
Given a set of lightpath requests, the problem of routing and wavelength (RWA) assignment
in wavelength division multiplexing (WDM) optical networks consists in routing a subset of …
in wavelength division multiplexing (WDM) optical networks consists in routing a subset of …
Lightpath rerouting strategies in WDM all-optical networks under scheduled and random traffic
M Koubàa, M Gagnaire - Journal of Optical Communications …, 2010 - ieeexplore.ieee.org
In WDM all-optical networks without wavelength conversion, traffic rerouting is motivated
either by an optimization of resource utilization or by network survivability. In this paper, we …
either by an optimization of resource utilization or by network survivability. In this paper, we …