Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/138705
Citations
Scopus Web of Science® Altmetric
?
?
Type: Journal article
Title: Interference-aware SaaS User Allocation Game for Edge Computing
Author: Cui, G.
He, Q.
Xia, X.
Lai, P.
Chen, F.
Gu, T.
Yang, Y.
Citation: IEEE Transactions on Cloud Computing, 2022; 10(3):1888-1899
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Issue Date: 2022
ISSN: 2168-7161
2168-7161
Statement of
Responsibility: 
Guangming Cui, Qiang He, Xiaoyu Xia, Phu Lai, Feifei Chen, Tao Gu, and Yun Yang
Abstract: 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.
Keywords: SaaS user allocation; interference; data rate; game theory; Edge computing; nash equilibrium; potential game
Rights: © 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information
DOI: 10.1109/TCC.2020.3008448
Grant ID: http://purl.org/au-research/grants/arc/DP180100212
http://purl.org/au-research/grants/arc/DP200102491
Published version: http://dx.doi.org/10.1109/tcc.2020.3008448
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.