2020
DOI: 10.1109/tnet.2020.2983119
|View full text |Cite
|
Sign up to set email alerts
|

Risk-Aware Data Offloading in Multi-Server Multi-Access Edge Computing Environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 138 publications
(40 citation statements)
references
References 27 publications
0
40
0
Order By: Relevance
“…The optimization problem P2 can be solved via well known existing methods for solving constrained nonlinear optimization problems, and accordingly obtain the optimal contracts under the incomplete information scenario. For demonstration purposes, we utilize the Sequential Quadratic Programming (SQP) method [41], along with the fmincon() [42] function implemented by the MATLAB Optimization Toolbox to return the constrained nonlinear optimization problem's solution, the computational complexity of which is denoted as O(K) [43]. We also indicate as IT E the number of the iterations required by the SLA algorithm to converge.…”
Section: Complexity Analysismentioning
confidence: 99%
“…The optimization problem P2 can be solved via well known existing methods for solving constrained nonlinear optimization problems, and accordingly obtain the optimal contracts under the incomplete information scenario. For demonstration purposes, we utilize the Sequential Quadratic Programming (SQP) method [41], along with the fmincon() [42] function implemented by the MATLAB Optimization Toolbox to return the constrained nonlinear optimization problem's solution, the computational complexity of which is denoted as O(K) [43]. We also indicate as IT E the number of the iterations required by the SLA algorithm to converge.…”
Section: Complexity Analysismentioning
confidence: 99%
“…Currently, there are some works that consider the behavior characteristics of user-end side or MEC side about computation offloading. For user-end side an optimal data offloading of multi-users in multi-MEC is proposed in [34] taking into accounting risk-seeking or loss-aversion behavior of users. an optimal data offloading policy based on noncooperative game among the users is formulated and Pure Nash Equilibrium (PNE) is obtained.…”
Section: Computation Modelmentioning
confidence: 99%
“…Content may change prior to final publication. [9] Resource exhaustion, hardware failure, and SLA violations No Experimentation [12] Resource revocation risk No Experimentation [13] Data leakage No Graph Theory and heuristic [14] Reduce the risk of co-resident attack No Simulation [15] Reduce the risk of co-resident attack No Simulation [16] Reduce the risk of co-resident attack No Simulation [17] Virtual resources to protect the task execution Yes Semi-Markov Decision Process [18] Virtual resources to protect the task execution No Semi-Markov Decision Process [19] Virtual resources to protect the task execution No Semi-Markov Decision Process [20] Virtual resources to protect the task execution No Markov reward model and simulated annealing [21] Security overhead to protect the task execution Yes Genetic Algorithm [22] Security overhead to protect the task execution Yes Deep Reinforcement Learning [23] Computation and communication uncertainties Yes Game Theory [24] Risk-neutral user, risk-averse user, risk-seeking user Yes Simulation [25] IDS at the edge of the network Yes Stochastic Differential Equation [26] Service failure No Graph Theory [27] Service and server failure No System Optimization and Heuristics Our work…”
Section: Security Risk-aware Edge Server Orchestration a Related mentioning
confidence: 99%
“…Taking the computation and communication uncertainties at each MEC server as the risk figure, Apostolopoulos et al [23] formulated the problem of task offloading as a noncooperative game among the users and solved it by means of the pure Nash Equilibrium. A risk-centric broker mechanism is proposed by Iyer et al [24] in which the decision making problem is formulated to decide about the computing task placement between a cloud data center or a fog data center taking into account the user risk profile, price, and reputation of the cloud and fog service provider.…”
Section: Security Risk-aware Edge Server Orchestration a Related mentioning
confidence: 99%