Spectrum Assignment in Mesh Elastic Optical Networks

Viewing a computationally-intensive problem as a self-contained challenge with its own hardware, software and scheduling strategies is an approach that should be investigated. We might suggest assigning heterogeneous hardware architectures to solve a problem, while parallel computing paradigms may play an important role in writing efficient code to solve the problem; moreover, the scheduling strategies may be examined as a possible solution. Depending on the problem complexity, finding the best possible solution using an integrated infrastructure of hardware, software and scheduling strategy can be a complex job. Developing and using ontologies and reasoning techniques play a significant role in reducing the complexity of identifying the components of such integrated infrastructures. Undertaking reasoning and inferencing regarding the domain concepts can help to find the best possible solution through a combination of hardware, software and scheduling strategies. In this paper, we present an ontology and show how we can use it to solve computationally-intensive problems from various domains. As a potential use for the idea, we present examples from the bioinformatics domain. Validation by using problems from the Elastic Optical Network domain has demonstrated the flexibility of the suggested ontology and its suitability for use with any other computationally-intensive problem domain.

show abstract

“…We achieved the same results as in [23]. The same simplicity was achieved when the ontology was deployed in this case.…”

Section: Optical Path Findingsupporting

confidence: 74%

Ontology Design for Solving Computationally-Intensive Problems on Heterogeneous Architectures

et al. 2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…The RSA problem is a generalization of the well-studied routing and wavelength assignment (RWA) problem that is associated with a fixed grid of frequencies [6]. The former problem has started to receive a lot of attention over the last few years.…”

Section: Introductionmentioning

confidence: 99%

“…The SA problem has been shown to be NP-hard on paths [16] which makes the SA problem (and thus also the RSA problem) much harder than the RWA problem which is well-known to be polynomially solvable on paths, see e.g. [6]. More formally, for the RSA problem, we are given a network G and a set D of end-to-end traffic demands where each demand is specified by a pair u, v of distinct nodes in G and the number d uv of required frequency slots.…”

Section: Introductionmentioning

confidence: 99%

On Superperfection of Edge Intersection Graphs of Paths

Kerivin

Wagler

2020

AIRO Springer Series

View full text Add to dashboard Cite

The routing and spectrum assignment problem in flexgrid elastic optical networks can be modeled in two phases: a selection of paths in the network and an interval coloring problem in the edge intersection graph of these paths. The interval chromatic number equals the smallest size of a spectrum such that a proper interval coloring is possible, the weighted clique number is a natural lower bound. Graphs where both parameters coincide for all possible non-negative integral weights are called superperfect. We examine the question which minimal non-superperfect graphs can occur in the edge intersection graphs of paths in different underlying networks. We show that for any possible network (even if it is restricted to a path) the resulting edge intersection graphs are not necessarily superperfect and discuss some consequences.

show abstract

“…Thereby, the following constraints need to be respected when dealing with the RSA problem: 1) spectrum continuity: the frequency slots allocated to a demand remain the same on all the links of a route; 2) spectrum contiguity: the frequency slots allocated to a demand must be contiguous; 3) non-overlapping spectrum: a frequency slot can be allocated to at most one demand. The RSA problem is a generalization of the well-studied Routing and Wavelength Assignment (RWA) problem that is associated with a fixed grid of frequencies [3].…”

Section: Introductionmentioning

confidence: 99%

“…The SA problem has been shown to be NP-hard on paths [14] which makes the SA problem (and thus also the RSA problem) much harder than the RWA problem which is well-known to be polynomially solvable on paths, see e.g. [3].…”

Section: Introductionmentioning

confidence: 99%

A novel integer linear programming model for routing and spectrum assignment in optical networks

Hadhbi¹,

Kerivin²,

Wagler³

2019

Proceedings of the 2019 Federated Conference on Computer Science and Information Systems

View full text Add to dashboard Cite

The routing and spectrum assignment problem is an NP-hard problem that receives increasing attention during the last years. Existing integer linear programming models for the problem are either very complex and suffer from tractability issues or are simplified and incomplete so that they can optimize only some objective functions. The majority of models uses edgepath formulations where variables are associated with all possible routing paths so that the number of variables grows exponentially with the size of the instance. An alternative is to use edgenode formulations that allow to devise compact models where the number of variables grows only polynomially with the size of the instance. However, all known edge-node formulations are incomplete as their feasible region is a superset of all feasible solutions of the problem and can, thus, handle only some objective functions. Our contribution is to provide the first complete edge-node formulation for the routing and spectrum assignment problem which leads to a tractable integer linear programming model. Indeed, computational results show that our complete model is competitive with incomplete models as we can solve instances of the RSA problem larger than instances known in the literature to optimality within reasonable time and w.r.t. several objective functions. We further devise some directions of future research.

show abstract

Spectrum Assignment in Mesh Elastic Optical Networks

Cited by 8 publications

References 24 publications

Ontology Design for Solving Computationally-Intensive Problems on Heterogeneous Architectures

Ontology Design for Solving Computationally-Intensive Problems on Heterogeneous Architectures

On Superperfection of Edge Intersection Graphs of Paths

A novel integer linear programming model for routing and spectrum assignment in optical networks

Contact Info

Product

Resources

About