Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Computer Networksarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Computer Networks
Article . 2020 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2020
Data sources: DBLP
versions View all 2 versions
addClaim

On solving the capacitated routing and spectrum allocation problem for flexgrid optical networks

Authors: Carlos M. Araújo; João Marcos P. Silva; Anand Subramanian 0001; Iguatemi E. Fonseca;

On solving the capacitated routing and spectrum allocation problem for flexgrid optical networks

Abstract

Abstract The elastic optical networks, a.k.a., flexgrid networks, have flexible spectrum allocation. Such flexibility is possible due to the division of the spectrum into narrow frequency slots and the use of bandwidth-variable transponders. This enables the demand, in terms of band request, to be contiguously allocated starting from any available slot of the spectrum. In this context, the RSA (Routing and Spectrum Allocation) was proposed as an offline optimization problem of allocating the optical transmission resources in order to meet a predefined set of demands. This work deals with the capacitated version of the RSA problem. To solve it, we develop a multi-commodity flow formulation based on ILP (Integer Linear Programming) and a load balancing procedure that generate promising paths for an ILP formulation from the literature. Extensive computational experiments show that the proposed solution approaches are capable of obtaining high quality solutions on a variety of scenarios.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    5
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
5
Top 10%
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!