The DOI matches its Crossref record; 2 of the 2 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(2011) · doi:10.1145/1966445.1966473 · Cited by 1,870
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
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
Aslanpour, M. S., Gill, S. S., & Toosi, A. N. (2020) · Internet of Things · doi:10.1016/j.iot.2020.100273 · Cited by 289
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
- 2
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Online job dispatching and scheduling in edge-clouds. https://app.cochat.ai/papers/10.1109/infocom.2017.8057116
- The paper
- Tan, H., Han, Z., Li, X.-Y., & Lau, F. C. M. (2017). Online job dispatching and scheduling in edge-clouds. IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. https://doi.org/10.1109/infocom.2017.8057116
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.