Risk-Aware Data Offloading in Multi-Server Multi-Access Edge Computing Environment
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Multi-access Edge Computing (MEC) has emerged as a flexible and cost-effective paradigm, enabling resource constrained mobile devices to offload, either partially or completely, computationally intensive tasks to a set of servers at the edge of the network. Given that the shared nature of the servers' resources introduces high computation and communication uncertainty, in this paper we consider users' risk-seeking or loss-aversion behavior in their final decisions regarding the portion of their computing tasks to be offloaded at each server in a multi-MEC server environment, while executing the rest locally. This is achieved by capitalizing on the power and principles of Prospect Theory and Tragedy of the Commons, treating each MEC server as a Common Pool of Resources available to all the users, while being rivarlous and subtractable, thus may potentially fail if over-exploited by the users. The goal of each user becomes to maximize its perceived satisfaction, as expressed through a properly formulated prospect-theoretic utility function, by offloading portion of its computing tasks to the different MEC servers. To address this problem and conclude to the optimal allocation strategy, a non-cooperative game among the users is formulated and the corresponding Pure Nash Equilibrium (PNE), i.e., optimal data offloading, is determined, while a distributed low-complexity algorithm that converges to the PNE is introduced. The performance and key principles of the proposed framework are demonstrated through modeling and simulation, while useful insights about the users' data offloading decisions under realistic conditions and behaviors are presented.
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
Prospect Theory: An Analysis of Decision Under Risk
Kahneman, D., & Tversky, A. (2013) · World Scientific Handbook in Financial Economics Series · doi:10.1142/9789814417358_0006 · Cited by 3,091
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
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858 · cited 1×
“For demonstration purposes, we consider the sequential quadratic programming (SQP) [27] method, that is also provided by the function fmincon() in the MATLAB Optimization Toolbox [28].”
MethodDynamic computation offloading for mobile-edge computing with energy harvesting devices
Mao, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2611964 · Cited by 1,705
Cited by
Sun, Z., Sun, G., Liu, Y., Wang, J., & Cao, D. (2024) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2023.3239339 · Cited by 213
Yuan, L., He, Q., Tan, S., Li, B., Yu, J., Chen, F., & Yang, Y. (2023) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2022.3231296 · Cited by 33
On Cooperative Federated Defense to Secure Multiaccess Edge Computing
Sedjelmaci, H., & Ansari, N. (2024) · IEEE Consumer Electronics Magazine · doi:10.1109/mce.2022.3167527 · Cited by 16
Metadata
- Authors
- Apostolopoulos, P. A., Tsiropoulou, E. E., & Papavassiliou, S.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2020-06
- Volume
- 28
- Issue
- 3
- Pages
- 1405-1418
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W3019721760
- Cited by
- 174
- References
- 4
- FWCI
- 14.03
- Type
- journal article
- 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: Risk-Aware Data Offloading in Multi-Server Multi-Access Edge Computing Environment. https://app.cochat.ai/papers/10.1109/tnet.2020.2983119
- The paper
- Apostolopoulos, P. A., Tsiropoulou, E. E., & Papavassiliou, S. (2020). Risk-Aware Data Offloading in Multi-Server Multi-Access Edge Computing Environment. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2020.2983119
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.