The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
It's Hard to Share: Joint Service Placement and Request Scheduling in Edge Clouds with Sharable and Non-Sharable Resources
Abstract
Mobile edge computing is an emerging technology to offer resource-intensive yet delay-sensitive applications from the edge of mobile networks, where a major challenge is to allocate limited edge resources to competing demands. While prior works often make a simplifying assumption that resources assigned to different users are non-sharable, this assumption does not hold for storage resources, where users interested in services (e.g., data analytics) based on the same set of data/code can share storage resource. Meanwhile, serving each user request also consumes non-sharable resources (e.g., CPU cycles, bandwidth). We study the optimal provisioning of edge services with non-trivial demands of both sharable (storage) and non-sharable (communication, computation) resources via joint service placement and request scheduling. In the homogeneous case, we show that while the problem is polynomial-time solvable without storage constraints, it is NP-hard even if each edge cloud has unlimited communication or computation resources. We further show that the hardness is caused by the service placement subproblem, while the request scheduling subproblem is polynomial-time solvable via maximum-flow algorithms. In the general case, both subproblems are NP-hard. We develop a constant-factor approximation algorithm for the homogeneous case and efficient heuristics for the general case. Our trace-driven simulations show that the proposed algorithms, especially the approximation algorithm, can achieve near-optimal performance, serving 2-3 times more requests than a baseline solution that optimizes service placement and request scheduling separately.
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
Fog computing and its role in the internet of things
Bonomi, F., Milito, R., Zhu, J., & Addepalli, S. (2012) · Proceedings of the first edition of the MCC workshop on Mobile cloud computing · doi:10.1145/2342509.2342513 · Cited by 6,244
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
An analysis of approximations for maximizing submodular set functions—II
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121195 · Cited by 589
Cited by
Bi, S., Huang, L., & Zhang, Y.-J. A. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2988386 · Cited by 340
Joint Service Placement and Request Routing in Multi-cell Mobile Edge Computing Networks
Poularakis, K., Llorca, J., Tulino, A. M., Taylor, I., & Tassiulas, L. (2019) · IEEE INFOCOM 2019 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2019.8737385 · Cited by 301
The convergence and interplay of edge, fog, and cloud in the AI-driven Internet of Things (IoT)
Firouzi, F., Farahani, B., & Marinšek, A. (2022) · Information Systems · doi:10.1016/j.is.2021.101840 · Cited by 295
Spinelli, F., & Mancuso, V. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3037674 · Cited by 253
Privacy-aware service placement for mobile edge computing via federated learning
Qian, Y., Hu, L., Chen, J., Guan, X., Hassan, M. M., & Alelaiwi, A. (2019) · Information Sciences · doi:10.1016/j.ins.2019.07.069 · Cited by 122
Metadata
- Authors
- He, T., Khamfroush, H., Wang, S., La Porta, T., & Stein, S.
- Venue
- 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS)
- Publisher
- IEEE
- Published
- 2018-07
- Pages
- 365-375
- OpenAlex
- W2808417010
- Cited by
- 227
- References
- 3
- FWCI
- 25.90
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: It's Hard to Share: Joint Service Placement and Request Scheduling in Edge Clouds with Sharable and Non-Sharable Resources. https://app.cochat.ai/papers/10.1109/icdcs.2018.00044
- The paper
- He, T., Khamfroush, H., Wang, S., La Porta, T., & Stein, S. (2018). It's Hard to Share: Joint Service Placement and Request Scheduling in Edge Clouds with Sharable and Non-Sharable Resources. 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS). https://doi.org/10.1109/icdcs.2018.00044
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.