Mechanisms for Resource Allocation and Pricing in Mobile Edge Computing Systems

TLDR: In this article, the authors formulated the edge resource allocation problem as a Mixed-Integer Linear Program (MILP) problem and proved that the problem is NP-hard, and proposed two resource allocation mechanisms to solve the problem efficiently.

Abstract: In this article, we address the resource allocation and monetization challenges in Mobile Edge Computing (MEC) systems, where users have heterogeneous demands and compete for high quality services. We formulate the Edge Resource Allocation Problem ( ${{\sf ERAP}}$ ERAP ) as a Mixed-Integer Linear Program ( ${{\sf MILP}}$ MILP ) and prove that ${{\sf ERAP}}$ ERAP is ${{\sf NP}}$ NP -hard. To solve the problem efficiently, we propose two resource allocation mechanisms. First, we develop an auction-based mechanism and prove that the proposed mechanism is individually-rational and produces envy-free allocations . We also propose an ${{\sf LP}}$ LP -based approximation mechanism that does not guarantee envy-freeness, but it provides solutions that are guaranteed to be within a given distance from the optimal solution. We evaluate the performance of the proposed mechanisms by conducting an extensive experimental analysis on ${{\sf ERAP}}$ ERAP instances of various sizes. We use the optimal solutions obtained by solving the ${{\sf MILP}}$ MILP model using a commercial solver as benchmarks to evaluate the quality of solutions. Our analysis shows that the proposed mechanisms obtain near optimal solutions for fairly large size instances of the problem in a reasonable amount of time.