
Editorial
A Trusted Edge Scheduling Method for Computing Power Network Based on Deep Reinforcement Learning
@ARTICLE{10.4108/eetsis.13053, author={Yong Yan and Ronghao Liu and Xu Liu and Ao Xiong and Zuhao Wang}, title={A Trusted Edge Scheduling Method for Computing Power Network Based on Deep Reinforcement Learning}, journal={EAI Endorsed Transactions on Scalable Information Systems}, volume={13}, number={7}, publisher={EAI}, journal_a={SIS}, year={2026}, month={11}, keywords={deep reinforcement learning, graph neural network, blockchain, smart contract, reverse proxy}, doi={10.4108/eetsis.13053} }- Yong Yan
Ronghao Liu
Xu Liu
Ao Xiong
Zuhao Wang
Year: 2026
A Trusted Edge Scheduling Method for Computing Power Network Based on Deep Reinforcement Learning
SIS
EAI
DOI: 10.4108/eetsis.13053
Abstract
In multi-party collaborative scenarios where computing power networks and edge intelligence work in synergy, trusted edge scheduling methods optimize resource allocation through intelligent scheduling, ensuring that computing tasks of each participant are executed on independent edge nodes, thus effectively improving computing efficiency and resource utilization. However, distributed edge nodes and their supporting communication networks usually require independent deployment and operation and maintenance, making efficient scheduling a critical challenge. This paper proposes a trusted edge scheduling method based on deep reinforcement learning, which realizes privacy protection through smart contract technology. Computing and network resources are stored on the blockchain, scheduling is performed using the Edge Routing Model (ERM) in smart contracts, and the hash values of scheduling results are recorded on the blockchain. ERM aims to meet users’ computing demands while selecting the optimal routing strategy to maximize network bandwidth utilization. The method adopts deep reinforcement learning with a prioritized sampling mechanism to constrain the action space, and combines graph neural networks to learn features of network topology, thereby enhancing the generalization ability. Experimental results show that, compared with traditional scheduling models, ERM can schedule edge resources more efficiently under both homogeneous and heterogeneous topologies and exhibits favorable scalability.
Copyright © 2026 Yong Yan et al., licensed to EAI. This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.

