Dynamic routing and spectrum allocation to minimize fragmentation in elastic optical networks

2017 ◽  
Author(s):  
Yadi Xu ◽  
Young-Chon Kim
Keyword(s):  
Optical Networks ◽  
Dynamic Routing ◽  
Spectrum Allocation ◽  
Routing And Spectrum Allocation

Dynamic Routing and Spectrum Allocation in Elastic Optical Networks With Mixed Line Rates

2014 ◽  
Vol 6 (12) ◽  
pp. 1115 ◽  
Author(s):  
Xiong Wang ◽  
Kaixuan Kuang ◽  
Sheng Wang ◽  
Shizhong Xu ◽  
Hong Liu ◽  
...  
Keyword(s):  
Optical Networks ◽  
Dynamic Routing ◽  
Spectrum Allocation ◽  
Routing And Spectrum Allocation ◽  
Mixed Line

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