About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Collaborative Computing: Networking, Applications and Worksharing. 18th EAI International Conference, CollaborateCom 2022, Hangzhou, China, October 15-16, 2022, Proceedings, Part II

Research Article

A Pareto-Efficient Task-Allocation Framework Based on Deep Reinforcement Learning Algorithm in MEC

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-031-24386-8_11,
        author={Wenwen Liu and Sinong Zhao and Zhaoyang Yu and Gang Wang and Xiaoguang Liu},
        title={A Pareto-Efficient Task-Allocation Framework Based on Deep Reinforcement Learning Algorithm in MEC},
        proceedings={Collaborative Computing: Networking, Applications and Worksharing. 18th EAI International Conference, CollaborateCom 2022, Hangzhou, China, October 15-16, 2022, Proceedings, Part II},
        proceedings_a={COLLABORATECOM PART 2},
        year={2023},
        month={1},
        keywords={Mobile edge computing Pareto-efficient Task-allocation framework Deep reinforcement learning algorithm},
        doi={10.1007/978-3-031-24386-8_11}
    }
    
  • Wenwen Liu
    Sinong Zhao
    Zhaoyang Yu
    Gang Wang
    Xiaoguang Liu
    Year: 2023
    A Pareto-Efficient Task-Allocation Framework Based on Deep Reinforcement Learning Algorithm in MEC
    COLLABORATECOM PART 2
    Springer
    DOI: 10.1007/978-3-031-24386-8_11
Wenwen Liu1, Sinong Zhao1, Zhaoyang Yu1, Gang Wang1,*, Xiaoguang Liu1
  • 1: College of Computer Science, TJ Key Lab of NDST
*Contact email: wgzwp@nbjl.nankai.edu.cn

Abstract

Mobile-edge computing (MEC) has emerged as a promising paradigm that moves tasks running in the cloud to edge servers. In MEC systems, there are various individual requirements, such as less user-perceived time and lower energy consumption. In this case, substantial efforts have been paid to task allocation, aiming at enabling lower latency and higher resource utilization. However existing studies on multiple-objectives task allocation algorithms rarely consider the Pareto efficient problem, where no objective could be further improved without vitiating the other objectives’ optimization. In this paper, we propose a Pareto-efficient task-allocation framework based on a deep reinforcement learning algorithm. We give the formal formulations for objectives and construct a multi-objectives’ optimization model for task allocation. Then a Pareto efficient algorithm is proposed to solve the problem of conflicting among multi-objectives. By coordinating multi-objectives parameters get from Pareto efficient algorithm, the deep reinforcement learning model takes a Pareto-efficient task allocation to improve real-time and resource utilization performance. We evaluate the proposed framework over various real-world tasks and compare it with existing allocating tasks models in edge computing networks. By using the proposed framework, we can get an accuracy that not be lower than 90% under the 0.6 s latency requirement. The simulation results also show that the proposed framework achieves lower latency and higher resource utilization compared to other task allocation methods.

Keywords
Mobile edge computing Pareto-efficient Task-allocation framework Deep reinforcement learning algorithm
Published
2023-01-25
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-031-24386-8_11
Copyright © 2022–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL