The introduction of elastic optical networks (EONs) leads to new challenges, such as the problem of routing, modulationlevel, and spectrumassignment. In the literature, the best among the shortest routes (BSR) algor...
详细信息
The introduction of elastic optical networks (EONs) leads to new challenges, such as the problem of routing, modulationlevel, and spectrumassignment. In the literature, the best among the shortest routes (BSR) algorithm was proposed as fixed and fixed-alternate routing for EONs, but without considering physical impairments. Therefore, call requests were handled not taking into account the different bandwidth requirements as well as the impact on the optical signal quality of transmission when different modulationlevels are considered. This is the first study to undertake heuristics based on BSR algorithm considering a fixed-alternate routing approach jointly with physical layer constraints in EONs. In order to assess the effectiveness of the proposed BSR heuristics in this paper, a genetic and a particle swarm optimization algorithms were also proposed. The results obtained by numerical simulations in different network physical topologies available in the literature show the effectiveness of our proposals in reducing the blocking probability of call requests in comparison with the traditional Yen algorithm.
In this paper, we propose a novel hybrid strategy that combines mixed integer linear programming (MILP) formulation with different alternative routing approaches that is capable of solving, simultaneously, the routing...
详细信息
In this paper, we propose a novel hybrid strategy that combines mixed integer linear programming (MILP) formulation with different alternative routing approaches that is capable of solving, simultaneously, the routing, modulation format and spectrumassignment problem in the design of elastic optical networks. We extend our proposal to a path-link formulation that, although it is not guaranteed to find the optimal solution, it has shown reasonable solutions within inferior simulation time, allowing it to be used in not very short networks. We also compare our proposal with another MILP formulation and three adapted heuristics, all available in the literature. The results show the benefits of our proposal considering diverse simulation scenarios and different number of modulation formats over 19 realistic networks in terms of simulation run time and maximum number of used set of slots.
暂无评论