In this work, we propose a distributed task-offloading framework based on deep reinforcement learning (DRL) and graph neural networks (GNNs). Each edge node hosts an agent that autonomously decides whether to execute incoming tasks locally or forward them to neighboring nodes using local and two-hop network information. The problem is formulated as a Markov decision process, and a tailored reward function is designed to encourage deadline-compliant execution while reducing CPU usage and energy consumption. The agent is trained with Proximal Policy Optimization (PPO) over realistic MEC topologies and diverse task-generation patterns. Simulation results show that the proposed approach outperforms shortest-path-based greedy baselines in the most demanding scenarios while achieving comparable performance elsewhere.
A deep reinforcement learning agent for distributed task offloading based on Graph Neural Networks / M. Dileo, C.Q. - In: PerCom Workshops[s.l] : Institute of Electrical and Electronics Engineers (IEEE), 2026 Mar. - ISBN 979-8-3315-7615-8. - pp. 1-6 (( International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events. SAYGreeN Workshop : March, 16th - 20th Pisa 2026 [10.1109/percomworkshops68308.2026.11585333].
A deep reinforcement learning agent for distributed task offloading based on Graph Neural Networks
M. DileoPrimo
;C. Quadri
Ultimo
2026
Abstract
In this work, we propose a distributed task-offloading framework based on deep reinforcement learning (DRL) and graph neural networks (GNNs). Each edge node hosts an agent that autonomously decides whether to execute incoming tasks locally or forward them to neighboring nodes using local and two-hop network information. The problem is formulated as a Markov decision process, and a tailored reward function is designed to encourage deadline-compliant execution while reducing CPU usage and energy consumption. The agent is trained with Proximal Policy Optimization (PPO) over realistic MEC topologies and diverse task-generation patterns. Simulation results show that the proposed approach outperforms shortest-path-based greedy baselines in the most demanding scenarios while achieving comparable performance elsewhere.| File | Dimensione | Formato | |
|---|---|---|---|
|
2026_SAYGreeN_Workshop_PERCOM.pdf
embargo fino al 20/03/2028
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Licenza:
Publisher
Dimensione
448.3 kB
Formato
Adobe PDF
|
448.3 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
A_deep_reinforcement_learning_agent_for_distributed_task_offloading_based_on_Graph_Neural_Networks.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Licenza:
Nessuna licenza
Dimensione
1.35 MB
Formato
Adobe PDF
|
1.35 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.




