PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 18, 2025ACM Transactions on Intelligent Systems and Technology3 citationsOpen Access

Joint Service Migration and Resource Allocation for DNN tasks using SA-DDQN-DDPG in Vehicular Edge Computing

View Full Paper
CLChunlin LiZZZihao ZhangBWBingxin Wang

Key Points

  • Proposed optimization strategy minimizes the average task completion delay for DNNs in vehicular edge computing.
  • The SA-DDQN-DDPG algorithm achieves a 40.41% reduction in average migration latency compared to traditional methods.
  • Formulated as a mixed integer nonlinear programming problem and solved using a markov decision process approach.
  • Demonstrates the effectiveness of service migration and resource allocation in improving vehicle quality of experience.

Abstract

With the rapid development of Vehicular Edge Computing (VEC) and Artificial Intelligence (AI), the emergence of vehicle edge intelligence meets the need for real-time vehicle intelligence applications. But the execution of deep neural networks (DNNs) requires a large amount of data input, which results in a large amount of computing resources required for the execution of DNN tasks. This also brings a certain burden to the deployment of DNN tasks and the resource allocation of edge servers. In addition, due to the high mobility of vehicles in the VEC, the backhaul delay of vehicle edge intelligent task results increases, affecting the vehicle's Quality of Experience (QoE). We propose a joint optimization strategy for service migration and resource allocation aimed at minimizing the average task completion delay. This strategy comprehensively considers service migration actions and edge server resource allocation, which is proved to be a mixed integer nonlinear programming (MINLP) problem, and hence we formulate it as an markov decision process (MDP). To solve this problem, we propose a service migration algorithm based on the self-attention mechanism-based double deep Q-network and deep deterministic policy gradient algorithm (SA-DDQN-DDPG) algorithm to solve it to obtain the optimal system service migration strategy. The experimental results show that the proposed SA-DDQN-DDPG algorithm has good performance in reducing latency. The average migration latency is reduced by 40.41%, 20.7% and 14.50% compared with always, DQN and DDQN respectively.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Li et al. (2025) studied this question.

synapsesocial.com/papers/68d461bc31b076d99fa60bddhttps://doi.org/10.1145/3768152
Ask AI
Helpful
Bookmark
Share
View Full Paper