TY - JOUR
T1 - Resource Allocation in Multicore Elastic Optical Networks
T2 - A Deep Reinforcement Learning Approach
AU - Pinto-Ríos, Juan
AU - Calderón, Felipe
AU - Leiva, Ariel
AU - Hermosilla, Gabriel
AU - Beghelli, Alejandra
AU - Bórquez-Paredes, Danilo
AU - Lozada, Astrid
AU - Jara, Nicolás
AU - Olivares, Ricardo
AU - Saavedra, Gabriel
N1 - Publisher Copyright:
© 2023 Juan Pinto-Ríos et al.
PY - 2023
Y1 - 2023
N2 - A deep reinforcement learning (DRL) approach is applied, for the first time, to solve the routing, modulation, spectrum, and core allocation (RMSCA) problem in dynamic multicore fiber elastic optical networks (MCF-EONs). To do so, a new environment was designed and implemented to emulate the operation of MCF-EONs - taking into account the modulation format-dependent reach and intercore crosstalk (XT) - and four DRL agents were trained to solve the RMSCA problem. The blocking performance of the trained agents was compared through simulation to 3 baselines RMSCA heuristics. Results obtained for the NSFNet and COST239 network topologies under different traffic loads show that the best-performing agent achieves, on average, up to a four-times decrease in blocking probability with respect to the best-performing baseline heuristic method.
AB - A deep reinforcement learning (DRL) approach is applied, for the first time, to solve the routing, modulation, spectrum, and core allocation (RMSCA) problem in dynamic multicore fiber elastic optical networks (MCF-EONs). To do so, a new environment was designed and implemented to emulate the operation of MCF-EONs - taking into account the modulation format-dependent reach and intercore crosstalk (XT) - and four DRL agents were trained to solve the RMSCA problem. The blocking performance of the trained agents was compared through simulation to 3 baselines RMSCA heuristics. Results obtained for the NSFNet and COST239 network topologies under different traffic loads show that the best-performing agent achieves, on average, up to a four-times decrease in blocking probability with respect to the best-performing baseline heuristic method.
UR - http://www.scopus.com/inward/record.url?scp=85149985355&partnerID=8YFLogxK
U2 - 10.1155/2023/4140594
DO - 10.1155/2023/4140594
M3 - Article
AN - SCOPUS:85149985355
SN - 1076-2787
VL - 2023
JO - Complexity
JF - Complexity
M1 - 4140594
ER -