.png){kind=icon}
Return
Deterministic Delay-Aware Task Scheduling Over In-Network Computing: A Graph Embedding-Based DRL Approach
.png){kind=icon}
PRE
AI
DOI：10.1109/TNSM.2026.3676106.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As the in-network computing (INC) paradigm evolves, efficient scheduling of dependent tasks within complex network systems becomes increasingly crucial. The network needs to handle high-level resource demands while adhering to strict latency requirements. Deterministic delay constraints are particularly critical in applications that rely on directed acyclic graphs (DAGs). To address this challenge, we first propose a deterministic delay-aware task scheduling optimization problem over INC to maximize resource utilization and ensure task acceptance. We accurately establish the complex deterministic delay constraint through traffic arrival and service curves and utilize network calculus for conversion to facilitate solving. Then, we further transform the task optimization problem into MDP and develop a deep reinforcement learning (DRL) algorithm that combines graph neural network (GNN) and delay-aware proximal policy optimization (DPPO) to solve it, called the Deterministic Delay-aware Task Scheduling (DDTS) scheme. It utilizes multilayer GNN to handle task dependencies and applies the DPPO algorithm to introduce deterministic delay penalty factors to evaluate policy operations, achieving optimal task scheduling. The simulation results demonstrate the significant advantages of the DDTS scheme over existing algorithms and task scheduling schemes in terms of task acceptance rate and resource utilization.
Keywords:
Task scheduling
network calculus
deterministic latency
DRL
Journal
IF:
5.4
Papers:
637
Citations:
9.2K
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveDynamic Job-Shop Scheduling Problems Using Graph Neural Network and Deep Reinforcement Learning
PREAI
ShareSave
View more