Computing Resource Allocation Research Articles

Collaborative Computation Offloading and Resource Management in Space–Air–Ground Integrated Networking: A Deep Reinforcement Learning Approach

With the increasing dissemination of the Internet of Things and 5G, mobile edge computing has become a novel scheme to assist terminal devices in executing computation tasks. To elevate the coverage and computation capability of edge computing, a collaborative computation offloading and resource management architecture was proposed in space–air–ground integrated networking (SAGIN). In this manuscript, we established a novel model considering the computation offloading cost constraints of the communication, computing and cache model in the SAGIN. To be specific, the joint optimization problem of collaborative computation offloading and resource management was modeled as a mixed integer nonlinear programming problem. To address this issue, this paper proposed a computation offloading and resource allocation strategy based on deep reinforcement learning (DRL). Differing from traditional methods, DRL does not need a well-established formulation or previous information, and it is capable of revising the strategy adaptively according to the environment. The simulation results demonstrate the proposed approach can achieve the optimal reward values in the case of different terminal device numbers. Furthermore, this manuscript provided the analysis with variant parameters of the proposed approach.

Blockchain-based 6G task offloading and cooperative computing resource allocation study

In the upcoming era of 6G, the accelerated development of the Internet of Everything and high-speed communication is poised to provide people with an efficient and intelligent life experience. However, the exponential growth in data traffic is expected to pose substantial task processing challenges. Relying solely on the computational resources of individual devices may struggle to meet the demand for low latency. Additionally, the lack of trust between different devices poses a limitation to the development of 6G networks. In response to this issue, this study proposes a blockchain-based 6G task offloading and collaborative computational resource allocation (CERMTOB) algorithm. The proposed first designs a blockchain-based 6G cloud-network-edge collaborative task offloading model. It incorporates a blockchain network on the edge layer to improve trust between terminals and blockchain nodes. Subsequently, the optimization objective is established to minimize the total latency of offloading, computation, and blockchain consensus. The optimal offloading scheme is determined using the wolf fish collaborative search algorithm(WF-CSA) to minimize the total delay. Simulation results show that the WF-CSA algorithm significantly reduces the total delay by up to 42.58% compared to the fish swarm algorithm, wolf pack algorithm and binary particle swarm optimisation algorithm. Furthermore, the introduction of blockchain to the cloud-side-end offloading system improves the communication success rate by a maximum of 14.93% compared to the blockchain-free system.

Multi-agent reinforcement learning based computation offloading and resource allocation for LEO Satellite edge computing networks

Due to the limitations caused by geographical conditions and economic requirements, it is difficult to provide computing services by terrestrial networks for mobile terminals in remote areas. To address this issue, mobile edge computing (MEC) servers can be deployed in the low earth orbit (LEO) satellites to act as a complement and accommodate the unserved terminals. However, offloading computing tasks to servers in satellites may increase the energy consumption of ground terminals. Considering the limited battery capacity of ground terminals, how to perform the computation offloading and resource allocation are key challenges in the LEO satellite edge computing networks. Therefore, in this paper, we investigate the energy minimization problem for LEO satellite edge computing networks, where a multi-agent deep reinforcement learning algorithm with global rewards is proposed to optimize the transmit power, CPU frequency, bit allocation, offloading decision and bandwidth allocation via a decentralized method. Simulation results show that our proposed algorithm can converge faster. Most importantly, compared with the random algorithm, the proximal policy optimization (PPO) algorithm, and the deep deterministic policy gradient (DDPG) algorithm, the ground terminals’ energy consumption can be effectively reduced by our proposed algorithm.

Joint Offloading and Resource Allocation for Hybrid Cloud and Edge Computing in SAGINs: A Decision Assisted Hybrid Action Space Deep Reinforcement Learning Approach

Joint Offloading and Resource Allocation for Hybrid Cloud and Edge Computing in SAGINs: A Decision Assisted Hybrid Action Space Deep Reinforcement Learning Approach

Online dynamic multi-user computation offloading and resource allocation for HAP-assisted MEC: an energy efficient approach

Nowadays, the paradigm of mobile computing is evolving from a centralized cloud model towards Mobile Edge Computing (MEC). In regions without ground communication infrastructure, incorporating aerial edge computing nodes into network emerges as an efficient approach to deliver Artificial Intelligence (AI) services to Ground Devices (GDs). The computation offloading and resource allocation problem within a HAP-assisted MEC system is investigated in this paper. Our goal is to minimize the energy consumption. Considering the randomness and dynamism of the task arrival of GDs and the quality of wireless communication, stochastic optimization techniques are utilized to transform the long-term dynamic optimization problem into a deterministic optimization problem. Subsequently, the problem is further decomposed into three sub-problems which can be solved in parallel. An online Energy Efficient Dynamic Offloading (EEDO) algorithm is proposed to address these problems. Then, we conduct the theoretical performance analysis for EEDO. Finally, we carry out parameter analysis and comparative experiments, demonstrating that the EEDO algorithm can effectively reduce system energy consumption while maintaining the stability of the system.

Achieving Agility through Auto-Scaling: Strategies for Dynamic Resource Allocation in Cloud Computing

Abstract: Auto-scaling is a crucial aspect of cloud computing, allowing for the efficient allocation of computational resources in response to immediate demand. This article delves into the concept of auto-scaling, its key components, and the strategies used to effectively manage resources in cloud environments. This study emphasizes the importance of auto-scaling in the cloud computing landscape by exploring its benefits, including cost efficiency, performance optimization, high availability, and scalability [1]. The article explores the various factors to consider when implementing scaling policies, such as selecting the right approach for scaling, whether it be predictive or reactive and the availability of auto-scaling services provided by major cloud platforms like Amazon Web Services (AWS), Google Cloud Platform (GCP), and Microsoft Azure [2, 3]. In addition, the paper addresses the challenges and complexities related to configuring auto-scaling systems, cost management, and latency in resource provisioning [4]. The article also showcases case studies that illustrate the successful implementation of auto-scaling in different industries, along with valuable insights and recommended approaches [5]. Lastly, this paper delves into future trends and research directions in auto-scaling techniques, integration with emerging technologies, and potential research areas [6].

Key Challenges of Cloud Computing Resource Allocation in Small and Medium Enterprises

Although cloud computing offers many benefits, such as flexibility, scalability, and profitability, some small and medium enterprises (SMEs) are still unable to fully utilize cloud resources, such as memory, computing power, storage, and network bandwidth. This reduces their productivity and increases their expenses. Therefore, the central objective of this paper was to examine the key challenges related to the allocation of cloud computing resources in small and medium enterprises. The method used for this study is based upon qualitative research using 12 interviews with 12 owners, managers, and experts in cloud computing in four countries: the United States of America, the United Kingdom, India, and Pakistan. Our results, based on our empirical data, show 11 key barriers to resource allocation in cloud computing that are classified based on the technology, organization, and environment (TOE) framework. Theoretically, this research contributes to the body of knowledge concerning cloud computing technology and offers valuable understanding of the cloud computing resource allocation approaches employed by small and medium enterprises (SMEs). In practice, this research is useful to aid SMEs in implementing successful and sustainable strategies for allocating cloud computing resources.

A cloud-edge collaborative computing framework using potential games for space-air-ground integrated IoT

As a critical component of space-air-ground integrated IoT, the aerial network provides highly reliable, low-latency and ubiquitous information services to ground users by virtue of their high mobility, easy deployment and low cost. However, the current computation and resource management model of air-ground integrated networks are insufficient to meet the latency demanding of emerging intelligent services such as autonomous systems, extended reality and haptic feedback. To tackle these challenges, we propose a computation offloading and optimization method based on potential game. First, we construct an cloud-edge collaborative computing model. Secondly, we construct Offloading Decision Objective Functions (ODOF) with the objective of minimum task processing latency and energy consumption. ODOF is proved to be a Mixed Inferior Nonlinear Programming (MINLP) problem, which is hard to solve. ODOF is converted to be a full potential game, and the Nash equilibrium solution exists. Then, a computational resource allocation algorithm based on Karush–Kuhn–Tucker (KKT) conditions is proposed to solve resource allocation problem. On this basis, a distributed game-based computational offloading algorithm is proposed to minimize the offloading cost. Extensive simulation results demonstrate that the convergence performance of the proposed algorithm is reduced by 50%, the convergence time is reduced by 13.3% and the average task processing delay is reduced by 10%.

Robust Offloading for Edge Computing-Assisted Sensing and Communication Systems: A Deep Reinforcement Learning Approach.

In this paper, we consider an integrated sensing, communication, and computation (ISCC) system to alleviate the spectrum congestion and computation burden problem. Specifically, while serving communication users, a base station (BS) actively engages in sensing targets and collaborates seamlessly with the edge server to concurrently process the acquired sensing data for efficient target recognition. A significant challenge in edge computing systems arises from the inherent uncertainty in computations, mainly stemming from the unpredictable complexity of tasks. With this consideration, we address the computation uncertainty by formulating a robust communication and computing resource allocation problem in ISCC systems. The primary goal of the system is to minimize total energy consumption while adhering to perception and delay constraints. This is achieved through the optimization of transmit beamforming, offloading ratio, and computing resource allocation, effectively managing the trade-offs between local execution and edge computing. To overcome this challenge, we employ a Markov decision process (MDP) in conjunction with the proximal policy optimization (PPO) algorithm, establishing an adaptive learning strategy. The proposed algorithm stands out for its rapid training speed, ensuring compliance with latency requirements for perception and computation in applications. Simulation results highlight its robustness and effectiveness within ISCC systems compared to baseline approaches.

Joint optimization for computation offloading and 3C resource allocations over wireless-powered and NOMA-enabled multi-access MEC

Multi-access mobile edge computing (MEC) enables mobile users (MUs) to offload tasks to proximal multiple MEC servers for fast task processing. Since MUs generally have stringent delay requirements and limited energy and MEC servers have finite communication, computation, and caching (3C) resources, the joint co-design and optimization over computation offloading and 3C resource allocation for wireless-powered multi-access MEC systems have been highly demanded, while having not been well studied yet. We consider a wireless-powered multi-access MEC, where multiple energy harvesting (EH) based MUs and multiple base stations (BSs) each equipped with an MEC server coexist. Each MU first harvests energy from nearby MEC servers, and then offloads its sub-tasks to multiple MEC servers concurrently based on non-orthogonal multiple access (NOMA), so as to reduce data offloading delay. We first formulate a delay minimization problem, by jointly optimizing MUs’ computation offloading, MEC servers’ computation and caching resources allocation, and system communication resources allocation. Then we propose an alternating direction multiplier method (ADMM) based distributed scheme to decompose the formulated optimization problem into several sub-problems, and use the block coordinate descending (BCD) method and the successive convex approximation (SCA) method to transform all sub-problems each corresponding to one MEC server to convex subproblems. Finally, we validate and evaluate our proposed scheme through numerical analyses, which show that our proposed distributed scheme can greatly reduce the min–max delay of all MUs by allowing each MU’s concurrent data offloading to multiple MEC servers using NOMA and by jointly optimizing computation offloading and 3C resource allocations. Also, the delay imposed by our proposed scheme is much smaller than that imposed by the Interior Point method, which shows the effectiveness of our proposed scheme.

DCGFuzz: An Embedded Firmware Security Analysis Method with Dynamically Co-Directional Guidance Fuzzing

Microcontroller Units (MCUs) play a vital role in embedded devices due to their energy efficiency and scalability. The firmware in MCUs contains vulnerabilities that can lead to digital and physical harm. However, testing MCU firmware faces challenges due to various tool limitations and unavailable firmware details. To address this problem, research is turning to fuzzing and rehosting. Due to the inherent imbalance in computational resources of the fuzzing algorithm and the lack of consideration for the computational resource requirements of rehosting methods, some hardware behavior-related paths are difficult to discover. In this work, we propose a novel Dynamically Co-directional Guidance Fuzzing (DCGFuzz) method to improve security analysis efficiency. Our method dynamically correlates computational resource allocation in both fuzzing and rehosting, computing a unified power schedule score. Using the power schedule score, we adjust test frequencies for various paths, boosting testing efficiency and aiding in the detection of hardware-related paths. We evaluated our approach on nine real-world pieces of firmware. Compared to the previous approach, we achieved a maximum increase of 47.9% in path coverage and an enhancement of 27.6% in effective model coverage during the fuzzing process within 24 h.

Decentralized computation offloading via multi-agent deep reinforcement learning for NOMA-assisted mobile edge computing with energy harvesting devices

Supporting latency-sensitive and computation-intensive applications is hardly possible for mobile devices (MDs) with limited battery capacity and low computing resources. Therefore, mobile edge computing (MEC) and wireless power transfer (WPT) have emerged as promising technologies that allow MDs to offload part or all of their workloads to MEC servers and harvest energy for prolonging their battery lifetime. However, the MEC server’s limited computing resources, available communication channel quality, and time-limited energy harvesting (EH) challenge the computation offloading. In this paper, we study the joint problem of decentralized computation offloading and resource allocation (JDCORA) in the environment of non-orthogonal multiple access (NOMA)-assisted MEC with multiple EH-enabled MDs. To learn decentralized offloading policies, we propose a multi-agent deep reinforcement learning (MADRL)-based scheme towards minimizing energy consumption and task completion time, which considers the cooperation between MDs to adjust their strategies. In particular, we improve the multi-agent deep deterministic policy gradient (MADDPG) by applying the features of double actors, double centralized critics, soft value estimation, critic regularization and proportional-based prioritized experience replay (pPER) and propose an algorithm called multi-agent twin actors regularized critics (MATARC). Simulation results demonstrate that the proposed MATARC has a better convergence performance compared to other baseline methods and also reduces the average energy consumption, task completion time and task drop rate.

Optimizing Data Centre Energy Efficiency with Dynamic Resource Allocation and Intelligent Cooling Management through Machine Learning

Our research aims to improve energy efficiency in data centres by combining cloud computing infrastructure with machine learning techniques. We propose that dynamic resource assignment, combined with intelligent optimisation of cooling systems, can reduce power waste and operational costs. Real-time sensor data from various data centre components such as servers, cooling systems, and power distribution units is collected and fed into machine learning models for analysis. In this way, we can create power arrangements that are tailored to the resources and needs of various applications. The experimental results show that energy consumption has been reduced by an average of 30% compared to traditional methods. Furthermore, our machine learning models are quite accurate in predicting cooling system performance. For example, an Artificial Neural Network (ANN) has an accuracy rate of 98.78%. This result demonstrates the efficacy of our approach in promoting energy efficiency and operational performance in data centres: it not only provides a scalable, cost-effective solution to industry energy efficiency challenges, but it also improves day-to-day data centre operations by reducing electrical consumption. Our approach, which is based on dynamic allocation of computational resources and real-time data analysis for optimising cooling systems, not only saves energy but also improves operational efficiency. With energy in mind, we must all work towards a more sustainable and green approach to data centre management. Future research can look into other potential optimisations, as well as issues with scalability and application in real-world data centre environments.

Energy-Efficient 5G Heterogeneous Cloud Radio Access Networks (RRH to BBU) Using a Hybrid OGASCDASA-SAGMDEBROA Scheduling Algorithm

In fifth-generation (5G) networks, the deployment of heterogeneous networks (HetNets) with macrocells layered over tiny cells is considered to be a practical solution to handle the growing demand for mobile traffic. Even though the deployment of a significant count of small cell base stations (BSs) results in a notable rise in energy consumption. In this manuscript, Energy-Efficient (EE) 5G Heterogeneous Cloud Radio Access Networks (RRH to BBU), using Hybrid online green algorithm-based sleep scheduling and cost-efficient deadline-aware Scheduling Algorithm (OGASCDASA), are proposed. Here, the energy efficiency optimization issue is in the downlink of two-tier Heterogeneous Cloud Radio Access Networks (H-CRAN) by lowering micro and pico cells. Hybrid OGASCDASA is proposed for reducing remote radio side energy use when maintaining coverage and Quality of service (QoS) of H-CRAN. At the cloud side Baseband Units (BBU), hybrid Simulated Annealing with the Gaussian Mutation and Distortion Equalization algorithm with Battle Royale optimization is proposed to reduce the energy consumption of BBU by decreasing the count of BBU servers. The proposed EE-HCRAN-Hybrid OGASCDASA-SAGMDEBROA method attains 20.48%, 27.34%, and 32.24% higher throughput and 28.30%, 17.30%, and 32.94% lower delay compared to the existing models, such as heterogeneous computational resource allocation for NOMA (HCRA-NOMA-GMECS), energy-efficient hierarchical resource sharing in uplink-downlink decoupled NOMA heterogeneous networks (EE-HRA-NOMA-HetNet), energy-aware hierarchical resource management with backhaul traffic optimization in heterogeneous cellular networks (EA-HRM-BTO-HCN), respectively.

Maximizing throughput in NOMA-enable industrial IoT networks using digital twin and reinforcement learning

IntroductionIncreased deployment of heterogeneous and complex Industrial Internet of Things (IIoT) applications such as predictive maintenance and asset tracking places a substantial strain on the limited computational and communication resources. To cater to the rigorous demands of these applications, it is imperative to devise an adaptive online resource allocation method to enhance the efficiency of the current network operations. Multiaccess edge computing (MEC) and digital twins (DTs) are promising solutions that facilitate the realization of edge intelligence and find applications in various industrial applications. Yet, little is known about the advantage the two technologies offer to IIoT networks. ObjectiveThis study presents a joint optimization of offloading and resource allocation approach where MEC-server DT is created at the edge, and nonorthogonal multiple access (NOMA) communication is considered between IIoT devices and the industrial gateways (IGWs) for spectral efficiency. Our proposed framework is tailored to reduce mean task completion latency and enhance overall IIoT network throughput. MethodTo achieve our objective, we jointly optimize the computation resource allocation (RA), subchannel assignment (SA), and offloading decisions (OD). Given the inherent complexity of the problem, we further divide it into RA and SA/OD sub-problems. Employing Deep Reinforcement Learning (DRL), we have formulated a solution delineating the most efficient RA strategy and leveraged DT for optimal SA/OD strategies. ResultsSimulation results demonstrate the superior efficiency of our framework, realizing up to 92 % of the efficiency of the exhaustive search method while reducing computation and action decision time. ConclusionIn light of system dynamics considered for our work, the proposed framework perfomance showcase its robustness and potential application in real-world IIoT networks.

Energy-Dependent, Self-Adaptive Mesh h(p)-Refinement of an Interior-Penalty Scheme for a Discontinuous Galerkin Isogeometric Analysis Spatial Discretization of the Multi-Group Neutron Diffusion Equation with Dual-Weighted Residual Error Measures

Energy-dependent self-adaptive mesh refinement algorithms are developed for a symmetric interior-penalty scheme for a discontinuous Galerkin spatial discretization of the multi-group neutron diffusion equation using NURBS-based isogeometric analysis (IGA). The spatially self-adaptive algorithms employ both mesh (h) and polynomial degree (p) refinement. The discretized system becomes increasingly ill-conditioned for increasingly large penalty parameters; and there is no gain in accuracy for over penalization. Therefore, optimized penalty parameters are rigorously calculated, for general element types, from a coercivity analysis of the bilinear form. Local mesh refinement allows for a better allocation of computational resources; and thus, more accuracy per degree of freedom. Two a posteriori interpolation-based error measures are proposed. The first heuristically minimizes local contributions to the discretization error, which becomes competitive for global quantities of interest (QoIs). However, for localized QoIs, over energy-dependent meshes, certain multi-group components may become under-resolved. The second employs duality arguments to minimize important error contributions, which consistently and reliably reduces the error in the QoI.

Multi-User Computation Offloading and Resource Allocation Algorithm in a Vehicular Edge Network.

In Vehicular Edge Computing Network (VECN) scenarios, the mobility of vehicles causes the uncertainty of channel state information, which makes it difficult to guarantee the Quality of Service (QoS) in the process of computation offloading and the resource allocation of a Vehicular Edge Computing Server (VECS). A multi-user computation offloading and resource allocation optimization model and a computation offloading and resource allocation algorithm based on the Deep Deterministic Policy Gradient (DDPG) are proposed to address this problem. Firstly, the problem is modeled as a Mixed Integer Nonlinear Programming (MINLP) problem according to the optimization objective of minimizing the total system delay. Then, in response to the large state space and the coexistence of discrete and continuous variables in the action space, a reinforcement learning algorithm based on DDPG is proposed. Finally, the proposed method is used to solve the problem and compared with the other three benchmark schemes. Compared with the baseline algorithms, the proposed scheme can effectively select the task offloading mode and reasonably allocate VECS computing resources, ensure the QoS of task execution, and have a certain stability and scalability. Simulation results show that the total completion time of the proposed scheme can be reduced by 24-29% compared with the existing state-of-the-art techniques.

Position Checking-Based Sampling Approach Combined with Attraction Point Local Optimization for Safe Flight of UAVs.

Trading off the allocation of limited computational resources between front-end path generation and back-end trajectory optimization plays a key role in improving the efficiency of unmanned aerial vehicle (UAV) motion planning. In this paper, a sampling-based kinodynamic planning method that can reduce the computational cost as well as the risks of UAV flight is proposed. Firstly, an initial trajectory connecting the start and end points without considering obstacles is generated. Then, a spherical space is constructed around the topological vertices of the environment, based on the intersections of the trajectory with the obstacles. Next, some unnecessary sampling points, as well as node rewiring, are discarded by the designed position-checking strategy to minimize the computational cost and reduce the risks of UAV flight. Finally, in order to make the planning framework adaptable to complex scenarios, the strategies for selecting different attraction points according to the environment are designed, which further ensures the safe flight of the UAV while improving the success rate of the front-end trajectory. Simulations and real-world experiment comparisons are conducted on a vision-based platform to verify the performance of the proposed method.

An expert system for hybrid edge to cloud computational offloading in heterogeneous MEC–MCC environments

Mobile Cloud Computing (MCC) integrates cloud computing into the mobile environment, effectively tackling performance, environmental, and security constraints. However, the proliferation of clouds and applications introduces complexities in offloading decisions. Mobile Edge Computing (MEC) has emerged as a solution to bolster MCC performance, capitalizing on the proximity to edge devices. However, optimizing computation offloading remains paramount for heterogeneous smart (mobile phones, wearables, and IoT) devices, necessitating efficient utilization of network resources and computational offloading. To address these challenges, this paper introduces NSANNOM (Network and Device Resources Utilization through Smart ANN-based Offloading Mechanism), an expert system designed for optimal computational offloading decision-making and efficient network resource allocation mechanisms. NSANNOM employs Artificial Neural Networks (ANN) for precise decision-making by validating real-world datasets, underscoring ANN’s superiority over existing algorithms, and showcasing enhanced energy savings, cost efficiency, and latency response. Experimental evaluations demonstrate that the proposed ANN model for the offloading decision-making algorithm achieves a training accuracy of 97% and a validation accuracy of 99%. The system consumes minimal energy (10 MJ) for task scheduling and exhibits remarkable accuracy in resource utilization across multiple tasks (10–50) ranging in size (from 1 to 16 GB). Additionally, it minimizes time delays (in milliseconds) during the offloading process.

Computation offloading in NOMA-MEC-enabled aerial-vehicular networks exploiting mmWave capabilities

In recent years, there has been a significant interest in ubiquitous coverage, high data rate connectivity, and mobile edge computing (MEC) as crucial services within the future sixth-generation (6G) wireless networks. These services are regarded as essential components, exemplifying the advancements anticipated in 6G technology. Nevertheless, the successful implementation of these services in MEC-enabled vehicular networks significantly relies on the availability of robust network coverage and telecommunication framework. Unfortunately, in far-flung and isolated regions, such framework is often lacking, posing significant challenges in achieving uninterrupted connectivity, comprehensive coverage, and efficient computation offloading. Targeting the aforementioned horizon, in this paper, an uplink non-orthogonal multiple access (NOMA)-MEC-enabled aerial-vehicular network operating at millimeter wave (mmWave) is proposed in which the ground vehicles are provided edge computing services by an aerial autonomous vehicle, i.e., a high-altitude platform (HAP). We present a system model in which a HAP equipped with MEC servers offers computation offloading capabilities to a vehicular network. Our main objective is to minimize the transaction time of a NOMA cluster offloading its data to MEC servers located at the HAP. We devise a dual-layer optimization scheme for optimizing the transmission power and computational resource allocation by using the Lagrange multipliers method and then attain convergence by implementing a sub-gradient approach. We further extend our work by proposing a data-aware NOMA clustering scheme. The simulation results demonstrate the efficacy of our proposed approach, showing a notable reduction in the transaction time in comparison to the baseline scheme. The optimal power allocation enhances the data rates which subsequently reduces the transmission time, and the optimal cores assignment effectively minimizes the computation time. Additionally, the data-aware NOMA clustering scheme shows promising results by enhancing the system effective throughput and the spectral efficiency in comparison to the conventional NOMA clustering.