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

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 B...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of network management 2023-11, Vol.33 (6)
Hauptverfasser: Taka, Haruto, He, Fujun, Oki, Eiji
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 6
container_start_page
container_title International journal of network management
container_volume 33
creator Taka, Haruto
He, Fujun
Oki, Eiji
description 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.
doi_str_mv 10.1002/nem.2233
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2886548433</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2886548433</sourcerecordid><originalsourceid>FETCH-LOGICAL-c255t-cf26469f65a6194f304bf5c4469bab265c8720d5508e66e0cadbe682d00307073</originalsourceid><addsrcrecordid>eNotkMtKxDAUQIMoOI6CnxBw46ZjHk3aLmXwieBG1yVNb0vGNqlJqujKT_Ab_RIzjqt7ORzuhYPQKSUrSgi7sDCuGON8Dy0oqaqM0orsb3chsoLm5SE6CmFDkkqrYoE-752xEQfwb0YDngalYYRElG3xnDBWIZje_rHRtTBgY_E4D9H8fH0rrSEEDG0PWLtxmqOxPbYQ351_CVj1ytgQcaMCJDtEFY2zuFNmmD0co4NODQFO_ucSPV9fPa1vs4fHm7v15UOmmRAx0x2Tuaw6KZSkVd5xkjed0HlijWqYFLosGGmFICVICUSrtgFZspYQTgpS8CU6292dvHudIcR642Zv08ualaUUeZlznqzznaW9C8FDV0_ejMp_1JTU27J1Kltvy_JfjqVvYQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2886548433</pqid></control><display><type>article</type><title>Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure</title><source>Wiley Online Library All Journals</source><creator>Taka, Haruto ; He, Fujun ; Oki, Eiji</creator><creatorcontrib>Taka, Haruto ; He, Fujun ; Oki, Eiji</creatorcontrib><description>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.</description><identifier>ISSN: 1055-7148</identifier><identifier>EISSN: 1099-1190</identifier><identifier>DOI: 10.1002/nem.2233</identifier><language>eng</language><publisher>Chichester: Wiley Subscription Services, Inc</publisher><subject>Algorithms ; Cloud computing ; Edge computing ; Failure ; Greedy algorithms ; Integer programming ; Linear programming ; Network latency ; Optimization ; Placement</subject><ispartof>International journal of network management, 2023-11, Vol.33 (6)</ispartof><rights>2023 John Wiley &amp; Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c255t-cf26469f65a6194f304bf5c4469bab265c8720d5508e66e0cadbe682d00307073</citedby><cites>FETCH-LOGICAL-c255t-cf26469f65a6194f304bf5c4469bab265c8720d5508e66e0cadbe682d00307073</cites><orcidid>0000-0003-4540-2997 ; 0000-0003-2177-5027</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Taka, Haruto</creatorcontrib><creatorcontrib>He, Fujun</creatorcontrib><creatorcontrib>Oki, Eiji</creatorcontrib><title>Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure</title><title>International journal of network management</title><description>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.</description><subject>Algorithms</subject><subject>Cloud computing</subject><subject>Edge computing</subject><subject>Failure</subject><subject>Greedy algorithms</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Network latency</subject><subject>Optimization</subject><subject>Placement</subject><issn>1055-7148</issn><issn>1099-1190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNotkMtKxDAUQIMoOI6CnxBw46ZjHk3aLmXwieBG1yVNb0vGNqlJqujKT_Ab_RIzjqt7ORzuhYPQKSUrSgi7sDCuGON8Dy0oqaqM0orsb3chsoLm5SE6CmFDkkqrYoE-752xEQfwb0YDngalYYRElG3xnDBWIZje_rHRtTBgY_E4D9H8fH0rrSEEDG0PWLtxmqOxPbYQ351_CVj1ytgQcaMCJDtEFY2zuFNmmD0co4NODQFO_ucSPV9fPa1vs4fHm7v15UOmmRAx0x2Tuaw6KZSkVd5xkjed0HlijWqYFLosGGmFICVICUSrtgFZspYQTgpS8CU6292dvHudIcR642Zv08ualaUUeZlznqzznaW9C8FDV0_ejMp_1JTU27J1Kltvy_JfjqVvYQ</recordid><startdate>202311</startdate><enddate>202311</enddate><creator>Taka, Haruto</creator><creator>He, Fujun</creator><creator>Oki, Eiji</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-4540-2997</orcidid><orcidid>https://orcid.org/0000-0003-2177-5027</orcidid></search><sort><creationdate>202311</creationdate><title>Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure</title><author>Taka, Haruto ; He, Fujun ; Oki, Eiji</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c255t-cf26469f65a6194f304bf5c4469bab265c8720d5508e66e0cadbe682d00307073</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Cloud computing</topic><topic>Edge computing</topic><topic>Failure</topic><topic>Greedy algorithms</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Network latency</topic><topic>Optimization</topic><topic>Placement</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Taka, Haruto</creatorcontrib><creatorcontrib>He, Fujun</creatorcontrib><creatorcontrib>Oki, Eiji</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of network management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Taka, Haruto</au><au>He, Fujun</au><au>Oki, Eiji</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure</atitle><jtitle>International journal of network management</jtitle><date>2023-11</date><risdate>2023</risdate><volume>33</volume><issue>6</issue><issn>1055-7148</issn><eissn>1099-1190</eissn><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.</abstract><cop>Chichester</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/nem.2233</doi><orcidid>https://orcid.org/0000-0003-4540-2997</orcidid><orcidid>https://orcid.org/0000-0003-2177-5027</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1055-7148
ispartof International journal of network management, 2023-11, Vol.33 (6)
issn 1055-7148
1099-1190
language eng
recordid cdi_proquest_journals_2886548433
source Wiley Online Library All Journals
subjects Algorithms
Cloud computing
Edge computing
Failure
Greedy algorithms
Integer programming
Linear programming
Network latency
Optimization
Placement
title Joint service placement and user assignment model in multi‐access edge computing networks against base‐station failure
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T21%3A02%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Joint%20service%20placement%20and%20user%20assignment%20model%20in%20multi%E2%80%90access%20edge%20computing%20networks%20against%20base%E2%80%90station%20failure&rft.jtitle=International%20journal%20of%20network%20management&rft.au=Taka,%20Haruto&rft.date=2023-11&rft.volume=33&rft.issue=6&rft.issn=1055-7148&rft.eissn=1099-1190&rft_id=info:doi/10.1002/nem.2233&rft_dat=%3Cproquest_cross%3E2886548433%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2886548433&rft_id=info:pmid/&rfr_iscdi=true