The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds
Abstract
Mobile edge computing allows wireless users to exploit the power of cloud computing without the large communication delay. To serve data-intensive applications (e.g., augmented reality, video analytics) from the edge, we need, in addition to CPU cycles and memory for computation, storage resource for storing server data and network bandwidth for receiving user-provided data. Moreover, the data placement needs to be adapted over time to serve time-varying demands, while considering system stability and operation cost. We address this problem by proposing a two-time-scale framework that jointly optimizes service (data & code) placement and request scheduling, under storage, communication, computation, and budget constraints. We fully characterize the complexity of our problem by analyzing the hardness of various cases. By casting our problem as a set function optimization, we develop a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions. Extensive synthetic and trace-driven simulations show that the proposed algorithm achieves 90% of the optimal performance.
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
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
Spinelli, F., & Mancuso, V. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3037674 · Cited by 253
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-citation
Metadata
- Authors
- Farhadi, V., Mehmeti, F., He, T., Porta, T. L., Khamfroush, H., Wang, S., & Chan, K. S.
- Venue
- IEEE INFOCOM 2019 - IEEE Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2019-04
- Pages
- 1279-1287
- OpenAlex
- W2919603306
- Cited by
- 177
- References
- 2
- FWCI
- 28.26
- 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: Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. https://app.cochat.ai/papers/10.1109/infocom.2019.8737368
- The paper
- Farhadi, V., Mehmeti, F., He, T., Porta, T. L., Khamfroush, H., Wang, S., & Chan, K. S. (2019). Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. IEEE INFOCOM 2019 - IEEE Conference on Computer Communications. https://doi.org/10.1109/infocom.2019.8737368
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.