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

Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure

Author

Listed:
  • Haruto Taka
  • Fujun He
  • Eiji Oki

Abstract

Multi‐access edge computing (MEC) enables users to exploit the resources of cloud computing at a base station (BS) in proximity to the users where an MEC server is hosted. While we have advantage of being able to communicate with low latency and small network load in MEC networks, the resources in BSs are limited. One challenge is where to provide users with services from to make efficient use of resources. Furthermore, to enhance the reliability of MEC system, the case that a BS fails needs to be considered. This paper proposes a service placement and user assignment model with preventive start‐time optimization against a single BS failure in MEC networks. The proposed model preventively determines the service placement and user assignment in each BS failure pattern to minimize the worst‐case penalty which is the largest penalty among all failure patterns. We formulate the proposed model as an integer linear programming problem. We prove that the considered problem is NP‐hard. When the problem size becomes large, it may not be solved in a practical computation time. To solve larger size problems, we introduce two algorithms: one is the greedy algorithm with allocation upgrade and the other is with allocation upgrade and preemption. The results show that the introduced algorithms obtain solutions with smaller worst‐case penalty than the benchmark in a practical time.

Suggested Citation

  • Haruto Taka & Fujun He & Eiji Oki, 2023. "Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure," International Journal of Network Management, John Wiley & Sons, vol. 33(6), November.
  • Handle: RePEc:wly:intnem:v:33:y:2023:i:6:n:e2233
    DOI: 10.1002/nem.2233
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nem.2233?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:33:y:2023:i:6:n:e2233. 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.