The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Online job dispatching and scheduling in edge-clouds
Abstract
In edge-cloud computing, a set of edge servers are deployed near the mobile devices such that these devices can offload jobs to the servers with low latency. One fundamental and critical problem in edge-cloud systems is how to dispatch and schedule the jobs so that the job response time (defined as the interval between the release of a job and the arrival of the computation result at its device) is minimized. In this paper, we propose a general model for this problem, where the jobs are generated in arbitrary order and times at the mobile devices and offloaded to servers with both upload and download delays. Our goal is to minimize the total weighted response time over all the jobs. The weight is set based on how latency sensitive the job is. We derive the first online job dispatching and scheduling algorithm in edge-clouds, called OnDisc, which is scalable in the speed augmentation model; that is, OnDisc is (1 + ε)-speed O(1/ε)-competitive for any constant ε ϵ (0,1). Moreover, OnDisc can be easily implemented in distributed systems. Extensive simulations on a real-world data-trace from Google show that OnDisc can reduce the total weighted response time dramatically compared with heuristic algorithms.
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
(2011) · doi:10.1145/1966445.1966473 · Cited by 1,870
ThinkAir: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading
Kosta, S., Aucinas, A., Hui, P., Mortier, R., & Zhang, X. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195845 · Cited by 1,186
Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
Schrage, L. E. (1968) · Operations Research · doi:10.1287/opre.16.3.687 · Cited by 561
A hierarchical edge cloud architecture for mobile computing
Tong, L., Li, Y., & Gao, W. (2016) · IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications · doi:10.1109/infocom.2016.7524340 · Cited by 518
A Dynamic Offloading Algorithm for Mobile Computing
Huang, D., Wang, P., & Niyato, D. (2012) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2012.041912.110912 · Cited by 493
Optimal Cloudlet Placement and User to Cloudlet Allocation in Wireless Metropolitan Area Networks
Jia, M., Cao, J., & Liang, W. (2017) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2015.2449834 · Cited by 473
COMET: code offload by migrating execution transparently
Gordon, M. S., Jamshidi, D. A., Mahlke, S. A., Mao, Z. M., & Xu, C. (2012) · doi:10.5555/2387880.2387890 · Cited by 357
Offloading in Mobile Cloudlet Systems with Intermittent Connectivity
Zhang, Y., Niyato, D., & Wang, P. (2015) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2015.2405539 · Cited by 284
Dynamic service migration in mobile edge-clouds
Wang, S., Urgaonkar, R., Zafer, M., He, T., Chan, K., & Leung, K. K. (2015) · 2015 IFIP Networking Conference (IFIP Networking) · doi:10.1109/ifipnetworking.2015.7145316 · Cited by 281
Efficient Algorithms for Capacitated Cloudlet Placements
Xu, Z., Liang, W., Xu, W., Jia, M., & Guo, S. (2016) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2015.2510638 · Cited by 256
Dynamic service migration and workload scheduling in edge-clouds
Urgaonkar, R., Wang, S., He, T., Zafer, M., Chan, K., & Leung, K. K. (2015) · Performance Evaluation · doi:10.1016/j.peva.2015.06.013 · Cited by 255
AppATP: An Energy Conserving Adaptive Mobile-Cloud Transmission Protocol
Liu, F., Shu, P., & Lui, J. C. S. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2401032 · Cited by 97
Capacitated cloudlet placements in Wireless Metropolitan Area Networks
Xu, Z., Liang, W., Xu, W., Jia, M., & Guo, S. (2015) · Conference on Local Computer Networks · doi:10.1109/lcn.2015.7366372 · Cited by 83
Chandra, A., Weissman, J., & Heintz, B. (2013) · IEEE Internet Computing · doi:10.1109/mic.2013.93 · Cited by 82
Asymptotically optimal algorithm for online reconfiguration of edge-clouds
Hou, I.-H., Zhao, T., Wang, S., & Chan, K. (2016) · ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) · doi:10.1145/2942358.2942363 · Cited by 79
Dynamic virtual machine management via approximate Markov decision process
Han, Z., Tan, H., Chen, G., Wang, R., Chen, Y., & Lau, F. C. M. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524384 · Cited by 77
Self-citationGame-theoretic Analysis of Computation Offloading for Cloudlet-based Mobile Cloud Computing
Ma, X., Lin, C., Xiang, X., & Chen, C. (2015) · ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM) · doi:10.1145/2811587.2811598 · Cited by 67
Large Scale Cloudlets Deployment for Efficient Mobile Cloud Computing
Tawalbeh, L., Jararweh, Y., Ababneh, F., & Dosari, F. (2015) · Journal of Networks · doi:10.4304/jnw.10.01.70-76 · Cited by 66
Chadha, J. S., Garg, N., Kumar, A., & Muralidhara, V. N. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536506 · Cited by 62
Fast algorithms for capacitated cloudlet placements
Ma, L., Wu, J., Chen, L., & Liu, Z. (2017) · International Conference on Computer Supported Cooperative Work in Design (CSCWD) · doi:10.1109/cscwd.2017.8066734 · Cited by 60
Application-aware traffic scheduling for workload offloading in mobile clouds
Liang, T., & Gao, W. (2016) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2016.7524520 · Cited by 39
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
All one needs to know about fog computing and related edge computing paradigms: A complete survey
Yousefpour, A., Fung, C., Nguyen, T., Kadiyala, K., Jalali, F., Niakanlahiji, A., Kong, J., & Jue, J. P. (2019) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2019.02.009 · Cited by 1,368
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
An Overview of Service Placement Problem in Fog and Edge Computing
Salaht, F. A., Desprez, F., & Lebre, A. (2021) · ACM Computing Surveys · doi:10.1145/3391196 · Cited by 336
Hierarchical Fog-Cloud Computing for IoT Systems: A Computation Offloading Game
Shah-Mansouri, H., & Wong, V. W. S. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2838022 · Cited by 322
Metadata
- Authors
- Tan, H., Han, Z., Li, X.-Y., & Lau, F. C. M.
- Venue
- IEEE INFOCOM 2017 - IEEE Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2017-05
- Pages
- 1-9
- OpenAlex
- W2762456226
- Cited by
- 280
- References
- 23
- FWCI
- 29.37
- 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.