IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0270183.html
   My bibliography  Save this article

Delay-aware distributed program caching for IoT-edge networks

Author

Listed:
  • Chang Kyung Kim
  • TaeYoung Kim
  • SuKyoung Lee
  • Seungkyun Lee
  • Anna Cho
  • Mun-Suk Kim

Abstract

Edge computing is a novel network architecture that is in proximity to the end devices in an Internet of Things (IoT). As the IoT becoming a major factor in our daily life, provisioning a low response time of the services to IoT users through edge computing is an important problem. Caching necessary program data for the task in an edge node effectively reduces the response time of the computation task. However, due to the increase of IoT users and devices, it is noteworthy that limited-resource edge nodes would receive a number of tasks, having a heavy burden of processing the requests. Therefore, the limited resource and caching space at cloudlet need the careful design of the caching algorithm to utilize the space of multiple edge nodes and relieve the burden of computations. In this paper, we propose a cooperative program caching system that makes different edge nodes cooperatively store program data and cache the replicas of the data requested frequently to handle a number of requests from IoT users. In particular, we develop a cooperative caching algorithm that caches the appropriate number of data replicas depending on the number of requests on each cloudlet and the popularity of the data to minimize the response time. The simulation results show that the proposed cooperative caching algorithm can effectively reduce the response time for IoT users compared to other existing algorithms.

Suggested Citation

  • Chang Kyung Kim & TaeYoung Kim & SuKyoung Lee & Seungkyun Lee & Anna Cho & Mun-Suk Kim, 2022. "Delay-aware distributed program caching for IoT-edge networks," PLOS ONE, Public Library of Science, vol. 17(7), pages 1-20, July.
  • Handle: RePEc:plo:pone00:0270183
    DOI: 10.1371/journal.pone.0270183
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0270183
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0270183&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0270183?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0270183. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.