4.6 Article

Security-aware 5G RAN slice mapping with tiered isolation in physical-layer secured metro-aggregation elastic optical networks using heuristic-assisted DRL

Journal

JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING
Volume 15, Issue 12, Pages 969-984

Publisher

Optica Publishing Group
DOI: 10.1364/JOCN.499551

Keywords

5G mobile communication; Security; Heuristic algorithms; Resource management; Encryption; Optical switches; Routing

Ask authors/readers for more resources

This paper investigates the security-aware 5G RAN slice mapping problem with tiered isolation policy in optical networks. It introduces the physical-layer secured OTNs and formulates the problem as an exact ILP model. To overcome scalability issue, a heuristic-assisted deep reinforcement learning algorithm is proposed. Simulation results show that the proposed method can achieve approximate solutions in small-scale network scenarios and higher resource efficiency in large-scale scenarios.
The optical transport network (OTN) encryption technology is attractive to solve the physical-layer security in services for the light-path provision process. This paper mainly explores the security-aware 5G radio access network (RAN) slice mapping problem with the tiered isolation (TI) policy, which decides the solution for aggregating service into the physical-layer secured metro-aggregation elastic optical networks (MA-EONs). We first introduce the physical-layer secured OTNs and illustrate their differences from the traditional optical networks. Then, we formulate the 5G RAN slice mapping problem in physical-layer secured MA-EONs as an exact integer linear programming (ILP) model to minimize the average cost (AC), which consists of the number of utilized processing pools (PPs)/general-purpose processors (GPPs)/virtual machines (VMs), and maximum frequency slot index (MFSI) on the light-paths, meanwhile satisfying the given slice's latency, isolation, and security requirements. After that, to overcome the non-scalability problem of the ILP model, a heuristic-assisted deep reinforcement learning (HA-DRL) algorithm is proposed to obtain a near-optimal solution for large-scale network scenarios, where the classical shortest path algorithm is employed in the DRL to shrink the size of the exploration space and accelerate the convergence process. Finally, we evaluate the proposed ILP model and HA-DRL algorithm through extensive simulations. Simulation results indicate that our proposed HA-DRL method can find approximate solutions to the ILP model in the small-scale network scenario. Furthermore, the HA-DRL method can also achieve higher resource efficiency compared with benchmark heuristic first-fit algorithms in the large-scale network scenario. In comparison to the first-fit algorithm benchmark, the proposed HA-DRL can achieve up to 9.4% AC reduction in large-scale network scenarios. (c) 2023 Optica Publishing Group

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available