A DRL‐Based Algorithm for DNN Partition, Subtask Offloading and Resource Allocation in Multi‐Hop Computing Nodes with Cloud

• DOI: 10.1049/cmu2.70048
• Publication Date: 2025-05-21T05:59:42Z
• Authors: Ruiyu Yang; Zhili Wang; Yang Yang; Sining Wang

ABSTRACTNowadays, deep neural network (DNN) partition is an effective strategy to accelerate deep learning (DL) tasks. A pioneering technology, computing and network convergence (CNC), integrates dispersed computing resources and bandwidth via the network control plane to utilize them efficiently. This paper presents a novel network‐cloud (NC) architecture designed for DL task inference in CNC scenario, where network devices directly participate in computation, thereby reducing extra transmission costs. Considering multi‐hop computing‐capable network nodes and one cloud node in a chain path, leveraging deep reinforcement learning (DRL), we develop a joint‐optimization algorithm for DNN partition, subtask offloading and computing resource allocation based on deep Q network (DQN), referred to as POADQ, which invokes a subtask offloading and computing resource allocation (SORA) algorithm with low complexity, to minimize delay. DQN searches the optimal DNN partition point, and SORA identifies the next optimal offloading node for next subtask through our proposed NONPRA (next optimal node prediction with resource allocation) method, which selects the node that exhibits the smallest predicted increase in cost. We conduct some experiments and compare POADQ with other schemes. The results show that our proposed algorithm is superior to other algorithms in reducing the average delay of subtasks.