Optimizing Social Welfare for Task Offloading in Mobile Edge Computing

While mobile applications are increasing in use and complexity, the computational constraints on mobile devices remain as the bottleneck for serving computation-intensive mobile applications. Mobile edge computing (MEC) provides a computing paradigm to serve the computational demands of such mobile applications by offloading the mobile devices’ computational tasks to the edge servers. Double auction has been adopted in MEC to provide a mechanism to assign the tasks of mobile devices to the edge servers while considering the satisfaction level for both entities. We improve the double auction mechanism beyond prior research in MEC. Specifically, we construct a model to support the real-world practices in the pricing scheme of edge computing, such as that provided by Amazon, and to support the parallelizing and distributing of workloads to multiple edge servers. We propose an efficient mechanism to achieve the optimal social welfare by converting the allocation problem to a minimum cost flow problem. In addition to reaching the optimal social welfare in polynomial time computations, our proposed mechanism achieves individual rationality and strong balance budget.

[1]  Andrew V. Goldberg,et al.  An efficient implementation of a scaling minimum-cost flow algorithm , 1993, IPCO.

[2]  M. Satterthwaite,et al.  Efficient Mechanisms for Bilateral Trading , 1983 .

[3]  Chuan Wu,et al.  Double Auction for Resource Allocation in Cloud Computing , 2017, CLOSER.

[4]  Haibin Zhang,et al.  Double Auction-Based Resource Allocation for Mobile Edge Computing in Industrial Internet of Things , 2018, IEEE Transactions on Industrial Informatics.

[5]  Nitinder Mohan,et al.  DeCloud: Truthful Decentralized Double Auction for Edge Clouds , 2019, 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS).

[6]  Zuo-Jun Max Shen,et al.  Truthful Double Auction Mechanisms , 2008, Oper. Res..

[8]  Yanlin Yue,et al.  Multi-Task Cross-Server Double Auction for Resource Allocation in Mobile Edge Computing , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[9]  Jie Zhang,et al.  A Discounted Trade Reduction Mechanism for Dynamic Ridesharing Pricing , 2016, IEEE Transactions on Intelligent Transportation Systems.

[10]  Weihua Zhuang,et al.  Auction-Based Resource Allocation for Sharing Cloudlets in Mobile Cloud Computing , 2018, IEEE Transactions on Emerging Topics in Computing.

[11]  Yan Zhang,et al.  Mobile Edge Computing: A Survey , 2018, IEEE Internet of Things Journal.

[12]  James B. Orlin,et al.  A faster strongly polynomial minimum cost flow algorithm , 1993, STOC '88.

[13]  Hong Ji,et al.  Combinational Auction-Based Service Provider Selection in Mobile Edge Computing Networks , 2017, IEEE Access.