Comparison of ILP formulations for the RWA problem
We present a review of the integer linear programming (ILP) formulations that have been
proposed for the routing and wavelength assignment problem in WDM optical networks …
proposed for the routing and wavelength assignment problem in WDM optical networks …
[BOOK][B] Dissemination of Information in Optical Networks:: From Technology to Algorithms
S Bandyopadhyay - 2007 - books.google.com
Optical networks and the related technologies, network management software and services
have undergone remarkable developments, and such networks are now the ultra-high …
have undergone remarkable developments, and such networks are now the ultra-high …
Efficient spectrum utilization in large scale RWA problems
While the routing and wavelength assignment (RWA) has been widely studied, a very few
studies attempt to solve realistic size instances, namely, with 100 wavelengths per fiber and …
studies attempt to solve realistic size instances, namely, with 100 wavelengths per fiber and …
ILP formulations for the routing and wavelength assignment problem: Symmetric systems
Different integer linear programming (ILP) formulations have been proposed for the routing
and wavelength assignment problem in WDM optical networks, mainly for asymmetrical …
and wavelength assignment problem in WDM optical networks, mainly for asymmetrical …
Randomized rounding algorithms for large scale unsplittable flow problems
Unsplittable flow problems cover a wide range of telecommunication and transportation
problems and their efficient resolution is key to a number of applications. In this work, we …
problems and their efficient resolution is key to a number of applications. In this work, we …
Dynamic unsplittable flows with path-change penalties: New formulations and solution schemes for large instances
In this work, we consider the dynamic unsplittable flow problem. This variation of the
unsplittable flow problem has received little attention so far. The unsplittable flow problem is …
unsplittable flow problem has received little attention so far. The unsplittable flow problem is …
A realistic network/application model for scheduling divisible loads on large-scale platforms
Divisible load applications consist of an amount of data and associated computation that can
be divided arbitrarily into any number of independent pieces. This model is a good …
be divided arbitrarily into any number of independent pieces. This model is a good …
ILP formulations and optimal solutions for the RWA problem
We present a review of the various integer linear programming (ILP) formulations that have
been proposed for the routing and wavelength assignment problem in WDM optical …
been proposed for the routing and wavelength assignment problem in WDM optical …
Traffic grooming in unidirectional WDM ring networks using design theory
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic.
We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We …
We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We …
On the minimum cost multiple-source unsplittable flow problem
M Belaidouni, W Ben-Ameur - RAIRO-Operations Research, 2007 - cambridge.org
The minimum cost multiple-source unsplittable flow problem is studied in this paper. A
simple necessary condition to get a solution is proposed. It deals with capacities and …
simple necessary condition to get a solution is proposed. It deals with capacities and …