IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v11y2019i8p181-d259069.html
   My bibliography  Save this article

A Novel Task Caching and Migration Strategy in Multi-Access Edge Computing Based on the Genetic Algorithm

Author

Listed:
  • Lujie Tang

    (School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, Hunan, China)

  • Bing Tang

    (School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, Hunan, China)

  • Linyao Kang

    (School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, Hunan, China)

  • Li Zhang

    (School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, Hunan, China)

Abstract

Multi-access edge computing (MEC) brings high-bandwidth and low-latency access to applications distributed at the edge of the network. Data transmission and exchange become faster, and the overhead of the task migration between mobile devices and edge cloud becomes smaller. In this paper, we adopt the fine-grained task migration model. At the same time, in order to further reduce the delay and energy consumption of task execution, the concept of the task cache is proposed, which involves caching the completed tasks and related data on the edge cloud. Then, we consider the limitations of the edge cloud cache capacity to study the task caching strategy and fine-grained task migration strategy on the edge cloud using the genetic algorithm (GA). Thus, we obtained the optimal mobile device task migration strategy, satisfying minimum energy consumption and the optimal cache on the edge cloud. The simulation results showed that the task caching strategy based on fine-grained migration can greatly reduce the energy consumption of mobile devices in the MEC environment.

Suggested Citation

  • Lujie Tang & Bing Tang & Linyao Kang & Li Zhang, 2019. "A Novel Task Caching and Migration Strategy in Multi-Access Edge Computing Based on the Genetic Algorithm," Future Internet, MDPI, vol. 11(8), pages 1-14, August.
    • Handle: RePEc:gam:jftint:v:11:y:2019:i:8:p:181-:d:259069
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/11/8/181/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/11/8/181/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:11:y:2019:i:8:p:181-:d:259069. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.