4.7 Article

Radio and Computing Resource Allocation in Co-Located Edge Computing: A Generalized Nash Equilibrium Model

Journal

IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 22, Issue 4, Pages 2340-2352

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2021.3120520

Keywords

Colocated edge computing; energy saving; generalized Nash equilibrium problem; multi-access edge computing; queueing network; resource allocation; tower sharing

Ask authors/readers for more resources

Mobile Network Operators (MNO) can reduce their CAPEX and OPEX by utilizing tower sharing and partnering with Computing Resource Providers (CRP) to expand their network coverage and provide Multi-access Edge Computing services. This paper formulates a resource allocation problem to minimize OPEX for both MNOs and CRP in the task offloading scenario, and proposes decentralized algorithms to solve it efficiently.
Mobile Network Operators (MNO) can reduce their Capital and Operational Expenditure (CAPEX) and (OPEX) with the help of tower sharing approach by utilizing the physical infrastructure equipped by a third party tower provider to expand their network coverage. Moreover, Computing Resource Providers (CRP) are also setting up their micro-datacenters at tower stations to provide the Multi-access Edge Computing (MEC) services by cooperating with tower providers. Since both the communication and computing services contribute to the task offloading in MEC, the resource allocation has become a challenging problem. In this paper, we formulate the joint uplink, downlink, and computing resources allocation problem in which the objectives of both MNOs and CRP are to minimize their OPEX. The task offloading is modeled as a network of queues where the end-to-end latency is calculated based on the performance of the queue network. Then, the formulated problem is transformed into a Generalized Nash Equilibrium Problem (GNEP) to capture the conflicting interests in the resource allocation among MNOs and CRP. To solve the formulated GNEP efficiently, two decentralized algorithms are proposed by introducing the penalty parameters to the coupling constraints. In addition, the convergence and performance of the algorithms on different parameters are analyzed.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available