CoChat

READ: Robustness-Oriented Edge Application Deployment in Edge Computing Environment

Open access
Li, Bo, He, Qiang, Cui, Guangming, Xia, Xiaoyu, Chen, Feifei, Jin, Hai, Yang, Yun · 2022 · IEEE Transactions on Services Computing
Cited by 120

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

In recent years, edge computing has emerged as a prospective distributed computing paradigm that overcomes several limitations of cloud computing. In the edge computing environment, a service provider can deploy its application instances on edge servers at the edge of the network to serve its own users with low latency. Given a limited budget$\mathcal {K}$for deploying applications on the edge servers in a particular geographical area, a number of approaches have been proposed very recently to determine the optimal deployment strategy that achieves various optimization objectives, e.g., to maximize the servers’ coverage, to minimize the average network latency, etc. However, the robustness of the services collectively delivered by the service provider’s applications deployed on the edge servers has not been considered at all. This is a critical issue, especially in the highly distributed, dynamic and volatile edge computing environment. In this article, we make the first attempt to tackle this challenge. Specifically, we formulate thisRobustness-oriented Edge Application Deployment(READ) problem as a constrained optimization problem and prove its$\mathcal {NP}$-hardness. Then, we provide an integer programming based approach named READ-$\mathcal {O}$for solving this problem precisely. We also provide an approximation algorithm, namely READ-$\mathcal {A}$, for finding near-optimal solutions to large-scale READ problems efficiently. We prove its approximation ratio is not worse than$\mathcal {K}/2$, which is a constant regardless of the total number of edge servers. We evaluate our approaches experimentally on a widely-used real-world dataset against five representative approaches. The experiment results demonstrate that our approaches can solve the READ problem effectively and efficiently.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tsc.2020.3015316

Cites

8 of 8 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 120

Metadata

Authors
Li, B., He, Q., Cui, G., Xia, X., Chen, F., Jin, H., & Yang, Y.
Venue
IEEE Transactions on Services Computing
Published
2022-05-01
Volume
15
Issue
3
Pages
1746-1759
ISSN
  • 1939-1374 (ISSN-L)
  • 2372-0204
OpenAlex
W3048409550
Cited by
120
References
8
FWCI
7.31
Type
journal article
Language
en
Open access
green

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.