Routing and spectrum allocation algorithms for elastic optical networks with dedicated path protection

2014 ◽  
Vol 13 ◽  
pp. 63-75 ◽  
Author(s):  
Krzysztof Walkowiak ◽  
Mirosław Klinkowski ◽  
Bartosz Rabiega ◽  
Róża Goścień
Keyword(s):  
Optical Networks ◽  
Spectrum Allocation ◽  
Path Protection ◽  
Dedicated Path Protection ◽  
Routing And Spectrum Allocation ◽  
Allocation Algorithms

scholarly journals A column generation technique for routing and spectrum allocation in cloud–ready survivable elastic optical networks

2017 ◽  
Vol 27 (3) ◽  
pp. 591-603 ◽  
Author(s):  
Róża Goścień ◽  
Krzysztof Walkowiak
Keyword(s):  
Optical Networks ◽  
Column Generation ◽  
Network Flows ◽  
Optimization Problems ◽  
Average Distance ◽  
Spectrum Allocation ◽  
Algorithm Performance ◽  
Path Protection ◽  
Fast Development ◽  
Routing And Spectrum Allocation

AbstractDriven by increasing user requirements and expectations, the fast development of telecommunications networks brings new challenging optimization problems. One of them is routing and spectrum allocation (RSA) of three types of network flows (unicast, anycast, multicast) in elastic optical networks (EONs) implementing dedicated path protection (DPP). In the paper, we model this problem as integer linear programming (ILP) and we introduce two new optimization approaches—a dedicated heuristic algorithm and a column generation (CG)-based method. Then, relying on extensive simulations, we compare algorithm performance with reference methods and evaluate CG efficiency in detail. The results show that the proposed CG method significantly outperforms reference algorithms and achieves results very close to optimal ones (the average distance to optimal results was at most 2.1%).

scholarly journals Attack-Aware Dedicated Path Protection in Optical Networks

2016 ◽  
Vol 34 (4) ◽  
pp. 1050-1061 ◽  
Author(s):  
Marija Furdek ◽  
Nina Skorin-Kapov ◽  
Lena Wosinska
Keyword(s):  
Optical Networks ◽  
Path Protection ◽  
Dedicated Path Protection

Research on CLIB Routing and Spectrum Allocation Algorithm in Elastic Optical Networks

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Li Li ◽  
Zhai Ya-Fang ◽  
Li Hong-Jie
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Rapid Development ◽  
Optical Network ◽  
Spectrum Allocation ◽  
Mobile Internet ◽  
High Definition ◽  
Allocation Algorithm ◽  
High Bandwidth ◽  
Routing And Spectrum Allocation

AbstractWith the rapid development of mobile Internet, high-definition video and cloud computing, users’ bandwidth demands are not only larger and larger but also more and more diverse. To solve this problem, there searchers put forward the concept of elastic optical network (EON). EON adopts the transmission mode of elastic grid, which can allocate spectrum resources flexibly and meet high bandwidth and diversity requirements at the same time. Routing and spectrum allocation (RSA) is an important issue in EON. In this paper, we present a heuristic algorithm named constrained-lower-indexed-block (CLIB) allocation algorithm for the RSA problem. The algorithm is based on the K candidate paths. When there are available spectrum blocks on multiple candidate paths, if the increase of the path length does not exceed a given threshold, the lower index spectrum would be selected for the connection request on a longer path. The aim of the algorithm is to concentrate the occupied frequency slices on one side of the spectrum and leave another side of the spectrum to the later arrived connection requests as much as possible, to reduce the blocking probability of connection requests. Simulation results show that comparing with the first-last-fit and hybrid grouping algorithms, the CLIB algorithm can reduce the blocking probability of connection requests.

Sign in / Sign up

Export Citation Format

Share Document