A prime-partition strategy for spectrum assignment problem in elastic optical networks

2021 ◽  
Vol 64 ◽  
pp. 102532
Author(s):  
Junling Yuan ◽  
Lu Han ◽  
Xuhong Li ◽  
Qikun Zhang ◽  
Ruijie Zhu ◽  
...  
2021 ◽  
Author(s):  
Karcius Assis ◽  
Alex Santos ◽  
Raul Almeida ◽  
Thiale Moura ◽  
Rafael Vieira ◽  
...  

Abstract In this paper, we propose a novel hybrid strategy that combines mixed integer linearprogramming (MILP) formulation with different alternative routing approaches that is capable ofsolving, simultaneously, the routing, modulation format and spectrum assignment problem in thedesign of elastic optical networks. We extend our proposal to a path-link formulation that, althoughit is not guaranteed to find the optimal solution, it has shown reasonable solutions within inferiorsimulation time, allowing it to be used in not very short networks. We also compare our proposalwith another MILP formulation and three adapted heuristics, all available in the literature. Theresults show the benefits of our proposal considering diverse simulation scenarios and differentnumber of modulation formats over19realistic networks in terms of simulation run time andmaximum number of used set of slots.


Author(s):  
Iyad Katib

Heuristic-based approaches are widely deployed in solving Spectrum Assignment problem. This causes the results to be unreliable in some test cases when the results are very far from the lowerbound. This paper presents an exhaustive search approach that starts with an initial seed of a solution achieved by a heuristic-based algorithm called “Longest First Fit” (LFF) and tries all possible permutations starting from this initial seed. The algorithm skips some branches and all its descendant permutations if it meets certain criteria that guarantees that those permutations will not lead to a better result. The experimental results show that the new algorithm has succeeded in achieving the lower-bound in 93% of the randomly generated test cases while the heuristic solver LFF can achieve 65%. The algorithm achieves these results in a reasonable running time of less than 10 seconds.


2021 ◽  
pp. 108287
Author(s):  
Henrique A. Dinarte ◽  
Bruno V.A. Correia ◽  
Daniel A.R. Chaves ◽  
Raul C. Almeida

Sign in / Sign up

Export Citation Format

Share Document