routing and spectrum allocation
Recently Published Documents


TOTAL DOCUMENTS

123
(FIVE YEARS 36)

H-INDEX

16
(FIVE YEARS 3)

2021 ◽  
Vol 2 (3) ◽  
pp. 24-26
Author(s):  
Lina Cheng

Dynamic allocation request and spectrum release will lead to spectrum fragmentation, which will affect the allocation of subsequent services and spectrum resource utilization of elastic optical network. This paper proposes a new routing and spectrum allocation algorithm based on deep learning, which will find the best routing and spectrum allocation method for a specific network, so as to improve the overall network performance. Simulation results show that compared with the traditional resource allocation strategy, the neural network model used in this paper can improve the degree of spectrum fragmentation and reduce the network blocking probability.


Electronics ◽  
2021 ◽  
Vol 10 (22) ◽  
pp. 2809
Author(s):  
Yang Wang ◽  
Chaoyang Li ◽  
Qian Hu ◽  
Jabree Flor ◽  
Maryam Jalalitabar

The recent decade has witnessed a tremendous growth of Internet traffic, which is expected to continue climbing for the foreseeable future. As a new paradigm, Spectrum-sliced Elastic Optical Path (SLICE) networks promise abundant (elastic) bandwidth to address the traffic explosion, while bearing other inherent advantages including enhanced signal quality and extended reachability. The fundamental problem in SLICE networks is to route each traffic demand along a lightpath with continuously and consecutively available sub-carriers, which is known as the Routing and Spectrum Allocation (RSA) problem. Given its NP-Hardness, the solutions to the RSA problem can be classified into two categories: optimal solutions using link-based, path-based, and channel-based Integer Linear Programming (ILP) models, which require extensive computational time; and sub-optimal heuristic and meta-heuristic algorithms, which have no guarantee on the solution quality. In this work, inspired by a channel-based ILP model, we propose a novel primal-dual framework to address the RSA problem, which can obtain a near-optimal solution with guaranteed per-instance closeness to the optimal solution.


Author(s):  
Shahzad Alam ◽  
Muhammad Umar Masood ◽  
Ihtesham Khan ◽  
Arsalan Ahmad ◽  
Salman Ghafoor ◽  
...  

Author(s):  
Fernando Lezama ◽  
Alberto F. Martínez-Herrera ◽  
Gerardo Castañón ◽  
Carolina Del-Valle-Soto ◽  
Ana Maria Sarmiento ◽  
...  

2020 ◽  
Vol 181 ◽  
pp. 107535
Author(s):  
Carlos M. Araújo ◽  
João Marcos P. Silva ◽  
Anand Subramanian ◽  
Iguatemi E. Fonseca

Sign in / Sign up

Export Citation Format

Share Document