A DQN-Based Joint Computing Offloading and Resource Allocation Algorithm for MEC Networks

This paper studies the joint computing offloading and resource allocation problem in an MEC network. We formulate the problem as an optimization problem with the objective to maximize the network throughput while satisfying the delay requirements of as many service requests as possible. Meanwhile, w...

Full description

Saved in:
Bibliographic Details
Published inIEEE International Conference on Communications (2003) pp. 2553 - 2558
Main Authors Yu, Li, Jiang, Shurui, Zheng, Jun, Yan, Feng, Zhao, Shuyuan
Format Conference Proceeding
LanguageEnglish
Published IEEE 28.05.2023
Subjects
Online AccessGet full text
ISSN1938-1883
DOI10.1109/ICC45041.2023.10279106

Cover

Abstract This paper studies the joint computing offloading and resource allocation problem in an MEC network. We formulate the problem as an optimization problem with the objective to maximize the network throughput while satisfying the delay requirements of as many service requests as possible. Meanwhile, we propose a deep-Q-network (DQN) based joint computing offloading and resource allocation (D-CORAL) algorithm to solve the formulated problem. The proposed D-CORAL algorithm attempts to jointly optimize edge node selection, and spectrum resource and computing resource allocation for each service request by learning online to better adapt to a dynamic environment. Simulation results show the proposed algorithm can achieve larger network throughput than two benchmark algorithms.
AbstractList This paper studies the joint computing offloading and resource allocation problem in an MEC network. We formulate the problem as an optimization problem with the objective to maximize the network throughput while satisfying the delay requirements of as many service requests as possible. Meanwhile, we propose a deep-Q-network (DQN) based joint computing offloading and resource allocation (D-CORAL) algorithm to solve the formulated problem. The proposed D-CORAL algorithm attempts to jointly optimize edge node selection, and spectrum resource and computing resource allocation for each service request by learning online to better adapt to a dynamic environment. Simulation results show the proposed algorithm can achieve larger network throughput than two benchmark algorithms.
Author Yan, Feng
Yu, Li
Zhao, Shuyuan
Jiang, Shurui
Zheng, Jun
Author_xml – sequence: 1
  givenname: Li
  surname: Yu
  fullname: Yu, Li
  organization: School of Information Science and Engineering, Southeast University,National Mobile Communications Research Laboratory, Frontiers Science Center for Mobile Information Communication and Security,Nanjing,China,210096
– sequence: 2
  givenname: Shurui
  surname: Jiang
  fullname: Jiang, Shurui
  organization: School of Information Science and Engineering, Southeast University,National Mobile Communications Research Laboratory, Frontiers Science Center for Mobile Information Communication and Security,Nanjing,China,210096
– sequence: 3
  givenname: Jun
  surname: Zheng
  fullname: Zheng, Jun
  email: junzheng@seu.edu.cn
  organization: School of Information Science and Engineering, Southeast University,National Mobile Communications Research Laboratory, Frontiers Science Center for Mobile Information Communication and Security,Nanjing,China,210096
– sequence: 4
  givenname: Feng
  surname: Yan
  fullname: Yan, Feng
  organization: School of Information Science and Engineering, Southeast University,National Mobile Communications Research Laboratory, Frontiers Science Center for Mobile Information Communication and Security,Nanjing,China,210096
– sequence: 5
  givenname: Shuyuan
  surname: Zhao
  fullname: Zhao, Shuyuan
  organization: School of Information Science and Engineering,National Mobile Communications Research Laboratory, Frontiers Science Center for Mobile Information Communication and Security, Zhejiang Lab,Hangzhou,China,311121
BookMark eNo1kMFOwkAUAFejiYD-gTH7A8X3drevu0esoBiEaPTgiTzoFldLl7Qlxr9Xo55mTnOYvjiqY-2FuEAYIoK7nOa5ScHgUIHSQwSVOQQ6EH1MtaXMkHKHoodO2wSt1Sei37ZvAKlyGnviZSSvH-bJFbe-kHcx1J3M43a370K9kYuyrCIXP8p1IR99G_fN2stRVcU1dyHW37qJTehet7KMjbwf53Luu4_YvLen4rjkqvVnfxyI58n4Kb9NZoubaT6aJUGB6RIErTjLWJuVYU9-TYDGZIApasuGgGkFVjtegTNU-Iw0kUtVSQWlbEs9EOe_3eC9X-6asOXmc_n_QX8BF39SZw
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ICC45041.2023.10279106
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1538674629
9781538674628
EISSN 1938-1883
EndPage 2558
ExternalDocumentID 10279106
Genre orig-research
GroupedDBID 29F
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i204t-1032a77a34b4ae6ec601447015138a460a6b0839ab0946de76366952f6d65a8f3
IEDL.DBID RIE
IngestDate Wed Aug 27 02:23:35 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i204t-1032a77a34b4ae6ec601447015138a460a6b0839ab0946de76366952f6d65a8f3
PageCount 6
ParticipantIDs ieee_primary_10279106
PublicationCentury 2000
PublicationDate 2023-May-28
PublicationDateYYYYMMDD 2023-05-28
PublicationDate_xml – month: 05
  year: 2023
  text: 2023-May-28
  day: 28
PublicationDecade 2020
PublicationTitle IEEE International Conference on Communications (2003)
PublicationTitleAbbrev ICC
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0052931
Score 2.2374609
Snippet This paper studies the joint computing offloading and resource allocation problem in an MEC network. We formulate the problem as an optimization problem with...
SourceID ieee
SourceType Publisher
StartPage 2553
SubjectTerms Benchmark testing
computing offloading
Delays
DQN
Dynamic scheduling
Heuristic algorithms
MEC
MEC network
resource allocation
Resource management
Simulation
Throughput
Title A DQN-Based Joint Computing Offloading and Resource Allocation Algorithm for MEC Networks
URI https://ieeexplore.ieee.org/document/10279106
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZoJ1h4FfGWB1YHJ3GcZCyhVanUABKVylTZsQ1VS4JKuvDrOScNLwmJzUoUJbpT7vvOvu8OoQvIYyUFXk8kN5QwlykSSU8RFQaBjKjvxcYKnEcpH4zZcBJM1mL1Sgujta6Kz7Rjl9VZviqyld0qgz_cCwHeeAu1wojXYq0m7AaAW-5aAuzS-PImSVhAmU0BPd9pnvwxQ6WCkP42SpuX15Ujc2dVSid7_9WX8d9ft4M6X2o9fPeJQ7toQ-d7aOtbo8F99NjF1_cpuQLIUnhYzPIS1-Mc4C6-NWZRVKX0WOQKNxv6uLuwQGcdB8unYjkrn18wcFw86iU4rcvH3zpo3O89JAOyHqpAZh5lJbEN9EQYCp9JJjTXGbc5VQiswPUjwTgVXAItiwW4kHGlIf5wHgee4YoHIjL-AWrnRa4PEc5s-z6wupDasFCYCNiIZpZycggTRh2hjrXS9LXumzFtDHT8x_UTtGmdZc_mvegUtcvlSp8B5JfyvHL1B5EyqH8
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwELWgHIALWxE7PnBNyGI7ybGEVm1pA0itVE6VXdtQURJU0gtfzzhp2CQkblaiKNGMMu-NPW8GoQvIY4UDvN4STDsWcYm0QuFJSwaUitDxvUgbgXM_Ye0h6Y7oaClWL7QwSqmi-EzZZlmc5ctssjBbZfCHewHAG1tFa5QQQku5VhV4KSCXuxQBu0502YljQh1ikkDPt6tnf0xRKUCktYWS6vVl7cizvciFPXn_1Znx39-3jepfej1894lEO2hFpbto81urwT300MDX94l1BaAlcTebpjkuBzrAXXyr9SwriukxTyWutvRxY2agzrgOlo_ZfJo_vWBgubjfjHFSFpC_1dGw1RzEbWs5VsGaeg7JLdNCjwcB94kgXDE1YSarCoAXuH7ICXM4E0DMIg5OJEwqiECMRdTTTDLKQ-3vo1qapeoA4Ylp4AdW50JpEnAdAh9RxJBOBoFCy0NUN1Yav5adM8aVgY7-uH6O1tuDfm_c6yQ3x2jDOM6c1HvhCarl84U6BQKQi7PC7R-Wc6vM
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=IEEE+International+Conference+on+Communications+%282003%29&rft.atitle=A+DQN-Based+Joint+Computing+Offloading+and+Resource+Allocation+Algorithm+for+MEC+Networks&rft.au=Yu%2C+Li&rft.au=Jiang%2C+Shurui&rft.au=Zheng%2C+Jun&rft.au=Yan%2C+Feng&rft.date=2023-05-28&rft.pub=IEEE&rft.eissn=1938-1883&rft.spage=2553&rft.epage=2558&rft_id=info:doi/10.1109%2FICC45041.2023.10279106&rft.externalDocID=10279106