TL;DR
A distributed Multi-stage Adaptive Deferred Acceptance (MA-DA) algorithm is proposed that enables a stable and Pareto-optimal assignment of tasks to edge computing nodes (ECNs) and determines a reasonable task execution sequence and ensures the prioritized completion of delay-sensitive tasks.
This work aims to design an efficient framework by incorporating a novel hybrid metaheuristic algorithm that combines Draco Lizard Optimization (DLO) and Sand Cat Optimization (SCO) for optimal task offloading and resource allocation for IoT applications.
: Cloud Computing (CC) is one of the widely used technologies due to its advanced features such as pay-per-use, scalability, and flexibility. The primary objective of CC is to allow users to access and purchase cloud services that are on demand through internet-based applications. Efficient load-balancing in the cloud faces challenges of high-dimensional state spaces and scalability with increasing tasks. To solve this problem, the Masterpiece Optimization Algorithm (MOA) with a priority constraint is employed for load-balancing according to the tasks efficiently. The MOA is integrated with a priority-based cost function to enhance the task scheduling process by introducing a multi-dimensional approach for load balancing. The priority-based framework helps the scheduler to dynamically recalibrate workloads. The experimental results achieve a total energy consumption of 39.8 W and an average CPU resource utilization of 99.54%, which is better than the existing algorithms, such as the hybrid Particle Swarm Grey Wolf Optimization (PSGWO) algorithm.
Experiments show that the proposed Hybrid Framework for Joint Optimization of Resource Allocation and Load Balancing that spans two layers in heterogeneous cloud computing systems obtains 25-30% energy savings compared with ordinary methods, significantly reduces p95 latency and also achieves a relatively better Quality Of Service.
The rapid advancement of edge computing has transformed the distributed computing paradigm. Edge computing enables storage and computation to perform at the network edge. For optimized performance, offloading has a crucial role that enhances the system efficacy by improving the quality of service (QoS) parameters. Therefore, this work proposes an Artificial Rabbit Optimization (ARO)-based framework for efficient task offloading-based allocation of resources in edge computing environments. The proposed technique improves the performance of Internet of Things (IoT) applications by using an intelligent task execution strategy that diminishes energy consumption, delay, and cost. A multi-objective function is framed that considers the above performance metrics and optimizes performance subject to delay and power constraints. The experimental results demonstrate that the proposed framework outperforms the benchmark approaches, reducing delay by up to 44.06%, energy consumption by up to $\mathbf{3 8. 9 6 \%}$, and cost by up to $\mathbf{2 8. 4 8} \boldsymbol{\%}$.
An adaptive Beta-policy and delayed-update multi-agent soft actor-critic method, abbreviated as ABDMASAC, which uses a Beta policy to model bounded actions and achieves a better overall trade-off than the selected MASAC-backbone and on-policy MARL baselines under the considered simulation settings.
Dynamic edge networks suffer from fluctuating bandwidth, latency, and edge-node load, which weaken conventional task offloading strategies under deadline and energy constraints. This study proposes an adaptive task offloading strategy based on dynamic network states. An online broad learning system predicts short-term bandwidth, transmission delay, and load from sliding-window observations. The predictions are embedded into a model predictive control framework for rolling optimization of the local-edge task allocation ratio, while confidence-interval-guided compensation adjusts decisions under prediction uncertainty. ADMM is used for distributed solution. NS-3/Python simulations show that the proposed method achieves a $93\%$ task success rate, 1.22 W average terminal energy consumption, 3.2 switches/s, and 45 ms average completion time, outperforming local execution, reactive offloading, and DQN-based offloading. The proposed strategy improves real-time reliability, energy efficiency, and robustness in highly dynamic edge computing environments.