Show simple item record

dc.contributor.authorChen, Z
dc.contributor.authorYi, W
dc.contributor.authorAlam, AS
dc.contributor.authorNallanathan, A
dc.date.accessioned2023-11-09T10:35:56Z
dc.date.available2023-11-09T10:35:56Z
dc.date.issued2022
dc.identifier.issn0090-6778
dc.identifier.urihttps://qmro.qmul.ac.uk/xmlui/handle/123456789/91812
dc.description.abstractIn multi-access edge computing (MEC), most existing task software caching works focus on statically caching data at the network edge, which may hardly preserve high reusability due to the time-varying user requests in practice. To this end, this work considers dynamic task software caching at the MEC server to assist users’ task execution. Specifically, we formulate a joint task software caching update (TSCU) and computation offloading (COMO) problem to minimize users’ energy consumption while guaranteeing delay constraints, where the limited cache size and computation capability of the MEC server, as well as the time-varying task demand of users are investigated. This problem is proved to be non-deterministic polynomial-time hard, so we transform it into two sub-problems according to their temporal correlations, i.e., the real-time COMO problem and the Markov decision process-based TSCU problem. We first model the COMO problem as a multi-user game and propose a decentralized algorithm to address its Nash equilibrium solution. We then propose a double deep Q-network (DDQN)-based method to solve the TSCU policy. To reduce the computation complexity and convergence time, we provide a new design for the deep neural network (DNN) in DDQN, named state coding and action aggregation (SCAA). In SCAA-DNN, we introduce a dropout mechanism in the input layer to code users’ activity states. Additionally, at the output layer, we devise a two-layer architecture to dynamically aggregate caching actions, which is able to solve the huge state-action space problem. Simulation results show that the proposed solution outperforms existing schemes, saving over 12% energy, and converges with fewer training episodes.en_US
dc.format.extent6950 - 6965
dc.publisherIEEEen_US
dc.relation.ispartofIEEE TRANSACTIONS ON COMMUNICATIONS
dc.rightsThis item is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
dc.rightsAttribution 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/us/*
dc.subjectTask analysisen_US
dc.subjectSoftwareen_US
dc.subjectServersen_US
dc.subjectEnergy consumptionen_US
dc.subjectDelaysen_US
dc.subjectResource managementen_US
dc.subjectWireless communicationen_US
dc.subjectComputation offloadingen_US
dc.subjectdeep reinforcement learningen_US
dc.subjectgame theoryen_US
dc.subjectmulti-access edge computingen_US
dc.subjectsoftware cachingen_US
dc.titleDynamic Task Software Caching-Assisted Computation Offloading for Multi-Access Edge Computingen_US
dc.typeArticleen_US
dc.rights.holder© 2023 The Authors, published by IEEE
dc.identifier.doi10.1109/TCOMM.2022.3200109
pubs.author-urlhttps://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000870308700043&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6aen_US
pubs.issue10en_US
pubs.notesNot knownen_US
pubs.publication-statusPublisheden_US
pubs.volume70en_US
rioxxterms.funderDefault funderen_US
rioxxterms.identifier.projectDefault projecten_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

This item is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Except where otherwise noted, this item's license is described as This item is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.