Optimizing resources allocation in a heterogeneous cloud radio access network using machine learning

Abstract

In this article, we propose an iterative algorithm based on lazy learning. The proposed scheme considers two consecutive algorithms for optimal resource allocation in heterogeneous cloud radio access networks (H-CRAN). In the conventional approach, resources allocation is usually presented as a mathematical optimization problem and solved online using a real-time scenario. Due to the non-convex nature of resource allocation problems, finding optimal solutions in real-time is a difficult challenge and has high computational complexity. To overcome these challenges in this paper, the problem is first formulated as a mixed-integer nonlinear programming (MINLP) to optimize the system capacity and assign the underlay users to the subchannels, which is NP-hard. To obtain the solution, in the first algorithm, the proposed problem is first reformulated as a convex problem using a matching theory and coalition formation method. Then, in the second algorithm, the lazy learning method is employed to find the optimal solution to the resources allocation problem. The lazy algorithm uses the output results of the first algorithm as training data, which are known as historical data. Similarities between current scenario data and historical scenario data, as well as the solution of resources allocation in historical scenarios, can be exploited to improve the resource allocation of the current scenario. Simulation results confirm that compared with the conventional approach, the suggested technique can significantly improve the system performance in terms of the total users assigned, overall throughput, the pace of resource allocation, and user fairness.

Hybrid Pelican and Archimedes optimization algorithm fostered energy aware task scheduling in heterogeneous virtualized cloud computing

“…The amount of energy used by a VM is calculated by multiplying the energy consumption with the left skewed analysis. Thus it is expressed as Equation (17).…”

“…14 Numerous task scheduling algorithms for CC have presented in the literature to decrease the energy consume. [15][16][17] Most of the researchers suggest approaches for allocating a task to a suitable virtual machine (VM) without taking into account the currently running tasks in that VM. 18,19 The energy-aware scheduling 20 deems various processing tasks.…”

Two‐timescale optimization approach for coordinated multi‐point design in unmanned aerial vehicle‐assisted cellular networks

“…A certain number of BBUs are grouped into a centralized BBU pool where there are high bandwidth fronthaul links between the BBU pool and RRHs that can increase the range of cooperation. 21 The baseband resources in the BBU pool can handle the clustering decisions for the connected RRHs.…”

“…C‐RAN, 20 in which the baseband processing unit (BBU) is decoupled from the remote radio head (RRH) are a promising architecture for facilitating information sharing between transmission points in the presence of strong co‐channel interference. A certain number of BBUs are grouped into a centralized BBU pool where there are high bandwidth fronthaul links between the BBU pool and RRHs that can increase the range of cooperation 21 . The baseband resources in the BBU pool can handle the clustering decisions for the connected RRHs.…”

Decentralized Optimization for Multicast Adaptive Video Streaming in Edge Cache-Assisted Networks

“…On one hand, adaptive streaming refers to dynamical selection of the video bitrate in order to both optimize user quality-of-experience (QoE) and maximize the utilization of bandwidth resources while avoiding network congestion [2], [13], [14]. Adaptive streaming schemes require to frequently rearrange the bitrate selection policy to adapt the randomness of the wireless communications, user preferences, etc.…”