4.7 Article

Interference-Aware SaaS User Allocation Game for Edge Computing

Journal

IEEE TRANSACTIONS ON CLOUD COMPUTING
Volume 10, Issue 3, Pages 1888-1899

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCC.2020.3008448

Keywords

SaaS user allocation; interference; data rate; game theory; Edge computing; nash equilibrium; potential game

Funding

  1. Australian Research Council [DP180100212, DP200102491]
  2. Australian Research Council [DP200102491] Funding Source: Australian Research Council

Ask authors/readers for more resources

Edge computing is a promising paradigm that minimizes network latency and energy consumption by allocating users to nearby servers. However, allocating too many users may cause interference and impact data rates. In this article, a game-theoretic approach is proposed to solve this problem, and a decentralized algorithm is designed to find the optimal solution.
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.

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