Service Placement with Provable Guarantees in Heterogeneous Edge Computing Systems
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Mobile edge computing (MEC) is a promising technique for providing low-latency access to services at the network edge. The services are hosted at various types of edge nodes with both computation and communication capabilities. Due to the heterogeneity of edge node characteristics and user locations, the performance of MEC varies depending on where the service is hosted. In this paper, we consider such a heterogeneous MEC system, and focus on the problem of placing multiple services in the system to maximize the total reward. We show that the problem is NP-hard via reduction from the set cover problem, and propose a deterministic approximation algorithm to solve the problem, which has an approximation ratio that is not worse than(1-e-1)/4. The proposed algorithm is based on two subroutines that are suitable for small and arbitrarily sized services, respectively. The algorithm is designed using a novel way of partitioning each edge node into multiple slots, where each slot contains one service. The approximation guarantee is obtained via a specialization of the method of conditional expectations, which uses a randomized procedure as an intermediate step. In addition to theoretical guarantees, simulation results also show that the proposed algorithm outperforms other state-of-the-art approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607 · cited 1×
“Mobile edge computing (MEC) has emerged as a key technology to make this possible [1], [2].”
BackgroundMobile Edge Computing: A Survey on Architecture and Computation Offloading
Mach, P., & Becvar, Z. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2682318 · Cited by 3,258
Efficient multi-user computation offloading for mobile-edge cloud computing
Chen, X., Jiao, L., Li, W., & Fu, X. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2487344 · Cited by 2,675
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Fleischer, L., Goemans, M. X., Mirrokni, V. S., & Sviridenko, M. (2011) · Mathematics of Operations Research · doi:10.1287/moor.1110.0499 · Cited by 65
Cited by
Resource Scheduling in Edge Computing: A Survey
Luo, Q., Hu, S., Li, C., Li, G., & Shi, W. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3106401 · Cited by 588
“The work in [198] studied the problem of maximizing revenue by placing multiple services in an edge system.”
BackgroundOptimal Placement of Social Digital Twins in Edge IoT Networks
Chukhno, O., Chukhno, N., Araniti, G., Campolo, C., Iera, A., & Molinaro, A. (2020) · Sensors · doi:10.3390/s20216181 · Cited by 42
“Further related works focus on virtual machine replica placement problem [40,41], service entity problem [23,42], and joint service placement [43,44] with additional focuses on, e.”
BackgroundXu, M., Zhou, Q., Wu, H., Lin, W., Ye, K., & Xu, C. (2022) · Software: Practice and Experience · doi:10.1002/spe.3014 · Cited by 35
Optimized Task Allocation for IoT Application in Mobile-Edge Computing
Liu, J., Liu, C., Wang, B., Gao, G., & Wang, S. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3091599 · Cited by 25
Self-citationProactive Fault Tolerant Service Management in Edge Computing
Tambe, S. D., & A., A. F. (2023) · 2023 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) · doi:10.1109/ants59832.2023.10469661 · Cited by 2
“Also, from a guarantee perspective, the authors proposed a reward-based approximation approach for heterogeneous services in [8].”
Background
Metadata
- Authors
- Pasteris, S., Wang, S., Herbster, M., & He, T.
- Venue
- IEEE INFOCOM 2019 - IEEE Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2019-04
- Pages
- 514-522
- OpenAlex
- W2918335825
- Cited by
- 162
- References
- 4
- FWCI
- 22.47
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.