Abstract:Virtualized radio access networks (vRAN) are emerging as a key component of wireless cellular networks, and it is therefore imperative to optimize their architecture. vRANs are decentralized systems where the Base Station (BS) functions can be split between the edge Distributed Units (DUs) and Cloud computing Units (CUs); hence they have many degrees of design freedom. We propose a framework for optimizing the number and location of CUs, the function split for each BS, and the association and routing for each … Show more
“…Table I describes the particular vRAN split options and their requirements. Our model refers to the standardization of 3GPP [1], [2] and seminal white paper [3], where each split has a different performance gain [6], [11]. Split 0: All functions are at DU, except the RF layer is at RU.…”
Section: System Modelmentioning
confidence: 99%
“…Going from Split 1 to 3, more functions are hosted at CU. In addition to increasing network performance, a higher centralization level can lead to more cost-saving [11]. However, centralizing more functions increases the data load to be transferred to CU, going from λ in S0 to 2.5 Gbps in S3 for each BS, and has stricter delay requirements (Table I).…”
Section: System Modelmentioning
confidence: 99%
“…Follow up works, [8] and [9] offered optimal solution of minimizing total cost for integration vRAN with Mobile Edge Computing (MEC). Then, [10] proposed an optimized multi-cloud vRAN framework with balancing its centralization [11]. However, the mentioned works above rely on mathematical optimization techniques that often have a slow convergence rate and exponential complexity for finding the optimal solution, particularly in large networks.…”
Section: Introductionmentioning
confidence: 99%
“…It is worth noting that our approach requires minimal handcrafted engineering. It does not need to know the vRAN split problem mathematically, e.g., mathematical optimization-based approaches [8]- [11], or direct access to the optimal labeled data, e.g., supervised learning [21]. Instead, it learns from interaction with the environment that expects to receive the reward (total network cost) signal and Penalization (constraints violation).…”
Section: Introductionmentioning
confidence: 99%
“…We evaluate our approach in a synthetic network generated by the Waxman algorithm that highly represents a backhaul network [26]. The used system parameters are from a measurement-based 3GPP-compliant system model [10], [11]. To assess our approach's effectiveness, we compare it to the optimal value obtained from a Phyton-MIP solver 1 .…”
Virtualized Radio Access Network (vRAN) is one of the key enablers of future wireless networks as it brings the agility to the radio access network (RAN) architecture and offers degrees of design freedom. Yet, it also creates a challenging problem on how to design the functional split configuration. In this paper, a deep reinforcement learning approach is proposed to optimize function splitting in vRAN. A learning paradigm is developed that optimizes the location of functions in the RAN. These functions can be placed either at a central/cloud unit (CU) or a distributed unit (DU). This problem is formulated as constrained neural combinatorial reinforcement learning to minimize the total network cost. In this solution, a policy gradient method with Lagrangian relaxation is applied that uses a stacked long short-term memory (LSTM) neural network architecture to approximate the policy. Then, a sampling technique with a temperature hyperparameter is applied for the inference process. The results show that our proposed solution can learn the optimal function split decision and solve the problem with a 0.4% optimality gap. Moreover, our method can reduce the cost by up to 320% compared to a distributed-RAN (D-RAN). We also conclude that altering the traffic load and routing cost does not significantly degrade the optimality performance.
“…Table I describes the particular vRAN split options and their requirements. Our model refers to the standardization of 3GPP [1], [2] and seminal white paper [3], where each split has a different performance gain [6], [11]. Split 0: All functions are at DU, except the RF layer is at RU.…”
Section: System Modelmentioning
confidence: 99%
“…Going from Split 1 to 3, more functions are hosted at CU. In addition to increasing network performance, a higher centralization level can lead to more cost-saving [11]. However, centralizing more functions increases the data load to be transferred to CU, going from λ in S0 to 2.5 Gbps in S3 for each BS, and has stricter delay requirements (Table I).…”
Section: System Modelmentioning
confidence: 99%
“…Follow up works, [8] and [9] offered optimal solution of minimizing total cost for integration vRAN with Mobile Edge Computing (MEC). Then, [10] proposed an optimized multi-cloud vRAN framework with balancing its centralization [11]. However, the mentioned works above rely on mathematical optimization techniques that often have a slow convergence rate and exponential complexity for finding the optimal solution, particularly in large networks.…”
Section: Introductionmentioning
confidence: 99%
“…It is worth noting that our approach requires minimal handcrafted engineering. It does not need to know the vRAN split problem mathematically, e.g., mathematical optimization-based approaches [8]- [11], or direct access to the optimal labeled data, e.g., supervised learning [21]. Instead, it learns from interaction with the environment that expects to receive the reward (total network cost) signal and Penalization (constraints violation).…”
Section: Introductionmentioning
confidence: 99%
“…We evaluate our approach in a synthetic network generated by the Waxman algorithm that highly represents a backhaul network [26]. The used system parameters are from a measurement-based 3GPP-compliant system model [10], [11]. To assess our approach's effectiveness, we compare it to the optimal value obtained from a Phyton-MIP solver 1 .…”
Virtualized Radio Access Network (vRAN) is one of the key enablers of future wireless networks as it brings the agility to the radio access network (RAN) architecture and offers degrees of design freedom. Yet, it also creates a challenging problem on how to design the functional split configuration. In this paper, a deep reinforcement learning approach is proposed to optimize function splitting in vRAN. A learning paradigm is developed that optimizes the location of functions in the RAN. These functions can be placed either at a central/cloud unit (CU) or a distributed unit (DU). This problem is formulated as constrained neural combinatorial reinforcement learning to minimize the total network cost. In this solution, a policy gradient method with Lagrangian relaxation is applied that uses a stacked long short-term memory (LSTM) neural network architecture to approximate the policy. Then, a sampling technique with a temperature hyperparameter is applied for the inference process. The results show that our proposed solution can learn the optimal function split decision and solve the problem with a 0.4% optimality gap. Moreover, our method can reduce the cost by up to 320% compared to a distributed-RAN (D-RAN). We also conclude that altering the traffic load and routing cost does not significantly degrade the optimality performance.
Packet-switched xHaul networks based on Ethernet technology are considered a promising solution for assuring convergent, cost-effective transport of diverse radio data traffic flows in dense 5G radio access networks (RANs). A challenging optimization problem in such networks is the placement of distributed processing units (DUs), which realize a subset of virtualized baseband processing functions on general-purpose processors at selected processing pool (PP) facilities. The DU placement involves the problem of routing of related fronthaul and midhaul data flows between network nodes. In this work, we focus on developing optimization methods for joint placement of DUs and routing of flows with the goal to minimize the overall cost of PPs activation and processing in the network, which we refer to as the PPC-DUP-FR problem. We account for limited processing and transmission resources as well as for stringent latency requirements of data flows in 5G RAN. The latency constraint makes the problem particularly difficult in a packet-switched xHaul network since it involves the non-linear and dynamic estimation of the latencies caused by buffering of packets in the switches. The latency model that we apply in this work is based on worst-case calculations with improved latency estimations that skip from processing the co-routed, but non-affecting flows. We use a mixed-integer programming (MIP) approach to formulate and solve the PPC-DUP-FR optimization problem. Moreover, we develop a heuristic method that provides optimized solutions to larger PPC-DUP-FR problem instances, which are too complex for the MIP method. Numerical experiments performed in different network scenarios indicate on the effectiveness of the heuristic in solving the PPC-DUP-FR problem. In particular, the heuristic achieves up to 63% better results than MIP (at the MIP optimality gap equal to 76%) in a medium-size mesh network, in which the MIP problem is unsolvable for higher traffic demands within reasonable runtime limits. In larger networks, MIP is able to provide some results only for the PPC-DUP-FR problem instances with very low traffic demands, whereas the solutions generated by the heuristic are at least 83% better than the ones achieved with MIP. Also, the analysis performed shows a significant impact of the PP cost factors considered and of the level of cost differentiation of PP nodes on the overall PP cost in the network. Finally, simulation results of a case-study packet xHaul network confirm the correctness of the latency model used.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.