Auction-Based VM Allocation for Deadline-Sensitive Tasks in Distributed Edge Cloud

Edge cloud computing is a new paradigm in which the computation and storage services of remote cloud data centers are moved to Edge Cloud Nodes (ECNs) in network edges. Compared to traditional cloud data centers, ECNs are geographically close to mobile users so the communication latency is significantly reduced. In this paper, we study the problem of allocating Virtual Machine (VM) resources in geo-distributed ECNs to mobile users by using the auction theory. First, we treat mobile users and ECNs as the buyers and sellers of the VM resource auction, respectively. Then, we model the VM resource allocation problem as an n-to-one weighted bipartite graph matching problem with 0-1 knapsack constraints. Since this problem is NP-hard, we design a greedy approximation algorithm to determine the winners of the auction, based on which we propose a truthful Auction-based VM resource Allocation (AVA) mechanism to solve the problem. Moreover, we prove that the AVA mechanism not only achieves an approximately optimal solution for winner selection, but also has the properties of truthfulness, individual rationality, and computational efficiency. Finally, we conduct extensive simulations on real traces to verify the significant performances of the proposed AVA mechanism.

Automated summary

This paper investigates the problem of allocating VM resources to mobile users in geo-distributed ECNs using auction theory, proposing the AVA mechanism. A greedy approximation algorithm is designed to determine the winners, and it is shown that the AVA mechanism achieves an approximately optimal solution while possessing properties of truthfulness, individual rationality, and computational efficiency. Extensive simulations on real traces demonstrate the significant performance of the proposed AVA mechanism.