Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Data, User and Power Allocations for Caching in Multi-Access Edge Computing|
|Citation:||IEEE Transactions on Parallel and Distributed Systems, 2022; 33(5):1144-1-1155-12|
|Publisher:||IEEE COMPUTER SOC|
|Xiaoyu Xia, Feifei Chen, Qiang He, Senior Member, IEEE, Guangming Cui, John C. Grundy, Senior Member, IEEE, Mohamed Abdelrazek, Xiaolong Xu, and Hai Jin, Fellow, IEEE|
|Abstract:||In the multi-access edge computing (MEC) environment, app vendors’ data can be cached on edge servers to ensure low-latency data retrieval. Massive users can simultaneously access edge servers with high data rates through flexible allocations of transmit power. The ability to manage networking resources offers unique opportunities to app vendors but also raises unprecedented challenges. To ensure fast data retrieval for users in the MEC environment, edge data caching must take into account the allocations of data, users, and transmit power jointly. We make the first attempt to study the Data, User, and Power Allocation (DUPA3) problem, aiming to serve the most users and maximize their overall data rate. First, we formulate the DUPA3 problem and prove its NP-completeness. Then, we model the DUPA3 problem as a potential DUPA3 game admitting at least one Nash equilibrium and propose a two-phase game-theoretic decentralized algorithm named DUPA3Game to achieve the Nash equilibrium as the solution to the DUPA3 problem. To evaluate DUPA3Game, we analyze its theoretical performance and conduct extensive experiments to demonstrate its effectiveness and efficiency.|
|Rights:||© 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See ht_tps://www.ieee.org/publications/rights/index.html for more information.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.