IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v31y2021i6ne2176.html
   My bibliography  Save this article

Deep Q‐network‐based auto scaling for service in a multi‐access edge computing environment

Author

Listed:
  • Do‐Young Lee
  • Se‐Yeon Jeong
  • Kyung‐Chan Ko
  • Jae‐Hyoung Yoo
  • James Won‐Ki Hong

Abstract

In 5G networks, it is necessary to provide services while meeting various service requirements, such as high data rates and low latency, in response to dynamic network conditions. Multi‐access edge computing (MEC) is a promising concept to meet these requirements. The MEC environment enables service providers to deploy their low latency services that are composed of multiple components. However, operating a service manually and attempting to satisfy the quality of service (QoS) requirements is difficult because many factors need to be considered in an MEC scenario. In this paper, we propose an auto‐scaling method using deep Q‐networks (DQN), which is a reinforcement learning algorithm, to resize the number of instances assigned to service. In our evaluation, compared to other baseline methods, the proposed approach maintains the appropriate number of instances effectively in response to dynamic traffic change while satisfying QoS and minimizing the cost of operating the service in the MEC environment. The proposed method was implemented as a module running in OpenStack and published as open‐source software.

Suggested Citation

  • Do‐Young Lee & Se‐Yeon Jeong & Kyung‐Chan Ko & Jae‐Hyoung Yoo & James Won‐Ki Hong, 2021. "Deep Q‐network‐based auto scaling for service in a multi‐access edge computing environment," International Journal of Network Management, John Wiley & Sons, vol. 31(6), November.
  • Handle: RePEc:wly:intnem:v:31:y:2021:i:6:n:e2176
    DOI: 10.1002/nem.2176
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2176
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2176?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:wly:intnem:v:31:y:2021:i:6:n:e2176. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.