.png){kind=icon}
.png){kind=icon}
Return
Time-Efficient Task Offloading and Decentralized Collaborative Scheduling Method for Cross-Domain Computing Power Networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.comnet.2026.112294.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The combination of task offloading and resource scheduling of computing power networks forms a distributed computing paradigm. Meanwhile, the integration of computing power networks with the C2F (Customer-to-Factory) model and task offloading technology is reshaping the relationship between consumption and production. However, most current studies on task offloading are based on centralized cloud/edge networks and are not applicable to large-scale distributed cross-domain computing power networks. Therefore, this paper studied task offloading based on cross-domain computing power networks, thereby reducing the scheduling time of the algorithm. Thereby, this work proposed the decentralized collaborative task offloading algorithm based on fast layering (DCTO-FL). Through a fast layering strategy, each domain obtains a layered set of backup domains, and then collaborative task offloading is carried out. When the user’s domain cannot meet the resource or delay requirements of the task, the management node of the user’s domain will publish the task to the management nodes of the backup domains, thereby achieving rapid cross-domain collaborative deployment. Finally, we verified that the DCTO-FL algorithm is advantageous, which task offloading cost is at most 10% lower, running time is at most 95% lower, and task delay with running time is at most 90% than the baseline.
Keywords:
task offloading
decentralized collaboration
cross-domain computing
resource scheduling
fast layering
Journal
IF:
4.6
Papers:
1.5K
Citations:
1.6W
View more organizations