EUVIMEDEUVIMED entdecken
Crossref

Generalizable Pareto-Optimal Offloading With Reinforcement Learning in Mobile Edge Computing

Ning Yang, Junrui Wen, Meng Zhang, Ming Tang

IEEE Transactions on Services Computing · 2025-11 · 18 (6) · 3824-3836

DOI: 10.1109/tsc.2025.3604371 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Services Computing, 2025-11. Verfasst von Ning Yang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 39 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Mobile edge computing (MEC) is essential for next-generation mobile network applications that prioritize various performance metrics, including delays and energy efficiency. However, conventional single-objective scheduling solutions cannot be directly applied to practical systems in which the preferences (i.e., the weights of different objectives) are often unknown or challenging to specify in advance. In this study, we formulate a multi-objective offloading problem for MEC with multiple edges to minimize the sum of expected long-term energy consumption and delay while considering unknown preferences. To address the challenge of unknown preferences and the potentially diverse MEC systems, we propose a generalizable multi-objective (deep) reinforcement learning (GMORL)-based tasks offloading framework, which employs the Discrete Soft Actor-Critic (Discrete-SAC) method. Our method uses a single policy model to efficiently schedule tasks based on varying preferences and adapt to heterogeneous MEC systems with different CPU frequencies and server quantities. Under the proposed framework, we introduce a histogram-based state encoding method for constructing features for multiple edges in MEC systems, a sophisticated reward function for accurately computing the utilities of delay and energy consumption, and a novel neural network architecture for improving generalization. Simulation results demonstrate that our proposed GMORL scheme enhances the hypervolume of the Pareto front by up to 121.0% compared to benchmarks.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Yang, N., Wen, J., Zhang, M., & Tang, M. (2025). Generalizable Pareto-Optimal Offloading With Reinforcement Learning in Mobile Edge Computing. IEEE Transactions on Services Computing, 18(6), 3824-3836. https://doi.org/10.1109/tsc.2025.3604371

Vancouver

Yang N, Wen J, Zhang M, Tang M. Generalizable Pareto-Optimal Offloading With Reinforcement Learning in Mobile Edge Computing. IEEE Transactions on Services Computing. 2025;18(6):3824-3836. doi:10.1109/tsc.2025.3604371

BibTeX
@article{Yang2025,
  author = {Yang, Ning and Wen, Junrui and Zhang, Meng and Tang, Ming},
  title = {Generalizable Pareto-Optimal Offloading With Reinforcement Learning in Mobile Edge Computing},
  journal = {IEEE Transactions on Services Computing},
  year = {2025},
  volume = {18},
  number = {6},
  pages = {3824--3836},
  doi = {10.1109/tsc.2025.3604371}
}
Kostenlos starten →