TY - JOUR
T1 - Interference-aware SaaS user allocation game for edge computing
AU - Cui, Guangming
AU - He, Qiang
AU - Xia, Xiaoyu
AU - Lai, Phu
AU - Chen, Feifei
AU - Gu, Tao
AU - Yang, Yun
PY - 2022
Y1 - 2022
N2 - Edge Computing, extending cloud computing, has emerged as a prospective computing paradigm. It allows a SaaS (Software-as-a-Service) vendor to allocate its users to nearby edge servers to minimize network latency and energy consumption on their devices. From the SaaS vendor's perspective, a cost-effective SaaS user allocation (SUA) aims to allocate maximum SaaS users on minimum edge servers. However, the allocation of excessive SaaS users to an edge server may result in severe interference and consequently impact SaaS users' data rates. In this article, we formally model this problem and prove that finding the optimal solution to this problem is NP-hard. Thus, we propose ISUAGame, a game-theoretic approach that formulates the interference-aware SUA (ISUA) problem as a potential game. We analyze the game and show that it admits a Nash equilibrium. Then, we design a novel decentralized algorithm for finding a Nash equilibrium in the game as a solution to the ISUA problem. The performance of this algorithm is theoretically analyzed and experimentally evaluated. The results show that the ISUA problem can be solved effectively and efficiently.
AB - Edge Computing, extending cloud computing, has emerged as a prospective computing paradigm. It allows a SaaS (Software-as-a-Service) vendor to allocate its users to nearby edge servers to minimize network latency and energy consumption on their devices. From the SaaS vendor's perspective, a cost-effective SaaS user allocation (SUA) aims to allocate maximum SaaS users on minimum edge servers. However, the allocation of excessive SaaS users to an edge server may result in severe interference and consequently impact SaaS users' data rates. In this article, we formally model this problem and prove that finding the optimal solution to this problem is NP-hard. Thus, we propose ISUAGame, a game-theoretic approach that formulates the interference-aware SUA (ISUA) problem as a potential game. We analyze the game and show that it admits a Nash equilibrium. Then, we design a novel decentralized algorithm for finding a Nash equilibrium in the game as a solution to the ISUA problem. The performance of this algorithm is theoretically analyzed and experimentally evaluated. The results show that the ISUA problem can be solved effectively and efficiently.
KW - Edge computing
KW - SaaS user allocation
KW - data rate
KW - game theory
KW - interference
KW - nash equilibrium
KW - potential game
UR - http://www.scopus.com/inward/record.url?scp=85089294189&partnerID=8YFLogxK
UR - http://purl.org/au-research/grants/arc/DP180100212
UR - http://purl.org/au-research/grants/arc/DP200102491
U2 - 10.1109/TCC.2020.3008448
DO - 10.1109/TCC.2020.3008448
M3 - Article
VL - 10
SP - 1888
EP - 1899
JO - IEEE Transactions on Cloud Computing
JF - IEEE Transactions on Cloud Computing
SN - 2168-7161
IS - 3
ER -