Online Resource Allocation for Arbitrary User Mobility in Distributed Edge Clouds
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
As clouds move to the network edge to facilitate mobile applications, edge cloud providers are facing new challenges on resource allocation. As users may move and resource prices may vary arbitrarily, %and service delays are heterogeneous, resources in edge clouds must be allocated and adapted continuously in order to accommodate such dynamics. In this paper, we first formulate this problem with a comprehensive model that captures the key challenges, then introduce a gap-preserving transformation of the problem, and propose a novel online algorithm that optimally solves a series of subproblems with a carefully designed logarithmic objective, finally producing feasible solutions for edge cloud resource allocation over time. We further prove via rigorous analysis that our online algorithm can provide a parameterized competitive ratio, without requiring any a priori knowledge on either the resource price or the user mobility. Through extensive experiments with both real-world and synthetic data, we further confirm the effectiveness of the proposed algorithm. We show that the proposed algorithm achieves near-optimal results with an empirical competitive ratio of about 1.1, reduces the total cost by up to 4x compared to static approaches, and outperforms the online greedy one-shot optimizations by up to 70%.
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
The case for vm-based cloudlets in mobile computing
Satyanarayanan, M., Bahl, P., Caceres, R., & Davies, N. (2009) · IEEE Pervasive Computing · doi:10.1109/mprv.2009.82 · Cited by 3,660
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
Self-citationEdge analytics in the internet of things
Satyanarayanan, M., Simoens, P., Xiao, Y., Pillai, P., Chen, Z., Ha, K., Hu, W., & Amos, B. (2015) · IEEE Pervasive Computing · doi:10.1109/mprv.2015.32 · Cited by 430 · cited 1×
“Pushing the cloud frontier to the Internet edge has attracted tremendous interest not only from cloud operators of the IT service/software industry but also from cellular carriers of the telecom industry [1].”
Background
Cited by
Adaptive Federated Learning in Resource Constrained Edge Computing Systems
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904348 · Cited by 2,232
Dynamic Task Offloading and Scheduling for Low-Latency IoT Services in Multi-Access Edge Computing
Alameddine, H. A., Sharafeddine, S., Sebbah, S., Ayoubi, S., & Assi, C. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2894306 · Cited by 364
Saeik, F., Avgeris, M., Spatharakis, D., Santi, N., Dechouniotis, D., Violos, J., Leivadeas, A., Athanasopoulos, N., Mitton, N., & Papavassiliou, S. (2021) · Computer Networks · doi:10.1016/j.comnet.2021.108177 · Cited by 276
Dynamic Service Migration in Mobile Edge Computing Based on Markov Decision Process
Wang, S., Urgaonkar, R., Zafer, M., He, T., Chan, K., & Leung, K. K. (2019) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2019.2916577 · Cited by 270
AI-based fog and edge computing: A systematic review, taxonomy and future directions
Iftikhar, S., Gill, S. S., Song, C., Xu, M., Aslanpour, M. S., Toosi, A. N., Du, J., Wu, H., Ghosh, S., Chowdhury, D., et al. (2023) · Internet of Things · doi:10.1016/j.iot.2022.100674 · Cited by 260
When Edge Meets Learning: Adaptive Control for Resource-Constrained Distributed Machine Learning
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2018) · IEEE INFOCOM 2018 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2018.8486403 · Cited by 209
Task Scheduling with Optimized Transmission Time in Collaborative Cloud-Edge Learning
Huang, Y., Zhu, Y., Fan, X., Ma, X., Wang, F., Liu, J., Wang, Z., & Cui, Y. (2018) · 2018 27th International Conference on Computer Communication and Networks (ICCCN) · doi:10.1109/icccn.2018.8487352 · Cited by 36
Metadata
- Authors
- Wang, L., Jiao, L., Li, J., & Muhlhauser, M.
- Venue
- 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)
- Publisher
- IEEE
- Published
- 2017-06
- Pages
- 1281-1290
- OpenAlex
- W2735929567
- Cited by
- 111
- References
- 3
- FWCI
- 13.59
- 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
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.