.png){kind=icon}
.png){kind=icon}
Return
Mean-Field-Type Game-Based Computation Offloading in Multi-Access Edge Computing Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2020.3021907.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-access edge computing (MEC) has been proposed to reduce latency inherent in traditional cloud computing. One of the services offered in an MEC network (MECN) is computation offloading in which computing nodes, with limited capabilities and performance, can offload computation-intensive tasks to other computing nodes in the network. Recently, mean-field-type game (MFTG) has been applied in engineering applications in which the number of decision makers is finite and where a decision maker can be distinguishable from other decision makers and have a non-negligible effect on the total utility of the network. Since MECNs are implemented through finite number of computing nodes and the computing capability of a computing node can affect the state (i.e., the number of computation tasks) of the network, we propose non-cooperative and cooperative MFTG approaches to formulate computation offloading problems. In these scenarios, the goal of each computing node is to offload a portion of the aggregate computation tasks from the network that minimizes a specific cost. Then, we utilize a direct approach to calculate the optimal solution of these MFTG problems that minimizes the corresponding cost. Finally, we conclude the paper with simulations to show the significance of the approach.
Keywords:
Task analysis
Games
Wireless communication
Edge computing
Cloud computing
Computational modeling
Aggregates
Mean-field-type games
computation offloading
multi-access edge computing networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
View more organizations