arrow
返回

Interference-Aware SaaS User Allocation Game for Edge Computing

delete2022-07-01
delete24
PRE
AI
G
Guangming Cui
Q
Qiang He *
X
Xiaoyu Xia
P
Phu Lai
F
Feifei Chen
T
Tao Gu
Y
Yun Yang
DOI:10.1109/TCC.2020.3008448delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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.
Keyword:
SaaS user allocation
interference
data rate
game theory
Edge computing
nash equilibrium
potential game
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

I
IEEE Transactions on Cloud Computing
IF:
5
论文数:
1.8K
被引数:
4.3K

机构

S
Swinburne University of Technology
学者数:
9.3K
论文数: 1.2W
被引数: 2.0W
D
Deakin University
学者数:
2.0W
论文数: 2.1W
被引数: 2.8W