Scholarlink

In urgent edge computing scenarios, where rapid decision-making is paramount, traditional centralized methods often struggle with dynamic workloads. This paper introduces a decentralized Q-learning framework for workload offloading, enabling individual edge nodes to make adaptive decisions based solely on local observations and limited neighbor communications. By incorporating a cooperative mechanism—where agents weight neighbor Q-values according to their current load—the proposed method achieves enhanced task allocation under both normal and emergency conditions. Simulation results indicate improved responsiveness and resource efficiency, laying the groundwork for future studies on scalable, decentralized learning algorithms in real-world critical environments.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Decentralized Q-Learning for Workload Offloading in Urgent Edge Computing Scenarios

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Valerio Besozzi,
  • Emanuele Carlini,
  • Marco Danelutto,
  • Patrizio Dazzi,
  • Matteo Della Bartola,
  • Luca Ferrucci,
  • Jacopo Massa,
  • Matteo Mordacchini

摘要

In urgent edge computing scenarios, where rapid decision-making is paramount, traditional centralized methods often struggle with dynamic workloads. This paper introduces a decentralized Q-learning framework for workload offloading, enabling individual edge nodes to make adaptive decisions based solely on local observations and limited neighbor communications. By incorporating a cooperative mechanism—where agents weight neighbor Q-values according to their current load—the proposed method achieves enhanced task allocation under both normal and emergency conditions. Simulation results indicate improved responsiveness and resource efficiency, laying the groundwork for future studies on scalable, decentralized learning algorithms in real-world critical environments.