Task Scheduling of Joint Node Selection and Path Planning in Computing Power Network

Resource Scheduling and Optimization Algorithm of Communication Network for Edge Computing

Traditional resource scheduling strategies fail to fully utilize the computing and storage resources of edge nodes, leading to resource waste and overload of some nodes. This paper collects network topology and edge node resource information data for preprocessing. Then, a state space and action space are defined to record all possible system states and scheduling decisions in the edge computing environment. A two-layer deep Q-network model is constructed for action selection and Q-value calculation. Using 10-fold cross-validation and averaging, the optimized resource utilization reaches 85.18%, communication latency is $\mathbf{7 9. 1 m s}$, load balancing is improved to 0.841, and energy consumption and rejection rate are reduced to varying degrees, fully demonstrating the advantages of this algorithm in optimizing communication network resource scheduling in edge computing environments.

DNN task computation offloading and resource allocation optimization strategy based on probabilistic early exit

Queue‐Aware Learning‐Based Online Path and Workload Optimization for In‐Network Computing

Recently, in‐network computing has been proposed as a new paradigm to integrate computation and communication at the network edge, enabling data to be processed while being transmitted toward its destination. To achieve this, the problem of joint optimization of computation path selection and workload allocation has gained extensive research interest, and many efficient algorithms have been proposed. However, existing studies assume fixed or static latency when selecting computation paths, and thus fail to capture the time‐varying and queueing‐induced latency experienced by tasks arriving dynamically in online environments. To address the above limitations, this paper investigates the online scheduling problem of time‐dependent path selection and workload allocation for in‐network computing. We formulate the problem as a mixed‐integer programming model that jointly minimizes server operating cost and end‐to‐end latency, and prove that it is NP‐hard. To enable efficient online decision‐making, we further transform the problem into a Markov decision process. Based on this formulation, we propose a reinforcement learning–based scheduling algorithm using proximal policy optimization (PPO), which incorporates an LSTM‐based temporal encoder to capture historical deployment information and dynamically evolving network states. This design allows the algorithm to make adaptive, queueing‐aware scheduling decisions in dynamic network environments. Extensive simulations on real networks demonstrate that the proposed algorithm is robust and outperforms state‐of‐the‐art baseline methods in terms of the joint cost–latency performance metric.

MULTI-AGENT REINFORCEMENT LEARNING FOR TASK OFFLOADING AND RESOURCE ALLOCATION IN MEC SYSTEMS

This paper addresses the joint task offloading and resource allocation problem in multi-user MEC systems and proposes a decentralized control framework based on Multi-Agent Reinforcement Learning (MARL), which achieves lower total system cost and faster convergence than the full-local, full-offload, and heuristic baselines.

Intelligent Cooperative Computation Offloading and Resource Allocation for Dual-Dependency Tasks in Edge Computing

Mobile edge computing (MEC) has accelerated the development of artificial intelligence and Internet of Things technologies, leading to the explosive growth of intelligent applications characterized by resource intensity and latency sensitivity, such as image processing and smart home. In practice, an application typically consists of multiple tasks with execution dependencies, where the output of some tasks serves as the input for specific others. Recently, the design of computation offloading methods for such execution-dependent tasks has received extensive research. However, computation offloading for execution-dependent tasks with service dependencies in resource-constrained multi-user, multi-edge-server cooperative MEC systems has not been thoroughly studied. In this paper, we formulate a cooperative computation offloading problem for dual-dependency tasks in multi-edge-server scenarios with limited service and computing resources, aiming to minimize the long-term average service delay for multiple users. To solve this problem, we propose a recurrent multi-agent reinforcement learning-based dual-dependency task offloading (RMA-DepO) algorithm, which enables users to communicate during training to explore and learn optimal joint task offloading and computing resource allocation strategies, and to make distributed offloading decisions at execution time. Simulation results demonstrate that the proposed RMA-DepO algorithm outperforms several baselines under different network settings, demonstrating its effectiveness in coordinating edge resources for cooperative computation of dual-dependency tasks.

Cooperative Task Offloading in Mobile Edge Computing via an Improved MASAC Framework

: Mobile edge computing (MEC) is an effective paradigm for supporting latency-sensitive and computation-intensive intelligent applications. However, in dynamic mobile-edge network scenarios, mobile terminals experience time-varying wireless links due to mobility. Tasks may also arrive unpredictably, while multiple terminals compete for limited edge resources. As a result, MEC systems may suffer from service congestion and unbalanced resource utilization, which increases end-to-end latency and energy consumption. This paper investigates cooperative task offloading in dynamic MEC networks. The considered system comprises one macro base station and multiple small base stations equipped with edge-computing resources. In each time slot, each mobile terminal selects a service option, determines the task offloading ratio, and chooses its transmit power for task uploading. This sequential decision process is formulated as a multi-agent problem with continuous action spaces. Under the centralized training and decentralized execution (CTDE) framework, the problem is further modeled as a decentralized partially observable Markov decision process (Dec-POMDP). Standard multi-agent soft actor-critic (MASAC) is not fully suitable for this problem. Its original action model does not handle bounded continuous actions well. Its exploration strength may also be unsuitable at different training stages. Frequent policy updates can further make training unstable when critic estimates are inaccurate. To address these issues, this paper develops an adaptive Beta-policy and delayed-update multi-agent soft actor-critic method, abbreviated as ABDMASAC. This method uses a Beta policy to model bounded actions. It adjusts the entropy coefficient during training and delays policy updates to reduce training oscillations. Experimental results show that, under a unified training budget and a consistent evaluation protocol, the proposed method achieves a better overall trade-off than the selected MASAC-backbone and on-policy MARL baselines under the considered simulation settings in terms of overall reward, average end-to-end latency, and average energy consumption. In the large-scale scenario, compared with MASAC, it improves the overall reward by 17.8%, reduces the average end-to-end latency by 18.0%, and lowers the average energy consumption by 11.4%.