1. A family of truthful mechanisms for resource allocation with multi-attribute demand in mobile edge computing.
- Author
-
Liu, Xi, Liu, Jun, Wu, Hong, and Dong, Jing
- Subjects
MOBILE computing ,EDGE computing ,RESOURCE allocation ,CLOUD computing ,ALGORITHMS - Abstract
We address the problem of resource allocation with multi-attribute demand considering heterogeneous servers in mobile edge computing (MEC). A mobile device (MD) may be within the coverage area of multiple access points and can get resources from any server that can establish direct communication. However, the configurations of heterogeneous servers are different, so the demand for each MEC server is different. We tackle this problem and consider multi-attribute demand, where each MD is assigned exactly one of multiple demands. We formulate the allocation problem in an auction-based setting to provide server scalability. We propose a family of greedy mechanisms to solve the resource allocation problem. However, each MD is self-interested and may try to manipulate the system to maximize its utility. We show our mechanisms are truthful, and they drive the system into an equilibrium where no MD can declare an untrue value to obtain higher utility. We also analyze the approximation ratios of our greedy mechanisms. Experimental results demonstrate that the greedy mechanisms obtain the near-optimal allocation in a short period while benefiting MDs and edge cloud providers. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF